# Data Structures and Algorithms Multiple Choice Questions - Set 23

221.       The process of accessing data stored in a serial access memory is similar to manipulating data on a ...............
(A) heap
(B) queue
(C) stack
(D) binary tree
222.       Recursion uses more memory space than iteration because ...............
(A) it uses stack instead of queue.
(B) every recursive call has to be stored.
(C) both A & B are true.
(D) None of the above.
223.       Stack is used for .................
(A) CPU Resource Allocation
(B) Breadth First Traversal
(C) Recursion
(D) None of the above
224.       A graph with n vertices will definitely have a parallel edge or self loop if the total number of edges are ...................
(A) greater than n–1
(B) less than n(n–1)
(C) greater than n(n–1)/2
(D) less than n2/2
225.       Re-balancing of AVL tree costs ..............
(A) ÎŸ(1)
(B) ÎŸ(log n)
(C) ÎŸ(n)
(D) ÎŸ(n2)
226.       Given that the line
delete newPtr;
just executed, what can you conclude?
(A) The memory referenced by newPtr is released only if it is needed by the system.
(B) The pointer newPtr is of type void *.
(C) The pointer newPtr only exists if there was an error freeing the memory.
(D) The pointer newPtr still exists.
227.       A BST is traversed in the following order recursively: Right, root, left
The output sequence will be in
(A) Ascending order
(B) Descending order
(C) Bitomic sequence
(D) No specific order
228.       Quick sort running time depends on the selection of ..................
(A) size of array
(B) pivot element
(C) sequence of values
(D) none of the above
229.       The pre-order and post order traversal of a Binary Tree generates the same output. The tree can have maximum ..............
(A) Three nodes
(B) Two nodes
(C) One node
(D) Any number of nodes