## Discussion Forum

Que. | If all the edge weights of an undirected graph are positive, then any subset of edges that connects all the vertices and has minimum total weight is a |

a. | Hamiltonian cycle |

b. | grid |

c. | hypercube |

d. | tree |

Answer:tree |

Que. | If all the edge weights of an undirected graph are positive, then any subset of edges that connects all the vertices and has minimum total weight is a |

a. | Hamiltonian cycle |

b. | grid |

c. | hypercube |

d. | tree |

Answer:tree |

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.