MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 657 Mcqs, each offering curated multiple-choice questions to sharpen your Testing Subject knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
Vertex coloring and chromatic number are one and the same. |
| A. | True |
| B. | False |
| Answer» C. | |
| 2. |
Minimum number of colors required for proper edge coloring of a graph is called? |
| A. | Chromatic color |
| B. | Chromatic index |
| C. | Edge matching |
| D. | Color number |
| Answer» C. Edge matching | |
| 3. |
How many unique colors will be required for proper vertex coloring of a complete graph having n vertices? |
| A. | 0 |
| B. | 1 |
| C. | n |
| D. | n! |
| Answer» D. n! | |
| 4. |
How many unique colors will be required for proper vertex coloring of a line graph having n vertices? |
| A. | 0 |
| B. | 1 |
| C. | 2 |
| D. | n |
| Answer» E. | |
| 5. |
Which of the following is an NP complete problem? |
| A. | Hamiltonian cycle |
| B. | Travelling salesman problem |
| C. | Calculating chromatic number of graph |
| D. | Finding maximum element in an array |
| Answer» D. Finding maximum element in an array | |
| 6. |
How many unique colors will be required for proper vertex coloring of a bipartite graph having n vertices? |
| A. | 0 |
| B. | 1 |
| C. | 2 |
| D. | n |
| Answer» D. n | |
| 7. |
How many unique colors will be required for proper vertex coloring of an empty graph having n vertices? |
| A. | 0 |
| B. | 1 |
| C. | 2 |
| D. | n |
| Answer» C. 2 | |
| 8. |
Minimum number of unique colors required for vertex coloring of a graph is called? |
| A. | vertex matching |
| B. | chromatic index |
| C. | chromatic number |
| D. | color number |
| Answer» D. color number | |
| 9. |
How many edges will a tree consisting of N nodes have? |
| A. | Log(N) |
| B. | N |
| C. | N 1 |
| D. | N + 1 |
| Answer» D. N + 1 | |
| 10. |
What is vertex coloring of a graph? |
| A. | A condition where any two vertices having a common edge should not have same color |
| B. | A condition where any two vertices having a common edge should always have same color |
| C. | A condition where all vertices should have a different color |
| D. | A condition where all vertices should have same color |
| Answer» B. A condition where any two vertices having a common edge should always have same color | |
| 11. |
Which of the following is not a type of graph in computer science? |
| A. | undirected graph |
| B. | bar graph |
| C. | directed graph |
| D. | weighted graph |
| Answer» C. directed graph | |