Design and Analysis of Algorithms MCQs with answers Page - 3

Here, you will find a collection of MCQ questions on Design and Analysis of Algorithms. Go through these questions to enhance your preparation for upcoming examinations and interviews.

To check the correct answer, simply click the View Answer button provided for each question.

Have your own questions to contribute? Click the button below to share your MCQs with others!

+ Add Question

A

Admin • 802.91K Points
Coach

Q. Is Coppersmith-Winograd algorithm better than Strassen’s algorithm in terms of time complexity?

  • (A) true
  • (B) false
  • (C) ---
  • (D) ---

A

Admin • 802.91K Points
Coach

Q. Which of the following statement is true about stack?

  • (A) pop operation removes the top most element
  • (B) pop operation removes the bottom most element
  • (C) push operation adds new element at the bottom
  • (D) push operation removes the top most element

A

Admin • 802.91K Points
Coach

Q. What is the space complexity of program to reverse stack recursively?

  • (A) o(1)
  • (B) o(log n)
  • (C) o(n)
  • (D) o(n log n)

A

Admin • 802.91K Points
Coach

Q. Stack can be reversed without using extra space by

  • (A) using recursion
  • (B) using linked list to implement stack
  • (C) using an extra stack
  • (D) it is not possible

A

Admin • 802.91K Points
Coach

Q. Which of the following is considered as the top of the stack in the linked list implementation of the stack?

  • (A) last node
  • (B) first node
  • (C) random node
  • (D) middle node

A

Admin • 802.91K Points
Coach

Q. Tower of hanoi problem can be solved iteratively.

  • (A) true
  • (B) false
  • (C) ---
  • (D) ---

A

Admin • 802.91K Points
Coach

Q. Minimum time required to solve tower of hanoi puzzle with 4 disks assuming one move takes 2 seconds, will be

  • (A) 15 seconds
  • (B) 30 seconds
  • (C) 16 seconds
  • (D) 32 seconds

A

Admin • 802.91K Points
Coach

Q. Master’s theorem is used for?

  • (A) solving recurrences
  • (B) solving iterative relations
  • (C) analysing loops
  • (D) calculating the time complexity of any code

A

Admin • 802.91K Points
Coach

Q. How many cases are there under Master’s theorem?

  • (A) 2
  • (B) 3
  • (C) 4
  • (D) 5

A

Admin • 802.91K Points
Coach

Q. What is the result of the recurrences which fall under second case of Master’s theorem (let the recurrence be given by T(n)=aT(n/b)+f(n) and f(n)=nc?

  • (A) none of the below
  • (B) t(n) = o(nc log n)
  • (C) t(n) = o(f(n))
  • (D) t(n) = o(n2)

Add MCQ in this Category

If you want to share an MCQ question in this category, it's a great idea! It will be helpful for many other students using this website.

Share Your MCQ

Browse Categories

Click on category to learn MCQs of that category.