21- What about recursion is true in comparison with iteration?
(A) every recursive program can be written with iteration too.
(B) very expensive in terms of memory.
(C) low performance.
(D) all of the above
22- An important application of binary tree is _______
(A) traverse a cyclic graph
(B) queue implementation
(C) stack implementation
(D) Huffman coding
23- Visiting root node after visiting left and right sub-trees is called
(A) Iteration
(B) Post-order Traversal
(C) Pre-order Traversal
(D) In-order Traversal
24- What is the minimum height for a binary search tree with 60 nodes?
(A) 2
(B) 4
(C) 3
(D) 1
25- Which of the following case does not exist in complexity theory?
(A) Null case
(B) Average case
(C) Worst case
(D) Best case
26- The process of accessing data stored in a serial access memory is similar to manipulating data on a _______
(A) Stack
(B) Array
(C) Binary Tree
(D) Heap
27- In special case, the time complexity of inserting/deleting elements at the end of dynamic array is _______
(A) O (1)
(B) O (log n)
(C) O (n1/2)
(D) O (n)
28- Which of the following statement(s) about stack data structure is/are NOT correct?
(A) Null link is present in the last node at the bottom of the stack
(B) Stack is the FIFO data structure
(C) Top of the Stack always contain the new node
(D) Linked List are used for implementing Stacks
29- What would be the asymptotic time complexity to insert an element at the front of the linked list (head is known)?
(A) O(n3)
(B) O(n2)
(C) O(n)
(D) O(1)
30- Which of the following concepts make extensive use of arrays?
(A) Spatial locality
(B) Caching
(C) Scheduling of processes
(D) Binary trees
ANSWERS:
21-(D), 22-(D), 23-(B), 24-(A), 25-(A), 26-(A), 27-(D), 28-(B), 29-(D), 30-(A)