Q. The Complexity of binary search algorithm is
(a) O(log n)
(b) O(n)
(c) O(n log n)
(d) O(n2)

Q. Breadth first search is used in
(a) Binary tree
(b) Stacks
(c) Graphs
(d) Queues

Q. A linked list whose last node points back to the list instead of containing the null pointer
(a) Circular list
(b) Linked list
(c) Circular doubly linked list
(d) Doubly linked list

Q. Which among the following belongs to the category of a Pre-order Traversal?
(a) Root -> Left Sub Tree -> Right Sub Tree
(b) Root -> Right Sub Tree -> Left Sub Tree
(c) Right Sub Tree -> Left Sub Tree -> Root
(d) left Sub Tree -> right Sub Tree -> Root

Q. Which of the following is the fastest sorting algorithm to sort lists?
(a) Insertion Sort
(b) Merge Sort
(c) Quick Sort
(d) Bubble sort