Course Content

Other Courses

Tribhuvan university CSIT 2065 Syllabus Discrete Structure Old Questions 2067

Discrete Structure - Old Questions

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

20. Discuss the Algorithm of Dijkstra for finding the shortest path in a weighted graph between two vertices with suitable example. Moreover, explain the travelling salesman problem and the efficiency of algorithm for solving this problem.

8 marks
Asked in 2067

Answer

Back to Question Paper
AI Generated Answer

AI is thinking...