Course Content

Other Courses

Tribhuvan university BIT BIT Curriculum Discrete Structure Old Questions Model Question

Discrete Structure - Old Questions

Question Answer Details
Syllabus Notes Old Questions Unit Wise Questions Question Bank

3. What is shortest path finding problem? Use Dijkstra’s algorithm to find the length of the shortest path between a and z in the given weighted graphs. (2 + 8)

        

10 marks
Asked in Model Question

Answer

Back to Question Paper
AI Generated Answer

AI is thinking...