Explore topic-wise MCQs in Discrete Mathematics.

This section includes 8 Mcqs, each offering curated multiple-choice questions to sharpen your Discrete Mathematics knowledge and support exam preparation. Choose a topic below to get started.

1.

THE_WORST_CASE_OCCUR_IN_QUICK_SORT_WHEN?$

A. Pivot is the median of the array
B. Pivot is the smallest element
C. Pivot is the middle element
D. None of the mentioned
Answer» C. Pivot is the middle element
Discussion
2.

The_worst_case_complexity_of_quick_sort_is$

A. O(n)
B. O(log n)
C. O(n<sup>2</sup>)
D. O(n log n)
Answer» D. O(n log n)
Discussion
3.

The complexity of Fibonacci series i?

A. O(2<sup>n</sup>)
B. O(log n)
C. O(n<sup>2</sup>)
D. O(n log n)
Answer» B. O(log n)
Discussion
4.

The worst case complexity for insertion sort is

A. O(n)
B. O(log n)
C. O(n<sup>2</sup>)
D. O(n log n)
Answer» D. O(n log n)
Discussion
5.

The Worst case occur in linear search algorithm when
A. Item is somewhere in the middle of the array
B. Item is not in the array at all
C. Item is the last element in the array
D. Item is the last element in the array or is not there at all
Answer» E.
Discussion
6.

The complexity of merge sort algorithm is

A. O(n)
B. O(log n)
C. O(n<sup>2</sup>)
D. O(n log n)
Answer» E.
Discussion
7.

The complexity of linear search algorithm is
A. O(n)
B. O(log n)
C. O(n<sup>2</sup>)
D. O(n log n)
Answer» B. O(log n)
Discussion
8.

Which of the following case does not exist in complexity theory?

A. Best case
B. Worst case
C. Average case
D. Null case
Answer» E.
Discussion