A directory of Objective Type Questions covering all the Computer Science subjects.

 1. `What is the worst case time complexity of linear search algorithm?` a. Ο(1) b. Ο(n) c. Ο(log n) d. Ο(n2)

 2. `An algorithm is` a. a piece of code to be executed. b. a loosely written code to make final code. c. a step by step procedure to solve problem. d. all of the above.

 3. `In context with time-complexity, find the odd out −` a. Deletion from Linked List. b. Searching in Hash Table c. Adding edge in Adjacency Matrix d. Heapify a Binary Heap

 4. `Interpolation search is an improved variant of binary search. It is necessary for this search algorithm to work that −` a. data collection should be in sorted form and equally distributed. b. data collection should be in sorted form and but not equally distributed. c. data collection should be equally distributed but not sorted. d. None of the above.

 5. `If the array is already sorted, which of these algorithms will exhibit the best performance` a. Merge Sort b. Insertion Sort c. Quick Sort d. Heap Sort

 6. `Which of these algorithmic approach tries to achieve localized optimum solution −` a. Greedy approach b. Divide and conquer approach c. Dynamic approach d. All of the above

 7. `Apriori analysis of an algorithm assumes that −` a. the algorithm has been tested before in real environment. b. all other factors like CPU speed are constant and have no effect on implementation. c. the algorithm needs not to be practical. d. none of the above.
 8. `What is the worst case run-time complexity of binary search algorithm?` a. Ο(n2) b. Ο(nlog n) c. Ο(n3) d. Ο(n)
 9. `Apriory algorithm analysis does not include −` a. Time Complexity b. Space Complexity c. Program Complexity d. None of the above
 10. `Time complexity of Depth First Traversal of is` a. Θ(|V|+|E|) b. Θ(|V|) c. Θ(|E|) d. Θ(|V|*|E|)