C Interview Questions 191-200

This post contains 191-200 questions of c program. It will helpful to solve c aptitude questions, c quiz , c objective type questions etc in interview.

191-200 Questions

Q1:
The time complexity of selection sort in worst case is
a) O(n) 
b) O(n2) 
c) O(nlogn) 
d) O(logn)
Answer:

Q2:
The time complexity of insertion sort in worst case is
a) O(n) 
b) O(n2) 
c) O(nlogn) 
d) O(logn)
Answer:

Q3:
The time complexity of quick sort in worst case is
a) O(n) 
b) O(n2) 
c) O(nlogn) 
d) O(logn)
Answer:

Q4:
The time complexity of heap sort in worst case is
a) O(n) 
b) O(n2) 
c) O(nlogn) 
d) O(logn)
Answer:

Q5:
The time complexity of merge sort in worst case is
a) O(n) 
b) O(n2) 
c) O(nlogn) 
d) O(logn)
Answer:  

Q6:
Quick sort is an application of 
a) partition exchange sort 
b) partition sort 
c) greedy method 
d) divide and conquer
Answer:

Q7:
Merge sort is an application of 
a) greedy method 
b) divide and conquer 
c) a&b 
d) none
Answer:

Q8:
The space complexity of Quick sort in average case is 
a) 0 
b) O(n) 
c) O(nlogn) 
d) O(logn)
Answer:

Q9:
The space complexity of bubble sort in worst case is 
a) 0 
b) O(n) 
c) O(nlogn) 
d) O(logn)
Answer:

Q10:
Binary search is effective only when the elements are in 
a) ascending order 
b) descending order 
c) a& b 
d) jumbled order

Answer:

Comments are closed.