**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:**

**(1) floor ((i +1)/2)**

**(2) ceiling ((i + 1)/2)**

**(3) floor (i/2)**

**(4) ceiling (i/2)**

**Answer: 3**

**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?**

**(1) 3**

**(2) 4**

**(3) 5**

**(4) 6**

**Answer: 1**

**Let G be an undirected connected graph with distinct edge weight. Let E**_{max}be the edge with maximum weight and E_{min}the edge with minimum weight. Which of the following statements is false?

**(1) Every minimum spanning tree of G must contain E _{min}.**

**(2) If E _{max} is in minimum spanning tree, then its removal must disconnect G.**

**(3) No minimum spanning tree contains E _{max}.**

**(4) G has a unique minimum spanning tree.**

**Answer: 3**

**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:**

**(1) O(n log n)**

**(2) O(n ^{2} log n)**

**(3) O(n ^{2} + log n)**

**(4) O(n ^{3})**

**Answer: 2**

**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?**

**(1) 3, 4, 5, 7, 9, 14, 20, 18, 17, 16, 15**

**(2) 20, 18, 17, 16, 15, 14, 3, 4, 5, 7, 9**

**(3) 20, 18, 17, 16, 15, 14, 9, 7, 5, 4, 3**

**(4) 3, 4, 5, 7, 9, 14, 15, 16, 17, 18, 20**

**Answer: 4**

**Which of the following devices takes data sent from one network device and forwards it to the destination node based on MAC address?**

**(1) Hub**

**(2) Modem**

**(3) Switch**

**(4) Gateway**

**Answer: 3**

**……………… do not take their decisions on measurements or estimates of the current traffic and topology.**

**(1) Static algorithms**

**(2) Adaptive algorithms**

**(3) Non – adaptive algorithms**

**(4) Recursive algorithms**

**Answer: 3**

**The number of bits used for addressing in Gigabit Ethernet is ……………….**

**(1) 32 bits**

**(2) 48 bits**

**(3) 64 bits**

**(4) 128 bits**

**Answer: 2**

**Which of the following layer of OSI Reference model is also called end-to-end layer?**

**(1) Network layer**

**(2) Datalink **layer

**(3) Session layer**

**(4) Transport layer**

**Answer: 4**

**The IP address ………………. is used by hosts when they are being booted.**

**(1) 0.0.0.0**

**(2) 1.0.0.0**

**(3) 1.1.1.1**

**(4) 255.255.255.255**