## Discussion Forum

Que. | 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:Strongly Connected |

Que. | 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:Strongly Connected |

Questions from Previous year GATE question papers

UGC NET Previous year questions and practice sets

UGC NET Previous year questions and practice sets

Attempt a small test to analyze your preparation level. This GATE exam includes questions from previous year GATE papers.

Practice test for UGC NET Computer Science Paper. The questions asked in this NET practice paper are from various previous year papers.