Design and Analysis of Algorithms MCQs with answers Page - 10

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. Bellmann Ford algorithm was first proposed by

  • (A) richard bellmann
  • (B) alfonso shimbe
  • (C) lester ford jr
  • (D) edward f. moore

A

Admin • 831.35K Points
Coach

Q. Bellmann Ford Algorithm is an example for

  • (A) dynamic programming
  • (B) greedy algorithms
  • (C) linear programming
  • (D) branch and bound

A

Admin • 831.35K Points
Coach

Q. A graph is said to have a negative weight cycle when?

  • (A) the graph has 1 negative weighted edge
  • (B) the graph has a cycle
  • (C) the total weight of the graph is negative
  • (D) the graph has 1 or more negative weighted edges

A

Admin • 831.35K Points
Coach

Q. Floyd Warshall’s Algorithm is used for solving

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

A

Admin • 831.35K Points
Coach

Q. Floyd Warshall’s Algorithm can be applied on

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

A

Admin • 831.35K Points
Coach

Q. What is the running time of the Floyd Warshall Algorithm?

  • (A) big-oh(v)
  • (B) theta(v2)
  • (C) big-oh(ve)
  • (D) theta(v3)

A

Admin • 831.35K Points
Coach

Q. What approach is being followed in Floyd Warshall Algorithm?

  • (A) greedy technique
  • (B) dynamic programming
  • (C) linear programming
  • (D) backtracking

A

Admin • 831.35K Points
Coach

Q. Floyd Warshall Algorithm can be used for finding

  • (A) single source shortest path
  • (B) topological sort
  • (C) minimum spanning tree
  • (D) transitive closure

A

Admin • 831.35K Points
Coach

Q. What procedure is being followed in Floyd Warshall Algorithm?

  • (A) top down
  • (B) bottom up
  • (C) big bang
  • (D) sandwich

A

Admin • 831.35K Points
Coach

Q. Floyd- Warshall algorithm was proposed by

  • (A) robert floyd and stephen warshall
  • (B) stephen floyd and robert warshall
  • (C) bernad floyd and robert warshall
  • (D) robert floyd and bernad warshall

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.