This set of Data Structures & Algorithms Multiple Choice Questions & Answers (MCQs) focuses on “Library Sort”. 1. Which of the following is a disadvantage of library sort when compared to insertion sort? a) library sort has greater time complexity b) library sort has greater space complexity c) library sort makes more comparisons d) it … Read more
This set of Data Structures & Algorithms Multiple Choice Questions & Answers (MCQs) focuses on “Cycle Sort”. 1. Which of the following is an example of an unstable sorting algorithm? a) cycle sort b) insertion sort c) bubble sort d) merge sort 2. What is the worst case time complexity of cycle sort? a) O(n) … Read more
This set of Data Structures & Algorithms Multiple Choice Questions & Answers (MCQs) focuses on “Binary Tree Sort”. 1. Consider the original array 17 8 12 4 26. How many comparisons are needed to construct the BST on the original array? a) 5 b) 4 c) 7 d) 10 2. In binary tree sort, we … Read more
This set of Data Structures & Algorithms Multiple Choice Questions & Answers (MCQs) focuses on “Cubesort”. 1. Which of the following is an example of parallel sorting technique? a) bogo sort b) sleep sort c) cube sort d) merge sort 2. What is the worst case time complexity of cube sort? a) O(n) b) O(log … Read more
This set of Data Structures & Algorithms Multiple Choice Questions & Answers (MCQs) focuses on “Timsort”. 1. Which of the following is Python’s standard sorting algorithm? a) quick sort b) introsort c) merge sort d) tim sort 2. Which of the following sorting algorithm is a constituent of tim sort? a) selection sort b) quick … Read more
This set of Data Structures & Algorithms Multiple Choice Questions & Answers (MCQs) focuses on “Introsort”. 1. Which of the following sorting algorithm is used by C++ internally? a) quicksort b) introsort c) merge sort d) heap sort 2. Which of the following sorting algorithm is not a constituent of introsort? a) selection sort b) … Read more
This set of Data Structures & Algorithms Multiple Choice Questions & Answers (MCQs) focuses on “Heap Sort – 2”. 1. Heap sort is an implementation of ____________ using a descending priority queue. a) insertion sort b) selection sort c) bubble sort d) merge sort 2. Which one of the following is false? a) Heap sort … Read more
This set of Data Structures & Algorithms Multiple Choice Questions & Answers (MCQs) focuses on “Heap Sort”. 1. On which algorithm is heap sort based on? a) Fibonacci heap b) Binary tree c) Priority queue d) FIFO 2. In what time can a binary heap be built? a) O(N) b) O(N log N) c) O(log … Read more
This set of Data Structures & Algorithms Multiple Choice Questions & Answers (MCQs) focuses on “Shell Sort – 2”. 1. Shell sort is also known as _____________ a) diminishing decrement sort b) diminishing increment sort c) partition exchange sort d) diminishing insertion sort 2. Statement 1: Shell sort is a stable sorting algorithm. Statement 2: … Read more
This set of Data Structures & Algorithms Multiple Choice Questions & Answers (MCQs) focuses on “Shell Sort”. 1. What is the other name for a shell sort algorithm? a) Diminishing increment sort b) Diminishing decrement sort c) Insertion sort d) Selection sort 2. The worst case running time of shell sort, using Shell’s increments is? … Read more
