MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 117 Mcqs, each offering curated multiple-choice questions to sharpen your Data Structures and Algorithms knowledge and support exam preparation. Choose a topic below to get started.
| 101. |
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 |
| Answer» C. Cartesian | |
| 102. |
Which term defines all the complete bipartite graph that are trees? |
| A. | Symmetric |
| B. | Anti – Symmetric |
| C. | Circular |
| D. | Stars |
| Answer» E. | |
| 103. |
What is the clique size of the line graph of bipartite graph? |
| A. | 0 |
| B. | 1 |
| C. | 2 |
| D. | 3 |
| Answer» D. 3 | |
| 104. |
Which graph is also known as biclique? |
| A. | Histogram |
| B. | Complete Bipartite |
| C. | Cartesian |
| D. | Tree |
| Answer» C. Cartesian | |
| 105. |
What is the chromatic number of compliment of line graph of bipartite graph? |
| A. | 0 |
| B. | 1 |
| C. | 2 |
| D. | 3 |
| Answer» D. 3 | |
| 106. |
Which graph is used to define the claw free graph? |
| A. | Bipartite Graph |
| B. | Claw Graph |
| C. | Star Graph |
| D. | Cartesian Graph |
| Answer» C. Star Graph | |
| 107. |
Which structure can be modelled by using Bipartite graph? |
| A. | Hypergraph |
| B. | Perfect Graph |
| C. | Hetero Graph |
| D. | Directed Graph |
| Answer» B. Perfect Graph | |
| 108. |
Which graph cannot contain K3, 3 as a minor of graph? |
| A. | Planar Graph |
| B. | Outer Planar Graph |
| C. | Non Planar Graph |
| D. | Inner Planar Graph |
| Answer» B. Outer Planar Graph | |
| 109. |
What is the multiplicity for the adjacency matrix of complete bipartite graph for 0 Eigen value? |
| A. | 1 |
| B. | n + m – 2 |
| C. | 0 |
| D. | 2 |
| Answer» C. 0 | |
| 110. |
What are the Eigen values for the Laplacian matrix of the complete bipartite graph? |
| A. | n + m |
| B. | n |
| C. | 0 |
| D. | All of the mentioned |
| Answer» E. | |
| 111. |
What is the multiplicity for the laplacian matrix of the complete bipartite graph for n Eigen value? |
| A. | 1 |
| B. | m-1 |
| C. | n-1 |
| D. | 0 |
| Answer» C. n-1 | |
| 112. |
How many spanning trees does a complete bipartite graph contain? |
| A. | nm |
| B. | mn-1 * nn-1 |
| C. | 1 |
| D. | 0 |
| Answer» C. 1 | |
| 113. |
What are the Eigen values for the adjacency matrix of the complete bipartite graph? |
| A. | (nm)1/2 |
| B. | (-nm)1/2 |
| C. | 0 |
| D. | All of the mentioned |
| Answer» E. | |
| 114. |
Is every complete bipartite graph a Moore Graph. |
| A. | True |
| B. | False |
| Answer» B. False | |
| 115. |
What is testing of a complete bipartite subgraph in a bipartite graph problem called? |
| A. | P Problem |
| B. | P-Complete Problem |
| C. | NP Problem |
| D. | NP-Complete Problem |
| Answer» E. | |
| 116. |
Which complete graph is not present in minor of Outer Planar Graph? |
| A. | K3, 3 |
| B. | K3, 1 |
| C. | K3, 2 |
| D. | K1, 1 |
| Answer» D. K1, 1 | |
| 117. |
Is it true that every complete bipartite graph is a modular graph. |
| A. | True |
| B. | False |
| Answer» B. False | |