Q. Which of the following data structures are indexed structures
✅ Correct Answer: (A)
linear arrays
Data Structure and Algorithms (DSA) MCQs | Page - 1
Dear candidates you will find MCQ questions of Data Structure and Algorithms (DSA) here. Learn these questions and prepare yourself for coming examinations and interviews. You can check the right answer of any question by clicking on any option or by clicking view answer button.
Q. Which of the following is not the required condition for binary search algorithm
✅ Correct Answer: (A)
there must be mechanism to delete and/ or insert elements in list
Q. Which of the following is not a limitation of binary search algorithm ?
✅ Correct Answer: (A)
binary search algorithm is not efficient when the data elements are more than 1000.
Q. Two dimensional arrays are also called
✅ Correct Answer: (C)
both of the above
Q. The term “push” and “pop” is related to the
✅ Correct Answer: (C)
stacks
Q. A data structure where elements can be added or removed at either end but not in the middle is referred as
✅ Correct Answer: (D)
Deque
Q. The following sorting algorithm is of divide- and-conquer type
✅ Correct Answer: (C)
Quick sort
Explanation: Quick sort is a divide-and-conquer sorting algorithm that works by partitioning a list of items into two smaller lists and then sorting each of these lists recursively. It is an efficient and widely used algorithm, with an average case time complexity of O(n log n).
Bubble sort and insertion sort are both comparison-based sorting algorithms, but they do not use the divide-and-conquer approach. Bubble sort works by repeatedly swapping adjacent elements that are out of order, while insertion sort works by iteratively inserting each element into its correct position in the sorted list. Both of these algorithms have a time complexity of O(n^2) in the worst case.
Q. An algorithm that calls itself directly or indi- rectly is known as
✅ Correct Answer: (A)
Recursion
Q. The elements of an array are stored suc- cessively in memory cells because
✅ Correct Answer: (A)
by this way computer can keep track only the address of the first element and the addresses of other elements can be calculated
Q. The memory address of the first element of an array is called
✅ Correct Answer: (A)
base address
Jump to