Sorting and Asymptotic Notations

Q.1 To main measures of the efficiency of an algorithm is?

• a. Time and space complexity

• b. Data and space

• c. Processor and memory

• d. Complexity and capacity

Q.2 which of the following is a Divide and Conquer algorithm?

• a. Heap sort

• b. Merge sort

• c. Bubble sort

• d. Selection sort

Q.3 which of the following data structure is used to perform recursion?

• a. Linked list

• b. Array

• c. Stack

• d. Queue

Q.4 Identify the best case time complexity of selection sort?

• a. O (n logn)

• b. O (n^2)

• c. O (n)

• d. O (1)

Q.5 what is the time complexity of the binary search algorithm?

• a. O (logn)

• b. O (n^2)

• c. O (n)

• d. O (1)

Q.6 The worst-case time complexity of Quicksort is?

• a. O (logn)

• b. O (n^2)

• c. O (n)

• d. O (1)

Q.7 what is the technique called in which it does not require extra memory for carrying out the sorting procedure?

• a. Stable

• b. Unstable

• c. In-place

• d. Out-place

Q.8 Which of the following functions provides the maximum asymptotic complexity?

• a. F1 (n) = n^ (3/2)

• b. F2 (n) = n^ (log n)

• c. F3 (n) = n logn

• d. F4 (n) = 2^n

Q.9 What is the maximum number of swaps that can be performed in the Selection Sort algorithm?

• a. n-1

• b. n

• c. 1

• d. n-2

Q.10 Among the following options which is the best sorting algorithm when the list is already sorted?

• a. Insertion sort

• b. Merge sort

• c. Bubble sort

• d. Selection sort