A. Quick sort is also known as: a. Merge sort b. Partition and exchange sort c. Shell sort d. None of the above B. Which sorting algorithm is of divide and conquer type? a. Bubble sort b. Insertion...

a. Merge sort b. Partition and exchange sort

c. Shell sort d. None of the above

B. Which sorting algorithm is of divide and conquer type?

a. Bubble sort b. Insertion sort

c. Selection sort d. Quick sort

C. The worst case while searching an element in linear search is _____________.

a. Element is present in the middle of the list

b. Element is present at the last

c. Element is not present in the list at all

d. Element is present at the first position