Design and Analysis of Algorithms MCQs with answers Page - 41

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. A graph is found to be 2 colorable. What can be said about that graph?

  • (A) the given graph is eulerian
  • (B) the given graph is bipartite
  • (C) the given graph is hamiltonian
  • (D) the given graph is planar

A

Admin • 833K Points
Coach

Q. Which type of graph has no odd cycle in it?

  • (A) bipartite
  • (B) histogram
  • (C) cartesian
  • (D) pie

A

Admin • 833K Points
Coach

Q. What type of graph has chromatic number less than or equal to 2?

  • (A) histogram
  • (B) bipartite
  • (C) cartesian
  • (D) tree

A

Admin • 833K Points
Coach

Q. Which of the following is the correct type of spectrum of the bipartite graph?

  • (A) symmetric
  • (B) anti – symmetric
  • (C) circular
  • (D) exponential

A

Admin • 833K Points
Coach

Q. Which of the following is not a property of the bipartite graph?

  • (A) no odd cycle
  • (B) symmetric spectrum
  • (C) chromatic number is less than or equal to 2
  • (D) asymmetric spectrum

A

Admin • 833K Points
Coach

Q. Which one of the following is the chromatic number of bipartite graph?

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

A

Admin • 833K Points
Coach

Q. Which graph has a size of minimum vertex cover equal to maximum matching?

  • (A) cartesian
  • (B) tree
  • (C) heap
  • (D) bipartite

A

Admin • 833K Points
Coach

Q. Which theorem gives the relation between the minimum vertex cover and maximum matching?

  • (A) konig’s theorem
  • (B) kirchhoff’s theorem
  • (C) kuratowski’s theorem
  • (D) kelmans theorem

A

Admin • 833K Points
Coach

Q. Which of the following is not a property of perfect graph?

  • (A) compliment of line graph of bipartite graph
  • (B) compliment of bipartite graph
  • (C) line graph of bipartite graph
  • (D) line graph

A

Admin • 833K Points
Coach

Q. Which of the following has maximum clique size 2?

  • (A) perfect graph
  • (B) tree
  • (C) histogram
  • (D) cartesian

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