Top 150+ Solved Design and Analysis of Algorithms MCQ Questions Answer
Q. What type of graph has chromatic number less than or equal to 2?
a. histogram
b. bipartite
c. cartesian
d. tree
Q. Which of the following is the correct type of spectrum of the bipartite graph?
a. symmetric
b. anti – symmetric
c. circular
d. exponential
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
Q. Which graph has a size of minimum vertex cover equal to maximum matching?
a. cartesian
b. tree
c. heap
d. bipartite
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
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
Q. Which of the following has maximum clique size 2?
a. perfect graph
b. tree
c. histogram
d. cartesian
Q. Which structure can be modelled by using Bipartite graph?
a. hypergraph
b. perfect graph
c. hetero graph
d. directed graph
Q. Which type of graph has all the vertex of the first set connected to all the vertex of the second set?
a. bipartite
b. complete bipartite
c. cartesian
d. pie