Design and Analysis of Algorithms MCQs | Page - 42

Dear candidates you will find MCQ questions of Design and Analysis of Algorithms here. Learn these questions and prepare yourself for coming examinations and interviews. You can check the right answer of any question by clicking on any option or by clicking view answer button.

M

Mr. Dubey • 52.61K Points
Coach 

Q. What is the chromatic number of compliment of line graph of bipartite graph?

(A) 0
(B) 1
(C) 2
(D) 3
View Answer Discuss Share

M

Mr. Dubey • 52.61K Points
Coach 

Q. What is the clique size of the line graph of bipartite graph?

(A) 0
(B) 1
(C) 2
(D) 3
View Answer Discuss Share

M

Mr. Dubey • 52.61K Points
Coach 

Q. It is possible to have a negative chromatic number of bipartite graph.

(A) true
(B) false
(C) ---
(D) ---
View Answer Discuss Share

M

Mr. Dubey • 52.61K Points
Coach 

Q. Every Perfect graph has forbidden graph characterization.

(A) true
(B) false
(C) ---
(D) ---
View Answer Discuss Share

M

Mr. Dubey • 52.61K Points
Coach 

Q. Which structure can be modelled by using Bipartite graph?

(A) hypergraph
(B) perfect graph
(C) hetero graph
(D) directed graph
View Answer Discuss Share

M

Mr. Dubey • 52.61K Points
Coach 

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
View Answer Discuss Share

M

Mr. Dubey • 52.61K Points
Coach 

Q. Which graph is also known as biclique?

(A) histogram
(B) complete bipartite
(C) cartesian
(D) tree
View Answer Discuss Share

G

Gopal Sharma • 38.32K Points
Coach 

Q. Which of the following problems is equivalent to the 0-1 Knapsack problem?

(A) you are given a bag that can carry a maximum weight of w. you are given n items which have a weight of {w1, w2, w3,…., wn} and a value of {v1, v2, v3,…., vn}. you can break the items into smaller pieces. choose the items in such a way that y
(B) you are studying for an exam and you have to study n questions. the questions take {t1, t2, t3,…., tn} time(in hours) and carry {m1, m2, m3,…., mn} marks. you can study for a maximum of t hours. you can either study a question or leave it. c
(C) you are given infinite coins of denominations {v1, v2, v3,….., vn} and a sum s. you have to find the minimum number of coins required to get the sum s
(D) you are given a suitcase that can carry a maximum weight of 15kg. you are given 4 items which have a weight of {10, 20, 15,40} and a value of {1, 2, 3,4}. you can break the items into smaller pieces. choose the items in such a way that you get the maximum
View Answer Discuss Share

Jump to

Download our easy to use, user friendly Android App from Play Store. And learn MCQs with one click.

Image