Design and Analysis of Algorithms MCQs with answers Page - 9

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

Q. Dijkstra’s Algorithm run on a weighted, directed graph G={V,E} with non-negative weight function w and source s, terminates with d[u]=delta(s,u) for all vertices u in V.

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

A

Admin • 831.35K Points
Coach

Q. Dijkstra’s Algorithm is the prime example for

  • (A) greedy algorithm
  • (B) branch and bound
  • (C) back tracking
  • (D) dynamic programming

A

Admin • 831.35K Points
Coach

Q. Bellmann ford algorithm provides solution for problems.

  • (A) all pair shortest path
  • (B) sorting
  • (C) network flow
  • (D) single source shortest path

A

Admin • 831.35K Points
Coach

Q. Bellmann Ford algorithm is used to indicate whether the graph has negative weight cycles or not.

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

A

Admin • 831.35K Points
Coach

Q. How many solution/solutions are available for a graph having negative weight cycle?

  • (A) one solution
  • (B) two solutions
  • (C) no solution
  • (D) infinite solutions

A

Admin • 831.35K Points
Coach

Q. What is the running time of Bellmann Ford Algorithm?

  • (A) o(v)
  • (B) o(v2)
  • (C) o(elogv)
  • (D) o(ve)

A

Admin • 831.35K Points
Coach

Q. How many times the for loop in the Bellmann Ford Algorithm gets executed?

  • (A) v times
  • (B) v-1
  • (C) e
  • (D) e-1

A

Admin • 831.35K Points
Coach

Q. Dijikstra’s Algorithm is more efficient than Bellmann Ford Algorithm.

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

A

Admin • 831.35K Points
Coach

Q. What is the basic principle behind Bellmann Ford Algorithm?

  • (A) interpolation
  • (B) extrapolation
  • (C) regression
  • (D) relaxation

A

Admin • 831.35K Points
Coach

Q. Bellmann Ford Algorithm can be applied for

  • (A) undirected and weighted graphs
  • (B) undirected and unweighted graphs
  • (C) directed and weighted graphs
  • (D) all directed graphs

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.