Digital Globalsoft Placement Paper - Data Structure Questions And Answers

Digital Globalsoft Previous Years Solved Sample Placement Papers

1. You have two jars, one jar which has 10 rings and the other has none. They are placed one above the other. You want to remove the last ring in the jar. And the second jar is weak and cannot be used to store rings for a long time.

   A) Empty the first jar by removing it one by one from the first jar and placing it into the second jar

   B) Empty the first jar by removing it one by one from the first jar and placing it into the second jar and empty the second jar by placing all the rings into the first jar one by one (Ans)

   C) There exists no possible way to do this

   D) Break the jar and remove the last one

2. Given only a single array of size 10 and no other memory is available. Which of the following operations is not feasible to implement (Given only push and pop operation)?

   A) Push

   B) Pop

   C) Enqueue (Ans)

   D) Returntop

3. Given an array of size n, let�s assume an element is �touched� if and only if some operation is performed on it (for example, for performing a pop operation the top element is �touched�). Now you need to perform Dequeue operation. Each element in the array is touched at least?

   A) Once

   B) Twice

   C) Thrice

   D) Four times (Ans)

4. Which of the following is the most widely used external memory data structure?

   A) AVL tree

   B) B-tree (Ans)

   C) Red-black tree

   D) Both AVL tree and Red-black tree

5. B-tree of order n is a order-n multiway tree in which each non-root node contains __________

   A) at most (n � 1)/2 keys

   B) exact (n � 1)/2 keys

   C) at least 2n keys

   D) at least (n � 1)/2 keys (Ans)

6. A B-tree of order 4 and of height 3 will have a maximum of _______ keys.

   A) 255 (Ans)

   B) 63

   C) 127

   D) 188

7. Five node splitting operations occurred when an entry is inserted into a B-tree. Then how many nodes are written?

   A) 14

   B) 7

   C) 11 (Ans)

   D) 5

8. B-tree and AVL tree have the same worst-case time complexity for insertion and deletion.

   A) True (Ans)

   B) False

9. 2-3-4 trees are B-trees of order 4. They are an isometric of _____ trees.

   A) AVL

   B) AA

   C) 2-3

   D) Red-Black (Ans)