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. |
If in a DAG N sink vertices and M source vertices exists, then the number of possible stacks in the Graph Structured Stack representation would come out to be N*M. |
| A. | True |
| B. | False |
| Answer» C. | |
| 2. |
If a Graph Structured Stack contains {1,2,3,4} {1,5,3,4} {1,6,7,4} and {8,9,7,4}, what would be the source and sink vertices of the DAC? |
| A. | Source – 1, 8 Sink – 7,4 |
| B. | Source – 1 Sink – 8,4 |
| C. | Source – 1, 8 Sink – 4 |
| D. | Source – 4, Sink – 1,8 |
| Answer» D. Source – 4, Sink – 1,8 | |
| 3. |
A Graph Structured Stack is a _____________ |
| A. | Undirected Graph |
| B. | Directed Graph |
| C. | Directed Acyclic Graph |
| D. | Regular Graph |
| Answer» D. Regular Graph | |
| 4. |
In the following DAG find out the number of required Stacks in order to represent it in a Graph Structured Stack. |
| A. | 1 |
| B. | 2 |
| C. | 3 |
| D. | 4 |
| Answer» D. 4 | |
| 5. |
The graphs G1 and G2 with their incidences matrices given are Isomorphic. |
| A. | True |
| B. | FalseView Answer |
| Answer» B. FalseView Answer | |
| 6. |
If a Graph Structured Stack contains {1,2,3,4} {1,5,3,4} {1,6,7,4} and {8,9,7,4}, what would be the source and sink vertices of the DAC?$ |
| A. | Source – 1, 8 Sink – 7,4 |
| B. | Source – 1 Sink – 8,4 |
| C. | Source – 1, 8 Sink – 4 |
| D. | None of the Mentioned |
| Answer» C. Source ‚Äö√Ñ√∂‚àö√ë‚àö¬® 1, 8 Sink ‚Äö√Ñ√∂‚àö√ë‚àö¬® 4 | |
| 7. |
A Graph Structured Stack is a _____________$ |
| A. | Undirected Graph |
| B. | Directed Graph |
| C. | Directed Acyclic Graph |
| D. | Regular Graph |
| Answer» D. Regular Graph | |
| 8. |
Graph Structured Stack finds its application in _____________ |
| A. | Bogo Sort |
| B. | Tomita’s Algorithm |
| C. | Todd–Coxeter algorithm |
| D. | All of the mentioned |
| Answer» C. Todd‚Äö√Ñ√∂‚àö√ë‚àö¬®Coxeter algorithm | |
| 9. |
If a connected Graph (G) contains n vertices what would be the rank of its incidence matrix? |
| A. | n-1 |
| B. | values greater than n are possible |
| C. | values less than n-1 are possible |
| D. | insufficient Information is given |
| Answer» D. insufficient Information is given | |
| 10. |
Time complexity to check if an edge exists between two vertices would be ___________ |
| A. | O(V*V) |
| B. | O(V+E) |
| C. | O(1) |
| D. | O(E) |
| Answer» E. | |
| 11. |
The column sum in an incidence matrix for a directed graph having no self loop is __________ |
| A. | 0 |
| B. | 1 |
| C. | 2 |
| D. | equal to the number of edges |
| Answer» B. 1 | |
| 12. |
What are the dimensions of an incidence matrix? |
| A. | Number of edges*number of edges |
| B. | Number of edges*number of vertices |
| C. | Number of vertices*number of vertices |
| D. | None of the mentioned statements |
| Answer» C. Number of vertices*number of vertices | |
| 13. |
The column sum in an incidence matrix for a simple graph is __________ |
| A. | depends on number of edges |
| B. | always greater than 2 |
| C. | equal to 2 |
| D. | equal to the number of edges |
| Answer» D. equal to the number of edges | |
| 14. |
Incidence matrix and Adjacency matrix of a graph will always have same dimensions? |
| A. | True |
| B. | False |
| Answer» C. | |