DAA_C_MCQ - 1

What will be the output of the following program?

• 4

• 6

• -1

• 8

What is the number of swaps needed to sort the numbers 8, 22, 7, 9, 31, 5, 13 in ascending order using bubble sort?

• 11

• 12

• 13

• 10

What will be the output for the following recursive code?

• 12

• 24

• 26

• 28

What will be the output for the following recursive code?

• 10

• 51

• 55

• 30

What is the minimum number of moves required to solve the Towers of Hanoi problem with 3 disks?

• 4

• 5

• 6

• 7

Which statement accurately describes a non-recursive algorithm?

• A non-recursive algorithm always calls itself for sorting.

• A non-recursive algorithm sorts elements without using any loops.

• A non-recursive algorithm sorts all elements at once without calling itself.

• A non-recursive algorithm is less efficient than recursive ones.

What does the Big-O Asymptotic Notation provide?

• Lower Bound Idea

• Exact Count of Operations

• Upper Bound Idea

• Average Case Analysis

Which sorting algorithm is the most efficient for sorting small arrays or lists?

• Quick Sort

• Merge Sort

• Insertion Sort

• Selection Sort

A function is said to be strictly decreasing if:

• m < n implies f(m) < f(n)

• m <= n implies f(m) <= f(n)

• m <= n implies f(m) => f(n)

• m < n implies f(m) > f(n)

What does O(1) represent in big-O notation?

• Constant-time complexity

• Linear-time complexity

• Quadratic-time complexity

• Exponential-time complexity