Question 1
A small software development project has four (4) major activities. The times are determined and provided in the table below.
|
Activity
|
Immediate
Predecessor
|
a
|
m
|
b
|
|
A
|
-
|
2
|
5
|
8
|
|
B
|
A
|
3
|
6
|
9
|
|
C
|
A
|
4
|
7
|
10
|
|
D
|
B
|
2
|
5
|
14
|
|
E
|
D
|
3
|
3
|
3
|
|
F
|
C
|
6
|
8
|
10
|
|
G
|
E, F
|
1
|
1
|
1
|
|
H
|
C
|
6
|
10
|
14
|
|
I
|
G, H
|
3
|
4
|
5
|
(a) Determine the expected completion time for this project?
(b) Draw the network and state the ES, EF, LS,LF, slack in a Table.
Question 2
Given a network with the following distances:
|
From Node
|
To Node
|
Distance
|
|
1
|
2
|
4
|
|
1
|
4
|
1
|
|
2
|
3
|
2
|
|
2
|
4
|
3
|
|
3
|
4
|
6
|
|
3
|
5
|
4
|
|
3
|
6
|
2
|
|
4
|
5
|
7
|
|
4
|
7
|
5
|
|
5
|
6
|
5
|
|
5
|
7
|
8
|
|
6
|
7
|
4
|
(a) Determine which nodes should be connected to get the shortest distance flowing from Node 1 through Node 7. Draw the network.
(b) Determine the minimum distance.