Course Content

Other Courses

Tribhuvan university CSIT 2065 Syllabus Discrete Structure Old Questions 2068

Discrete Structure - Old Questions

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

20. Use Fleury’s algorithm to construct an Euler circuit for the following graph.

OR

Explain the concept of network flows and max-flow min- cut with suitable examples.

8 marks
Asked in 2068

Answer

Back to Question Paper
AI Generated Answer

AI is thinking...