Page 1 :
(D) Completely connected, Ans: B, , Contains no cycles, , 5. The elements of a linked list are stored, , (A) In a structure, , (B) In an array, , (C) Anywhere the computer has space for them, (D) In contiguous memory locations, , Ans: C, , Anywhere the computer has space for them, , 6. A parentheses checker program would be best implemented using, (A) List, , (B) Queue, , (C) Stack, , (D) Any of the above, , Ans: C, , Stack, , 7. To perform level-order traversal on a binary tree, which of the, following data structure will be required?, , (A) Hash table, , (B) Queue, , (C) Binary search tree, (D) Stack, , Ans: B, , Queue, , 8. Which of the following data structure is required to convert, arithmetic expression in infix to its equivalent postfix notation?, , (A) Queue, , (B) Linked list, , (C) Binary search tree, (D) None of above, Ans: D, , None of above, , 9. A binary tree in which all its levels except the last, have maximum, numbers of nodes, and all the nodes in the last level have only one, child it will be its left child. Name the tree., , (A) Threaded tree, , (B) Complete binary tree, (C) M-way search tree, (D) Full binary tree, , Ans: B, , Complete binary tree, , 10. Which of following data structure is more appropriate for, implementing quick sort iteratively?