Discrete Structure - Old Questions

20. Define Euler and Hamiltonian circuits and paths with examples illustrating the existence and nonexistence of them.

OR

Discuss the shortest path algorithm of Dijkstra for finding the shortest path between two vertices. Use this algorithm to find the length of the shortest path between a and z in the following weighted graph?

Give the idea of travelling salesman problem and the difficulties of solving it.