This set of Data Structure Multiple Choice Questions & Answers (MCQs) focuses on “Sorting”. 1. Which of the following sorting algorithms is the fastest for sorting small arrays? a) Quick sort b) Shell sort c) Insertion sort d) Heap sort 2. What is the advantage of selection sort over other sorting techniques? a) It is … Read more
This set of Data Structures & Algorithms Multiple Choice Questions & Answers (MCQs) focuses on “Substring Searching Algorithm”. 1. Which of the following is a sub string of “SANFOUNDRY”? a) SANO b) FOUND c) SAND d) FOND 2. What will be the output of the following code? #include<bits/stdc++.h> using namespace std; void func(char* str2, … Read more
This set of Data Structures & Algorithms Multiple Choice Questions & Answers (MCQs) focuses on “Interpolation Searching Algorithm”. 1. Which of the following is the most desirable condition for interpolation search? a) array should be sorted b) array should not be sorted but the values should be uniformly distributed c) array should have a less … Read more
This set of Data Structures & Algorithms Multiple Choice Questions & Answers (MCQs) focuses on “Exponential Search”. 1. Exponential search algorithm requires which of the following condition to be true? a) array should be sorted b) array should have not be sorted c) array should have a less than 128 elements d) array should be … Read more
This set of Data Structure Multiple Choice Questions & Answers (MCQs) focuses on “Fibonacci Search”. 1. Which algorithmic technique does Fibonacci search use? a) Brute force b) Divide and Conquer c) Greedy Technique d) Backtracking 2. Choose the recursive formula for the Fibonacci series.(n>=1) a) F(n) = F(n+1) + F(n+2) b) F(n) = F(n) + … Read more
This set of Data Structures & Algorithms Multiple Choice Questions & Answers (MCQs) focuses on “Jump Search”. 1. Jump search algorithm requires which of the following condition to be true? a) array should be sorted b) array should have not be sorted c) array should have a less than 64 elements d) array should be … Read more
This set of Data Structure Multiple Choice Questions & Answers (MCQs) focuses on “Uniform Binary Search”. 1. In which of the cases uniform binary search fails compared to binary search? a) A table lookup is generally faster than an addition and a shift b) Many searches will be performed on the same array c) Many … Read more
This set of Data Structure Multiple Choice Questions & Answers (MCQs) focuses on “Binary Search”. 1. What is the advantage of recursive approach than an iterative approach? a) Consumes less memory b) Less code and easy to implement c) Consumes more memory d) More code has to be written 2. Choose the appropriate code that … Read more
This set of Data Structures & Algorithms Multiple Choice Questions & Answers (MCQs) focuses on “Linear Search Recursive”. 1. Is there any difference in the speed of execution between linear serach(recursive) vs linear search(lterative)? a) Both execute at same speed b) Linear search(recursive) is faster c) Linear search(Iterative) is faster d) Cant be said 2. … Read more
This set of Data Structure Multiple Choice Questions & Answers (MCQs) focuses on “Linear Search”. 1. Where is linear searching used? a) When the list has only a few elements b) When performing a single search in an unordered list c) Used all the time d) When the list has only a few elements and … Read more
