Representation of Graphs MCQ Quiz in తెలుగు - Objective Question with Answer for Representation of Graphs - ముఫ్త్ [PDF] డౌన్లోడ్ కరెన్
Last updated on Mar 16, 2025
Latest Representation of Graphs MCQ Objective Questions
Top Representation of Graphs MCQ Objective Questions
Representation of Graphs Question 1:
Which of the following statements is false?
Answer (Detailed Solution Below)
Representation of Graphs Question 1 Detailed Solution
Out of all the statements, option 4 is false because there are (n-k) connected components in a graph G if a depth first traversal is done on G with n vertices and k tree edges.
Representation of Graphs Question 2:
The transpose of a directed graph G = (V,E) is the graph GT = (V,E). Thus, GT is G with all its edges reversed. Then running time to compute GT from G for adjacency-matrix representations is ______.
Answer (Detailed Solution Below)
Representation of Graphs Question 2 Detailed Solution
For the adjacency matrix representation, to compute the graph transpose, flip a matrix over its diagonal i.e. swap all the rows of a given matrix into columns and vice-versa. This takes time O(|V|2).
For the adjacency list representation, it requires a scan through all of the lists, it only takes time O(|E| + |V|).Representation of Graphs Question 3:
Match the following :
|
(P) All pairs shortest path |
1. Binary trees |
|
(Q) Depth first search |
2. queue |
|
(R) Breadth first search |
3. Stack |
|
(S) Huffman coding |
4. Matrix |
Answer (Detailed Solution Below)
Representation of Graphs Question 3 Detailed Solution
Representation of Graphs Question 4:
The number of strongly connected components in the following graph are :
Answer (Detailed Solution Below)
Representation of Graphs Question 4 Detailed Solution
Two nodes u and v of a directed graph are connected if there is a path from u to v and from v to u. This relation partition the vertex set V of the graph into disjoint sets of strongly connected components.
Representation of Graphs Question 5:
Match the pairs :
|
a.Articulation |
1.Stack |
|
b. DFS |
2. Queue |
|
c. BFS |
3. Binary tree |
|
d. Huffman coding |
4. Network topology |