Week 6 Homework
The weight of the minimal spanning tree is 9, the edges are highlighted above.
A
/
C
/
D
/ \
B
H
/
/
F
E
/\
/
G J K
Preorder: A,B,D,F,M,C,H,N,G,E,K,L
Inorder: F,M,D,B,H,N,C,A,G,L,K,E
PostOrder: M,F,D,N,H,C,B,L,K,E,G,A

Week 1 Homework Marcus Stewart
1. (Similar to Exercise 1.1 Question 10 on page 9) Given the following table, make a PERT diagram, and
determine the project time and the critical path. Provide a justification on how you obtain your project
time and critica

Week 3 Homework
From the recurrence relation and the initial condition we have:
S(0) = 7
S(1) = 7-2
S(2) = (7-2)-2
S(3) = [(7-2)-2]-2
So we conjecture that S(n) = 7-2n
Step 1 Set S =a, k=0, and t=a
Step 2 While k<n
Replace t with t+d
Replace S with S+t
Re

The problem is looking for a Euler Circuit, by the graph I made you can see that Every vertex has an even degree
(2,2,2,4,6) so yes we have a Euler Circuit that shows that the people of Honigsberg can in fact go ever each bridge exactly
one time and retur