Register

Recent questions tagged ugcnetcse-jan2017-paper3

2 votes
4 answers
61
UGC NET CSE | January 2017 | Part 3 | Question: 64
Let C be a binary linear code with minimum distance $2t+1$ then it can correct upto ___ bits of error $t+1$ $t$ $t-2$ $t/2$
Let C be a binary linear code with minimum distance $2t+1$ then it can correct upto ___ bits of error$t+1$$t$$t-2$$t/2$
User Avatar
0 votes
1 answer
64
UGC NET CSE | January 2017 | Part 3 | Question: 56
Consider the following AO graph: Which is the best node to expand by next AO* algorithm? A B C B and C
Consider the following AO graph:Which is the best node to expand by next AO* algorithm?ABCB and C
User Avatar
0 votes
4 answers
69
UGC NET CSE | January 2017 | Part 3 | Question: 33
Red-black trees are one of many search tree schemes that are “balanced” in order to guarantee that basic dynamic-set operations take _____ time in the worst case. $O(1)$ $O( \lg n)$ $O(n)$ $O(n \lg n)$
Red-black trees are one of many search tree schemes that are “balanced” in order to guarantee that basic dynamic-set operations take _____ time in the worst case.$O(1...
User Avatar
2 votes
7 answers
70
UGC NET CSE | January 2017 | Part 3 | Question: 32
Any decision tree that sorts n elements has height ____ $\Omega (\lg \: n)$ $\Omega (n)$ $\Omega (n \: \lg \: n)$ $\Omega (n^2)$
Any decision tree that sorts n elements has height ____$\Omega (\lg \: n)$$\Omega (n)$$\Omega (n \: \lg \: n)$$\Omega (n^2)$
User Avatar
3 votes
11 answers
71
UGC NET CSE | January 2017 | Part 3 | Question: 31
The asymptotic upper bound solution of the recurrence relation given by $T(n) = 2T \left( \frac{n}{2} \right) +\frac{n}{\lg \: n}$ is $O(n^2)$ $O(n \:\lg \: n )$ $O(n \:\lg \:\lg \: n)$ $O(\lg \:\lg \: n)$
The asymptotic upper bound solution of the recurrence relation given by $T(n) = 2T \left( \frac{n}{2} \right) +\frac{n}{\lg \: n}$ is$O(n^2)$$O(n \:\lg \: n )$$O(n \:\lg ...
User Avatar
0 votes
5 answers
72
UGC NET CSE | January 2017 | Part 3 | Question: 28
In a packet switching network, if the message size is 48 bytes and each packet contains a header of 3 bytes. If 24 packets are required to transmit the message, the packet size is 2 bytes 1 byte 4 bytes 5 bytes
In a packet switching network, if the message size is 48 bytes and each packet contains a header of 3 bytes. If 24 packets are required to transmit the message, the packe...
User Avatar
1 votes
3 answers
75
UGC NET CSE | January 2017 | Part 3 | Question: 12
If following sequence of keys are inserted in a B+ tree with K(=3) pointers: 8, 5, 1, 7, 3, 12, 9, 6 Which of the following shall be correct B+ tree?
If following sequence of keys are inserted in a B+ tree with K(=3) pointers:8, 5, 1, 7, 3, 12, 9, 6Which of the following shall be correct B+ tree?
User Avatar
Page: