Data Structures

a) in digital currency b) in sorting of large data c) for indexing in databases d) in encryption of data

a) B+ – tree b) T tree c) Tiger tree hash d) Htree

 a) Heap b) Hash list c) BST d) B – tree

 a) Priority queue b) Stack c) A decreasing order array d) None of the mentioned

a) Leaf node b) First node of left sub tree c) root node d) First node of right sub tree

a) 24 b) 21 c) 25 d) 16

a) Must be connected b) Must be unweighted c) Must have no loops or multiple edges d) All of the mentioned

a) 15 b) 3 c) 1 d) 11

 a) (n*(n+1))/2 b) (n*(n-1))/2 c) N d) Information given is insufficient

a) ne  b) 2n c) 2e d) e^n

a) Stack.  b) Queue.  c) Linked List.  d) None of these.

a) Nodes b) Edges  c) Direction of edges d) Parallel edges

a) Inverse sorting b) Direct sorting c) Both a and b d) None of these

a) Different b) Same c) May be same d) None of these

a) Comparison sort b) Direct sort c) Insertion sort d) None of these

a) O(n) b) O(n2) c) O(3n) d) None of these.