Solved Questions Paper-2 UGC-NET Computer Science November 2017
21. | Consider an array representation of an n element binary heap where the elements are stored from index 1 to index n of the array. For the element stored at index i of the array (i< = n), the index of the parent is: |
A. | floor ((i +1)/2) |
B. | ceiling ((i + 1)/2) |
C. | floor (i/2) |
D. | ceiling (i/2) |
View/Hide Ans | |
Explanation | |
22. | The following numbers are inserted into an empty binary search tree in the given order: 10, 1, 3, 5, 15, 12, 16. What is the height of the binary search tree? |
A. | 3 |
B. | 4 |
C. | 5 |
D. | 6 |
View/Hide Ans | |
Explanation | |
23. | Let G be an undirected connected graph with distinct edge weight. Let Emax be the edge with maximum weight and Emin the edge with minimum weight. Which of the following statements is false? |
A. | Every minimum spanning tree of G must contain Emin. |
B. | If Emax is in minimum spanning tree, then its removal must disconnect G. |
C. | No minimum spanning tree contains Emax. |
D. | G has a unique minimum spanning tree. |
View/Hide Ans | |
Explanation | |
24. | A list of n strings, each of length n, is sorted into lexicographic order using merge - sort algorithm. The worst case running time of this computation is: |
A. | O(n log n) |
B. | O(n^{2} log n) |
C. | O(n^{2} + log n) |
D. | O(n^{3}) |
View/Hide Ans | |
Explanation | |
25. | Postorder traversal of a given binary search tree T produces following sequence of keys: 3, 5, 7, 9, 4, 17, 16, 20, 18, 15, 14 Which one of the following sequences of keys can be the result of an in-order traversal of the tree T? |
A. | 3, 4, 5, 7, 9, 14, 20, 18, 17, 16, 15 |
B. | 20, 18, 17, 16, 15, 14, 3, 4, 5, 7, 9 |
C. | 20, 18, 17, 16, 15, 14, 9, 7, 5, 4, 3 |
D. | 3, 4, 5, 7, 9, 14, 15, 16, 17, 18, 20 |
View/Hide Ans | |
Explanation | |
26. | Which of the following devices takes data sent from one network device and forwards it to the destination node based on MAC address? |
A. | Hub |
B. | Modem |
C. | Switch |
D. | Gateway |
View/Hide Ans | |
Explanation | |
27. | .................. do not take their decisions on measurements or estimates of the current traffic and topology. |
A. | Static algorithms |
B. | Adaptive algorithms |
C. | Non - adaptive algorithms |
D. | Recursive algorithms |
View/Hide Ans | |
Explanation | |
28. | The number of bits used for addressing in Gigabit Ethernet is ................... |
A. | 32 bits |
B. | 48 bits |
C. | 64 bits |
D. | 128 bits |
View/Hide Ans | |
Explanation | |
29. | Which of the following layer of OSI Reference model is also called end-to-end layer? |
A. | Network layer |
B. | Data link layer |
C. | Session layer |
D. | Transport layer |
View/Hide Ans | |
Explanation | |
30. | The IP address ................... is used by hosts when they are being booted. |
A. | 0.0.0.0 |
B. | 1.0.0.0 |
C. | 1.1.1.1 |
D. | 255.255.255.255 |
View/Hide Ans | |
Explanation |
Author Does Not claim of any answer these answers are as per expert opinion