MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 14 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.
| 1. |
What would the time complexity to check if an undirected graph with V vertices and E edges is Bipartite or not given its adjacency matrix? |
| A. | O(E*E) |
| B. | O(V*V) |
| C. | O(E) |
| D. | O(V) |
| Answer» C. O(E) | |
| 2. |
In the given graph which edge should be removed to make it a Bipartite Graph? |
| A. | A-C |
| B. | B-E |
| C. | C-D |
| D. | D-E |
| Answer» B. B-E | |
| 3. |
Which of the following graphs are isomorphic to each other? |
| A. | fig 1 and fig 2 |
| B. | fig 2 and fig 3 |
| C. | fig 1 and fig 3 |
| D. | fig 1, fig 2 and fig 3 |
| Answer» E. | |
| 4. |
How many of the following statements are correct?i) All cyclic graphs are complete graphs.ii) All complete graphs are cyclic graphs.iii) All paths are bipartite.iv) All cyclic graphs are bipartite.v) There are cyclic graphs which are complete. |
| A. | 1 |
| B. | 2 |
| C. | 3 |
| D. | 4 |
| Answer» C. 3 | |
| 5. |
Number of vertices with odd degrees in a graph having a eulerian walk is ________ |
| A. | 0 |
| B. | Can’t be predicted |
| C. | 2 |
| D. | either 0 or 2 |
| Answer» E. | |
| 6. |
The number of possible undirected graphs which may have self loops but no multiple edges and have n vertices is ________ |
| A. | 2((n*(n-1))/2) |
| B. | 2((n*(n+1))/2) |
| C. | 2((n-1)*(n-1))/2) |
| D. | 2((n*n)/2) |
| Answer» E. | |
| 7. |
What_would_the_time_complexity_to_check_if_an_undirected_graph_with_V_vertices_and_E_edges_is_Bipartite_or_not_given_its_adjacency_matrix?$ |
| A. | O(E*E) |
| B. | O(V*V) |
| C. | O(E) |
| D. | O(V) |
| Answer» C. O(E) | |
| 8. |
All trees with n vertices consists of n-1 edges. |
| A. | True |
| B. | False |
| Answer» B. False | |
| 9. |
What is the number of vertices of degree 2 in a path graph having n vertices,here n>2. |
| A. | n-2 |
| B. | n |
| C. | 2 |
| D. | 0 |
| Answer» B. n | |
| 10. |
All paths and cyclic graphs are bipartite graphs. |
| A. | True |
| B. | False |
| Answer» C. | |
| 11. |
How many of the following statements are correct? |
| A. | All cyclic graphs are complete graphs. |
| B. | All complete graphs are cyclic graphs. |
| C. | All paths are bipartite. |
| D. | All cyclic graphs are bipartite. |
| Answer» C. All paths are bipartite. | |
| 12. |
Number of vertices with odd degrees in a graph having a eulerian walk is ________ |
| A. | 0 |
| B. | Can’t be predicted |
| C. | 2 |
| D. | either 0 or 2 |
| Answer» E. | |
| 13. |
Given a plane graph, G having 2 connected component, having 6 vertices, 7 edges and 4 regions. What will be the number of connected components? |
| A. | 1 |
| B. | 2 |
| C. | 3 |
| D. | 4 |
| Answer» C. 3 | |
| 14. |
The number of possible undirected graphs which may have self loops but no multiple edges and have n vertices is ________ |
| A. | 2<sup>((n*(n-1))/2)</sup> |
| B. | 2<sup>((n*(n+1))/2)</sup> |
| C. | 2<sup>((n-1)*(n-1))/2)</sup> |
| D. | 2<sup>((n*n)/2)</sup> |
| Answer» E. | |