Design and Analysis of Algorithms MCQs with answers Page - 35

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 • 833K Points
Coach

Q. Which of the following problems is not NP complete?

  • (A) hamiltonian circuit
  • (B) bin packing
  • (C) partition problem
  • (D) halting problem

A

Admin • 833K Points
Coach

Q. The choice of polynomial class has led to the development of an extensive theory called

  • (A) computational complexity
  • (B) time complexity
  • (C) problem complexity
  • (D) decision complexity

A

Admin • 833K Points
Coach

Q. Which of the following algorithm can be used to solve the Hamiltonian path problem efficiently?

  • (A) branch and bound
  • (B) iterative improvement
  • (C) divide and conquer
  • (D) greedy algorithm

A

Admin • 833K Points
Coach

Q. The problem of finding a path in a graph that visits every vertex exactly once is called?

  • (A) hamiltonian path problem
  • (B) hamiltonian cycle problem
  • (C) subset sum problem
  • (D) turnpike reconstruction problem

A

Admin • 833K Points
Coach

Q. Hamiltonian path problem is

  • (A) np problem
  • (B) n class problem
  • (C) p class problem
  • (D) np complete problem

A

Admin • 833K Points
Coach

Q. There is no existing relationship between a Hamiltonian path problem and Hamiltonian circuit problem.

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

A

Admin • 833K Points
Coach

Q. Which of the following problems is similar to that of a Hamiltonian path problem?

  • (A) knapsack problem
  • (B) closest pair problem
  • (C) travelling salesman problem
  • (D) assignment problem

A

Admin • 833K Points
Coach

Q. Who formulated the first ever algorithm for solving the Hamiltonian path problem?

  • (A) martello
  • (B) monte carlo
  • (C) leonard
  • (D) bellman

A

Admin • 833K Points
Coach

Q. In what time can the Hamiltonian path problem can be solved using dynamic programming?

  • (A) o(n)
  • (B) o(n log n)
  • (C) o(n2)
  • (D) o(n2 2n)

A

Admin • 833K Points
Coach

Q. In graphs, in which all vertices have an odd degree, the number of Hamiltonian cycles through any fixed edge is always even.

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

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.