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. |
Which is the correct technique for finding a maximum matching in a graph? |
| A. | dfs traversal |
| B. | bfs traversal |
| C. | shortest path traversal |
| D. | heap order traversal |
| Answer» C. shortest path traversal | |
| 2. |
Which one of the following is an application for matching? |
| A. | proposal of marriage |
| B. | pairing boys and girls for a dance |
| C. | arranging elements in a set |
| D. | finding the shortest traversal path |
| Answer» C. arranging elements in a set | |
| 3. |
A matching M is maximal if and only if there exists no augmenting path with respect to M. |
| A. | true |
| B. | false |
| Answer» B. false | |
| 4. |
In a bipartite graph G=(V,U,E), the matching of a free vertex in V to a free vertex in U is called? |
| A. | bipartite matching |
| B. | cardinality matching |
| C. | augmenting |
| D. | weight matching |
| Answer» D. weight matching | |
| 5. |
What is the length of an augmenting path? |
| A. | even |
| B. | odd |
| C. | depends on graph |
| D. | 1 |
| Answer» C. depends on graph | |
| 6. |
A matching that matches all the vertices of a graph is called? |
| A. | perfect matching |
| B. | cardinality matching |
| C. | good matching |
| D. | simplex matching |
| Answer» B. cardinality matching | |
| 7. |
What is the simplest method to prove that a graph is bipartite? |
| A. | it has a cycle of an odd length |
| B. | it does not have cycles |
| C. | it does not have a cycle of an odd length |
| D. | both odd and even cycles are formed |
| Answer» D. both odd and even cycles are formed | |
| 8. |
How many colours are used in a bipartite graph? |
| A. | 1 |
| B. | 2 |
| C. | 3 |
| D. | 4 |
| Answer» C. 3 | |
| 9. |
Maximum matching is also called as maximum cardinality matching. |
| A. | true |
| B. | false |
| Answer» B. false | |
| 10. |
                           is a matching with the largest number of edges. |
