This set of Data Structures & Algorithms Multiple Choice Questions & Answers (MCQs) focuses on “Quicksort using Median of Three Partitioning”. 1. Quick sort uses which of the following algorithm to implement sorting? a) backtracking b) greedy algorithm c) divide and conquer d) dynamic programming 2. What is the median of three techniques in quick … Read more
This set of Data Structures & Algorithms Multiple Choice Questions & Answers (MCQs) focuses on “Quicksort using Random Sampling”. 1. Quick sort uses which of the following algorithm to implement sorting? a) backtracking b) greedy algorithm c) divide and conquer d) dynamic programming 2. What is a randomized quick sort? a) quick sort with random … Read more
This set of Data Structure Multiple Choice Questions & Answers (MCQs) focuses on “Quick Sort – 3”. 1. Quick Sort can be categorized into which of the following? a) Brute Force technique b) Divide and conquer c) Greedy algorithm d) Dynamic programming 2. Select the appropriate recursive call for QuickSort.(arr is the array, low is … Read more
This set of Data Structures & Algorithms Multiple Choice Questions & Answers (MCQs) focuses on “Quick Sort – 2”. 1. Quick Sort is a __________ a) greedy algorithm b) divide and conquer algorithm c) dynamic programming algorithm d) backtracking algorithm 2. What is the worst case time complexity of the Quick sort? a) O(nlogn) b) … Read more
This set of Data Structures & Algorithms Multiple Choice Questions & Answers (MCQs) focuses on “Quick Sort”. 1. Which of the following sorting algorithms is the fastest? a) Merge sort b) Quick sort c) Insertion sort d) Shell sort 2. Quick sort follows Divide-and-Conquer strategy. a) True b) False 3. What is the worst case … Read more
This set of Data Structures & Algorithms Multiple Choice Questions & Answers (MCQs) focuses on “Bottom-Up Mergesort”. 1. Merge sort uses which of the following algorithm to implement sorting? a) backtracking b) greedy algorithm c) divide and conquer d) dynamic programming 2. What is the average case time complexity of standard merge sort? a) O(n … Read more
This set of Data Structures & Algorithms Multiple Choice Questions & Answers (MCQs) focuses on “In-place Merge Sort”. 1. Merge sort uses which of the following algorithm to implement sorting? a) backtracking b) greedy algorithm c) divide and conquer d) dynamic programming 2. What is the average case time complexity of standard merge sort? a) … Read more
This set of Data Structures & Algorithms Multiple Choice Questions & Answers (MCQs) focuses on “Merge Sort”. 1. Merge sort uses which of the following technique to implement sorting? a) backtracking b) greedy algorithm c) divide and conquer d) dynamic programming 2. What is the average case time complexity of merge sort? a) O(n log … Read more
This set of Data Structure Multiple Choice Questions & Answers (MCQs) focuses on “Bubble Sort”. 1. What is an external sorting algorithm? a) Algorithm that uses tape or disk during the sort b) Algorithm that uses main memory during the sort c) Algorithm that involves swapping d) Algorithm that are considered ‘in place’ 2. What … Read more
This set of Data Structure Multiple Choice Questions & Answers (MCQs) focuses on “Selection Sort”. 1. What is an in-place sorting algorithm? a) It needs O(1) or O(logn) memory to create auxiliary locations b) The input is already sorted and in-place c) It requires additional storage d) It requires additional space 2. In the following … Read more
