Q. |
## A directed graph is ………………. if there is a path from each vertex to every other vertex in the digraph. |

A. | weakly connected |

B. | strongly connected |

C. | tightly connected |

D. | linearly connected |

Answer» B. strongly connected |

View all MCQs in:
Data Structure (DS)

- A …………… is an acyclic digraph, which has only one node with indegree 0, and other nodes have in-degree 1.
- In the …………….. traversal we process all of a vertex’s descendants before we move to an adjacent vertex.
- …………………. Is a directed tree in which outdegree of each node is less than or equal to two.
- A graph is said to be ……………… if the vertices can be split into two sets V1 and V2 such there are no edges between two vertices of V1 or two vertices of V2.
- Which data structure is used in breadth first search of a graph to hold nodes?
- A graph is a collection of nodes, called ………. And line segments called arcs or ……….. that connect pair of nodes.
- A ……….. is a graph that has weights of costs associated with its edges.
- Any node is the path from the root to the node is called
- In ……………, search start at the beginning of the list and check every element in the list.
- A …………………… does not keep track of address of every element in the list.

We want to make our service better for you. Please take a moment to fill out our survey.

Take SurveyLogin to Continue

It will take less than 2 minutes

Report MCQ