Digital Globalsoft Placement Paper - Data Structure Questions And Answers

Digital Globalsoft Previous Years Solved Sample Placement Papers

1. What is the best-case height of a B-tree of order n and which has k keys?

   A) logn (k+1) � 1 (Ans)

   B) nk

   C) logk (n+1) � 1

   D) klogn

2. Compression techniques can be used on the keys to reduce both space and time requirements in a B-tree.

   A) True (Ans)

   B) False

3. Which of the following is true?

   A) Larger the order of B-tree, less frequently the split occurs (Ans)

   B) Larger the order of B-tree, more frequently the split occurs

   C) Smaller the order of B-tree, more frequently the split occurs

   D) Smaller the order of B-tree, less frequently the split occurs

4. How many children does a binary tree have?

   A) 2

   B) Any number of children

   C) 0 or 1 or 2 (Ans)

   D) 0 or 1

5. What is/are the disadvantages of implementing a tree using normal arrays?

   A) Difficulty in knowing children nodes of a node

   B) Difficult in finding the parent of a node

   C) Have to know the maximum number of nodes possible before creation of trees (Ans)

   D) Difficult to implement

6. What must be the ideal size of an array if the height of the tree is �l�?

   A) 2^l-1 (Ans)

   B) l-1

   C) l

   D) 2^l

7. What are the children for node �w� of a complete binary tree in an array representation?

   A) 2w and 2w+1 (Ans)

   B) 2+w and 2-w

   C) w+1/2 and w/2

   D) w-1/2 and w+1/2

8. What is the parent for a node �w� of a complete binary tree in an array representation when w is not 0?

   A) floor((w-1)/2) (Ans)

   B) ceil((w-1)/2)

   C) (w-1)/2

   D) w/2