 A directory of Objective Type Questions covering all the Computer Science subjects. Here you can access and discuss Multiple choice questions and answers for various compitative exams and interviews.

#### Important Notice!

Dear users, compscibits.com is now permanently moved to compsciedu.com. Please update all your links and bookmarks accordingly. Soon, the site will be accessible through URL compsciedu.com only.

 21. The space factor when determining the efficiency of algorithm is measured by a. Counting the maximum memory needed by the algorithm b. Counting the minimum memory needed by the algorithm c. Counting the average memory needed by the algorithm d. Counting the maximum disk space needed by the algorithm

 22. Which of the following case does not exist in complexity theory a. Best case b. Worst case c. Average case d. Null case

 23. The complexity of the average case of an algorithm is a. Much more complicated to analyze than that of worst case b. Much more simpler to analyze than that of worst case c. Sometimes more complicated and some other times simpler than that of worst case d. None of the above

 24. The complexity of linear search algorithm is a. O(n) b. O(log n) c. O(n2) d. O(n log n)

 25. The complexity of Binary search algorithm is a. O(n) b. O(log n) c. O(n2) d. O(n log n)

 26. The complexity of Bubble sort algorithm is a. O(n) b. O(log n) c. O(n2) d. O(n log n)

 27. The complexity of merge sort algorithm is a. O(n) b. O(log n) c. O(n2) d. O(n log n)