UTpaper

Free mock tests & test series

Question 75Asked in DSSSB TGT Computer Science (Technical), 8 Aug 2021, Shift 2

Consider the following weighted digraph. What is the shortest distance between V1 to V5?

Consider the following weighted digraph. What is the shortest distance between V1 to V5? Edges (from → to, weight): V1 → V2 (30), V2 → V3 (70), V3 → V5 (30), V1 → V4 (50), V4 → V3 (40), V4 → V5 (80), V1 → V5 (120)
  1. A140
  2. B120
  3. C130
  4. D110
Show answerHide answer

Correct answer: (B) 120

Explanation

Path costs: V1→V2→V3→V5 = 130, V1→V4→V3→V5 = 120, V1→V4→V5 = 130 and V1→V5 = 120. The minimum is 120.

From DSSSB TGT Computer Science PYQ (Technical), 8 Aug 2021, Shift 2

This is question 75 of DSSSB TGT Computer Science PYQ (Technical), 8 Aug 2021, Shift 2. See all questions of this paper with answers, or attempt the paper as a timed online test to get your score and all-India rank.