| A. | maximum bipartite matching |
| B. | non-bipartite matching |
| C. | stable marriage |
| D. | simplex |
| Answer» B. non-bipartite matching | |
| 11. |
What is the efficiency of Gale-Shapley algorithm used in stable marriage problem? |
| A. | o(n) |
| B. | o(n log n) |
| C. | o(n2) |
| D. | o(log n) |
| Answer» D. o(log n) | |
| 12. |
Which of the following problems is related to stable marriage problem? |
| A. | choice of school by students |
| B. | n-queen problem |
| C. | arranging data in a database |
| D. | knapsack problem |
| Answer» B. n-queen problem | |
| 13. |
What is the prime task of the stable marriage problem? |
| A. | to provide man optimal solution |
| B. | to provide woman optimal solution |
| C. | to determine stability of marriage |
| D. | to use backtracking approach |
| Answer» D. to use backtracking approach | |
| 14. |
Can stable marriage cannot be solved using branch and bound algorithm. |
| A. | true |
| B. | false |
| Answer» C. | |
| 15. |
Who formulated a straight forward backtracking scheme for stable marriage problem? |
| A. | mcvitie and wilson |
| B. | gale |
| C. | ford and fulkerson |
| D. | dinitz |
| Answer» B. gale | |
| 16. |
Which of the following happens? |
| A. | w2 replaces m1 with m2 |
| B. | w2 rejects m2 |
| C. | w2 accepts both m1 and m2 |
| D. | w2 rejects both m1 and m2 |
| Answer» B. w2 rejects m2 | |
| 17. |
In case of stability, how many symmetric possibilities of trouble can occur? |
| A. | 1 |
| B. | 2 |
| C. | 4 |
| D. | 3 |
| Answer» C. 4 | |
| 18. |
When a free man proposes to an available woman, which of the following happens? |
| A. | she will think and decide |
| B. | she will reject |
| C. | she will replace her current mate |
| D. | she will accept |
| Answer» E. | |
| 19. |
How many 2*2 matrices are used in this problem? |
| A. | 1 |
| B. | 2 |
| C. | 3 |
| D. | 4 |
| Answer» C. 3 | |
| 20. |
If there are n couples who would prefer each other to their actual marriage partners, then the assignment is said to be unstable. |
| A. | true |
| B. | false |
| Answer» B. false | |
| 21. |
An optimal solution satisfying men’s preferences is said to be? |
| A. | man optimal |
| B. | woman optimal |
| C. | pair optimal |
| D. | best optimal |
| Answer» B. woman optimal | |
| 22. |
What happens when a free man approaches a married woman? |
| A. | she simply rejects him |
| B. | she simply replaces her mate with him |
| C. | she goes through her preference list and accordingly, she replaces her current mate with him |
| D. | she accepts his proposal |
| Answer» D. she accepts his proposal | |
| 23. |
Which of the following algorithms does Stable marriage problem uses? |
| A. | gale-shapley algorithm |
| B. | dijkstra’s algorithm |
| C. | ford-fulkerson algorithm |
| D. | prim’s algorithm |
| Answer» B. dijkstra’s algorithm | |
| 24. |
Stable marriage problem is an example of? |
| A. | branch and bound algorithm |
| B. | backtracking algorithm |
| C. | greedy algorithm |
| D. | divide and conquer algorithm |
| Answer» C. greedy algorithm | |
| 25. |
How many constraints does flow have? |
| A. | one |
| B. | three |
| C. | two |
| D. | four |
| Answer» D. four | |
| 26. |
Dinic’s algorithm runs faster than the Ford-Fulkerson algorithm. |
| A. | true |
| B. | false |
| Answer» B. false | |
| 27. |
Who is the formulator of Maximum flow problem? |
| A. | lester r. ford and delbert r. fulkerson |
| B. | t.e. harris and f.s. ross |
| C. | y.a. dinitz |
| D. | kruskal |
| Answer» C. y.a. dinitz | |
| 28. |
A simple acyclic path between source and sink which pass through only positive weighted edges is called? |
| A. | augmenting path |
| B. | critical path |
| C. | residual path |
| D. | maximum path |
| Answer» B. critical path | |
| 29. |
Find the maximum flow from the following graph. |
| A. | 22 |
| B. | 17 |
| C. | 15 |
| D. | 20 |
| Answer» D. 20 | |
| 30. |
Under what condition can a vertex combine and distribute flow in any manner? |
| A. | it may violate edge capacities |
| B. | it should maintain flow conservation |
| C. | the vertex should be a source vertex |
| D. | the vertex should be a sink vertex |
| Answer» C. the vertex should be a source vertex | |
| 31. |
Does Ford- Fulkerson algorithm use the idea of? |
| A. | naïve greedy algorithm approach |
| B. | residual graphs |
| C. | minimum cut |
| D. | minimum spanning tree |
| Answer» C. minimum cut | |
| 32. |
The first step in the naïve greedy algorithm is? |
| A. | analysing the zero flow |
| B. | calculating the maximum flow using trial and error |
| C. | adding flows with higher values |
| D. | reversing flow if required |
| Answer» B. calculating the maximum flow using trial and error | |
| 33. |
Which algorithm is used to solve a maximum flow problem? |
| A. | prim’s algorithm |
| B. | kruskal’s algorithm |
| C. | dijkstra’s algorithm |
| D. | ford-fulkerson algorithm |
| Answer» E. | |
| 34. |
What is the source? |
| A. | vertex with no incoming edges |
| B. | vertex with no leaving edges |
| C. | centre vertex |
| D. | vertex with the least weight |
| Answer» B. vertex with no leaving edges | |
| 35. |
A network can have only one source and one sink. |
| A. | false |
| B. | true |
| Answer» C. | |
| 36. |
How many spanning trees does a complete bipartite graph contain? |
| A. | nm |
| B. | mn-1 * nn-1 |
| C. | 1 |
| Answer» C. 1 | |
| 37. |
What does Maximum flow problem involve? |
| A. | finding a flow between source and sink that is maximum |
| B. | finding a flow between source and sink that is minimum |
| C. | finding the shortest path between source and sink |
| D. | computing a minimum spanning tree |
| Answer» B. finding a flow between source and sink that is minimum | |
| 38. |
Is it true that every complete bipartite graph is a modular graph. |
| A. | true |
| B. | false |
| Answer» B. false | |
| 39. |
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 |
| Answer» C. n-1 | |
| 40. |
What is the multiplicity for the adjacency matrix of complete bipartite graph for 0 Eigen value? |
| A. | 1 |
| B. | n + m – 2 |
| C. | 2 |
| Answer» C. 2 | |
| 41. |
Is every complete bipartite graph a Moore Graph. |
| A. | true |
| B. | false |
| Answer» B. false | |
| 42. |
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 | |
| 43. |
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 | |
| 44. |
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. | |
| 45. |
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 | |
| 46. |
How many edges does a n vertex triangle free graph contains? |
| A. | n2 |
| B. | n2 + 2 |
| C. | n2 / 4 |
| D. | n3 |
| Answer» D. n3 | |
| 47. |
Which term defines all the complete bipartite graph that are trees? |
| A. | symmetric |
| B. | anti – symmetric |
| C. | circular |
| D. | stars |
| Answer» E. | |
| 48. |
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 | |
| 49. |
Which graph is also known as biclique? |
| A. | histogram |
| B. | complete bipartite |
| C. | cartesian |
| D. | tree |
| Answer» C. cartesian | |
| 50. |
Which structure can be modelled by using Bipartite graph? |
| A. | hypergraph |
| B. | perfect graph |
| C. | hetero graph |
| D. | directed graph |
| Answer» B. perfect graph | |