Design and Analysis of Algorithms MCQs with answers Page - 8

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. Which of the following algorithms is the simplest?

  • (A) chan’s algorithm
  • (B) kirkpatrick-seidel algorithm
  • (C) gift wrapping algorithm
  • (D) jarvis algorithm

A

Admin • 831.35K Points
Coach

Q. What is the running time of Hershberger algorithm?

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

A

Admin • 831.35K Points
Coach

Q. Which of the following statements is not a part of Chan’s algorithm?

  • (A) eliminate points not in the hull
  • (B) recompute convex hull from scratch
  • (C) merge previously calculated convex hull
  • (D) reuse convex hull from the previous iteration

A

Admin • 831.35K Points
Coach

Q. Which of the following factors account more to the cost of Chan’s algorithm?

  • (A) computing a single convex hull
  • (B) locating points that constitute a hull
  • (C) computing convex hull in groups
  • (D) merging convex hulls

A

Admin • 831.35K Points
Coach

Q. Chan’s algorithm can be used to compute the lower envelope of a trapezoid.

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

A

Admin • 831.35K Points
Coach

Q. How many priority queue operations are involved in Dijkstra’s Algorithm?

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

A

Admin • 831.35K Points
Coach

Q. How many times the insert and extract min operations are invoked per vertex?

  • (A) 1
  • (B) 2
  • (C) 3
  • (D) 0

A

Admin • 831.35K Points
Coach

Q. The maximum number of times the decrease key operation performed in Dijkstra’s algorithm will be equal to

  • (A) total number of vertices
  • (B) total number of edges
  • (C) number of vertices – 1
  • (D) number of edges – 1

A

Admin • 831.35K Points
Coach

Q. What is running time of Dijkstra’s algorithm using Binary min- heap method?

  • (A) o(v)
  • (B) o(vlogv)
  • (C) o(e)
  • (D) o(elogv)

A

Admin • 831.35K Points
Coach

Q. The running time of Bellmann Ford algorithm is lower than that of Dijkstra’s Algorithm.

  • (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.