# Data Structures and Algorithms Multiple Choice Questions - Set 10

91.       Applications of Linked List are
(A) Simulation, event driven systems
(B) Postfix and prefix manipulations
(C) Dictionary systems, polynomial manipulations
(D) Fixed block storage allocation, garbage collection
92.       AVL trees have LL, LR, RR, RL rotations to balance the tree to maintain the balance factor (LR : Insert node in Right sub tree of Left sub tree of node A, etc). Among rotations the following are single and double rotations
(A) LL, RL and LR, RR
(B) LL, RR and LR, RL
(C) LR, RR and LL, RL
(D) LR, RL and LR, RL
93.       Hashing collision resolution techniques are:
(A) Huffman coding, linear hashing
(B) Bucket addressing, Huffman coding
(C) Chaining, Huffman coding
(D) Chaining, Bucket addressing
94.       After each iteration in bubble sort:
(A) at least one element is at its sorted position.
(B) one less comparison is made in the next iteration.
(C) Both (A) & (B) are true.
(D) Neither (A) or (B) are true.
95.       The running time of the following sorting algorithm depends on whether the partitioning is balanced or unbalanced.
(A) Insertion sort
(B) Selection sort
(C) Quick sort
(D) Merge sort

96.       A procedure that calls itself is called ...............
(A) illegal call
(B) reverse polish
(C) recursive
(D) None of these
97.       Graphs are represented using ............
98.       The average case complexity of Insertion Sort is
(A) O(2n)
(B) O(n3)
(C) O(n2)
(D) O(2n)
99.       Heap is an example of ................
(A) complete binary tree
(B) spanning tree
(C) sparse tree
(D) binary search tree
100.    Infinite recursion leads to ...............
(A) Overflow of run-time stack
(B) Underflow of registers usage
(C) Overflow of I/O cycles
(D) Underflow of run-time stack
1. 