This set of Data Structures & Algorithms Multiple Choice Questions & Answers (MCQs) focuses on “Counting Sort”. 1. How many comparisons will be made to sort the array arr={1,5,3,8,2} using counting sort? a) 5 b) 7 c) 9 d) 0 2. Which of the following is not an example of non comparison sort? a) bubble … Read more
This set of Data Structures & Algorithms Multiple Choice Questions & Answers (MCQs) focuses on “MSD Radix Sort”. 1. How many comparisons will be made to sort the array arr = {1, 5, 3, 8, 2} using MSD radix sort? a) 5 b) 7 c) 9 d) 0 2. What is the full form of … Read more
This set of Data Structures & Algorithms Multiple Choice Questions & Answers (MCQs) focuses on “LSD Radix Sort”. 1. Which of the following is the distribution sort? a) Heap sort b) Smooth sort c) Quick sort d) LSD radix sort 2. What is the worst case time complexity of LSD radix sort? a) O(nlogn) b) … Read more
This set of Data Structures & Algorithms Multiple Choice Questions & Answers (MCQs) focuses on “Pigeonhole Sort”. 1. How many comparisons will be made to sort the array arr={1,5,3,8,2} using pigeonhole sort? a) 5 b) 7 c) 9 d) 0 2. Which of the following is a non-comparison sort? a) heap sort b) quick sort … Read more
This set of Data Structures & Algorithms Multiple Choice Questions & Answers (MCQs) focuses on “Sleep Sort”. 1. Which of the following header file is a must to implement sleep sort algorithm? a) string.h b) math.hw c) bios.h d) windows.h 2. Sleep sort does not work for ___________ a) negative numbers b) large numbers c) … Read more
This set of Data Structures & Algorithms Multiple Choice Questions & Answers (MCQs) focuses on “Bogosort”. 1. Which of the following is not an alternative name of bogosort? a) stupid sort b) permutation sort c) donkey sort d) monkey sort 2. Bogosort works by __________ a) generating random permutations of its input b) partitioning the … Read more
This set of Data Structures & Algorithms Multiple Choice Questions & Answers (MCQs) focuses on “Gnome Sort”. 1. Gnome sort is also called __________ a) Smart sort b) Stupid sort c) Bogo sort d) Special sort 2. How many loops are required to implement gnome sorting algorithm? a) Single loop b) 2 nested loops c) … Read more
This set of Data Structures & Algorithms Multiple Choice Questions & Answers (MCQs) focuses on “Comb Sort”. 1. Comb sort is an improved version of _______ a) Selection sort b) Bubble sort c) Insertion sort d) Merge sort 2. The gap between two elements being compared shrinks by a factor of _______ after every iteration. … Read more
This set of Data Structures & Algorithms Multiple Choice Questions & Answers (MCQs) focuses on “Cocktail Sort”. 1. Cocktail sort is also known as ________________ a) bidirectional sort b) bubble sort c) brick sort d) ripple sort 2. Cocktail sort is a variation of _____________ a) Bubble sort b) Selection sort c) Insertion sort d) … Read more
This set of Data Structures & Algorithms Multiple Choice Questions & Answers (MCQs) focuses on “Strand Sort”. 1. Which one of the following sorting algorithm requires recursion? a) pigeonhole sort b) strand sort c) insertion sort d) counting sort 2. Strand sort is most efficient for data stored in? a) linked list b) arrays c) … Read more
