This preview shows pages 1–6. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: a call on hold by pressing #. 3 Question 3 (5 points) Given the Petri Net below, represent the state of the Petri Net when firing the following sequence of transitions: e1 e4 e3 e5 e1 e2 e1 e3. b1 b2 b3 b5 b4 e1 e2 e4 e3 e5 4 Question 4 (5 points) (a) Define and give an example of an Euler Circuit. Is there a criterion to determine if such circuit exists? If so, what is the criterion? (b) Define and give an example of a Hamilton Circuit. Is there a criterion to determine if such circuit exists? If so, what is the criterion? 5 Question 5 (5 points) Given the graph G below: use Dijkstras algorithm to find the shortest path. Clearly show each iteration of the algorithm. use either Prims or Kruskals algorithm to find the minimum spanning tree. Clearly show each iteration of the algorithm. a b c d e f g h i j k l 1 1 1 8 8 2 2 3 3 3 4 4 5 7 6 7 3 2 1 5 6...
View Full
Document
 Spring '09
 Nhut

Click to edit the document details