a)    7 6 b)   6 7 c)    8 5 d)   5 8

a) O(nlogn) b) O(logn) c) O(n) d) O(n2)

 a) A queue with insert/delete defined for both front and rear ends of the queue b) A queue implemented with a doubly linked list c) A queue implemented with both singly and doubly linked lists d) None of the mentioned

 a) O(m) b) O(n) c) O(m*n) d) Data is insufficient

 a) effective usage of memory b) easier computations c) all of the mentioned d) none of the mentioned

a) overflow b) underflow c) null pointer exception d) all of the mentioned

a) 3 b) 4 c) 1 d) 2

a) Complexity of Insertion and Deletion at known position is O(n) in SLL and O(1) in DLL b) SLL uses lesser memory per node than DLL c) DLL has more searching power than SLL d) All of the mentioned

 a)  O(n) b)  O(1) c)  logn d)  nlogn

a)  Queue b)  Stack c)  Vector d)  Array List

a)  Linked list b)  Stack c)  Segment Tree d)  Queue

a)  1 b)  (n*(n-1))/2 c)  (n*(n-1)) d)  n-1

a)  O (1) b)  O (n) c)  O (logn) d)  O (nlogn)

a)  Accessing item from an undefined stack b)  Adding items to a full stack c)  Removing items from an empty stack d)  Index out of bounds exception

a)  Heap b)  Binary Tree c)  Array d)  Stack

a)  Stack b)  Queue c)  Array d)  Tree