Data Structures MCQs with Answers
Practice important Data Structures MCQs with answers and explanations.
Multiple Choice Questions
Q691: What is the key concept behind divide and conquer algorithms?
- A: Sorting elements in place
- B: Partitioning the problem into subproblems
- C: Iterating over all elements
- D: None of the above
View Answer
B
Q692: What happens when you reach a single element in a divide and conquer algorithm?
- A: The algorithm continues dividing
- B: The algorithm merges the elements immediately
- C: The algorithm sorts the element and stops
- D: The algorithm performs a linear search
View Answer
C
Q693: How is the merge step performed in merge sort?
- A: Using a recursive call
- B: By iterating through the arrays and comparing elements
- C: By swapping adjacent elements
- D: Using a binary search algorithm
View Answer
B
Q694: In the merge sort algorithm, what does the temporary array `tmpArrayPtr` store?
- A: The original array
- B: The merged array
- C: Intermediate sorted results
- D: The unsorted array
View Answer
C
Q695: What is the main advantage of using merge sort over insertion sort?
- A: Merge sort is in-place
- B: Merge sort has better average time complexity
- C: Merge sort uses less memory
- D: Merge sort is simpler to implement
View Answer
B
Q696: What is the role of the pivot in the quicksort algorithm?
- A: To merge sorted halves
- B: To partition the array into two sub-arrays
- C: To find the median of the array
- D: To sort the array in place
View Answer
B
Q697: What happens when quicksort partitions the array around the pivot?
- A: The array is sorted
- B: The array is divided into smaller sub-arrays
- C: The pivot is removed from the array
- D: The array is merged with another array
View Answer
B
Q698: Which of the following sorting algorithms is not a divide and conquer algorithm?
- A: Mergesort
- B: Quicksort
- C: Heap sort
- D: Insertion sort
View Answer
D
Q699: What is the purpose of the `mergeArrays` function in merge sort?
- A: To divide the array into halves
- B: To merge two sorted arrays into a single sorted array
- C: To sort the array in place
- D: To find the median of the array
View Answer
B
Q700: What is the space complexity of merge sort?
- A: O(1)
- B: O(n)
- C: O(n log n)
- D: O(n^2)
View Answer
B