The process of accessing data stored in a serial access memory is similar to manipulating data on a ________
a) Heap b) Binary Tree c) Array d) Stack
Data Structures
The data structure required to check whether an expression contains balanced parenthesis is?
a) Stack b) Queue c) Array d) Tree
The concatenation of two list can performed in O(1) time. Which of the following variation of linked list can be used?
a) S ingly linked list b) Doubly linked list c) Circular doubly linked list d) Array implementation of list
In linked list each node contain minimum of two fields. One field is data field to store the data second field is?
a) Pointer to character b) Pointer to integer c) Pointer to node d) Node
Which of the following concepts make extensive use of arrays?
a) Binary trees b) Scheduling of processes c) Caching d) Spatial locality
Rotations in deletion have ______ cases for single rotations.
a) 3 b) 4 c) 2 d) 1
In AVL tree delete to delete will require you to go all the way back to the looking for imbalances.
a) Child b) First c) Root d) Parent
In AVL tree delete ________ children is used to replace it with null.
a) Zero b) Two c) One d) Three
What maximum difference in heights between the leafs of a AVL tree is possible?
a) log (n) where n is the number of nodes b) n where n is the number of nodes c) 0 or 1 d) atmost 1
An AVL delete is similar to a regular ______ tree delete.
a) Float b) Decimal c) Binary d) Char
What data structure would you mostly likely see in a non recursive implementation of a recursive algorithm?
(a) LinkList (b) Stack (c) Queue (d) Tree
Which of the following is not possible as a balance factor of any node of an AVL tree?
a) 0 b) +1 C) -1 D) 2
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
The balance factor for an AVL tree is either
a) 0,1 or –1 b) –2,–1 or 0 c) 0,1 or 2 d) All the above
A binary search tree whose left sub tree and right sub tree differ in hight by at most 1 unit is called ……
A) AVL tree B) Red-black tree C) Lemma tree D) None of the above