Consider the following network:
Which activities are dependencies for activity C?
What are the initial activities?
What are the final activities?
Which activities have no dependencies?
Consider the following network:
Which activities are dependencies for activity D?
What are the initial activities?
What is the final activity?
Which activities have no dependencies?
For each of the following networks:
Which activities are dependencies for activity E?
What are the initial activities?
What are the final activities?
Which activities have no dependencies?
Consider the following network:
Which activities are dependencies for activity E?
What is the initial activity?
What is the final activity?
Which activity has no dependencies?
Consider the following network:
Which activity is a dependency for activity E?
What are the initial activities?
What are the final activities?
Which activities have no dependencies?
Consider the following network:
Which activity is a dependency for activity F?
What is the initial activity?
What is the final activity?
Which activity has no dependencies?
Consider the following network:
Which activities are dependencies for activity F?
What is the initial activity?
What is the final activity?
Which activity has no dependencies?
Consider the following network:
Which activities are dependencies for activity G?
What are the initial activities?
What is the final activity?
Which activities have no dependencies?
For each of the following networks, complete an activity table by listing the duration and direct dependencies for each activity. If an activity has no dependencies, write an X.
Construct a project network for each of the following activity charts:
Activity | Duration | Dependencies |
---|---|---|
A | 1 | - |
B | 8 | A |
C | 1 | A |
D | 3 | B,C |
E | 9 | D |
Activity | Duration | Dependencies |
---|---|---|
A | 7 | - |
B | 4 | - |
C | 5 | - |
D | 5 | A,B,C |
E | 4 | D |
F | 7 | D |
Activity | Duration | Dependencies |
---|---|---|
A | 1 | - |
B | 4 | - |
C | 3 | A |
D | 7 | B |
E | 3 | - |
F | 5 | C,D |
G | 5 | F,E |
Activity | Duration | Dependencies |
---|---|---|
A | 7 | - |
B | 2 | - |
C | 3 | A,B |
D | 7 | A,B |
E | 1 | C |
F | 9 | D |
Activity | Duration | Dependencies |
---|---|---|
A | 2 | - |
B | 7 | - |
C | 3 | - |
D | 8 | A,B,C |
E | 4 | D |
F | 5 | D |
G | 7 | E,F |
Activity | Duration | Dependencies |
---|---|---|
A | 2 | - |
B | 9 | A |
C | 4 | A |
D | 3 | B,C |
E | 4 | D |
Activity | Duration | Dependencies |
---|---|---|
A | 9 | - |
B | 8 | - |
C | 3 | A |
D | 7 | B |
E | 2 | - |
F | 4 | C,D |
G | 8 | F,E |
Activity | Duration | Dependencies |
---|---|---|
A | 2 | - |
B | 8 | - |
C | 7 | - |
D | 7 | A,B,C |
E | 7 | D |
F | 2 | D |
G | 8 | E,F |
Activity | Duration | Predecessor |
---|---|---|
A | 3 | - |
B | 7 | A |
C | 1 | A |
D | 4 | A |
E | 6 | B,C |
F | 2 | C,D |
Which of the following precedence tables would require a dummy task to represent the dependencies shown correctly:
Activity | Dependencies |
---|---|
A | - |
B | A |
C | A |
D | B, C |
E | D |
Activity | Dependencies |
---|---|
A | - |
B | A |
C | B, C |
D | B, C |
E | D |
Activity | Dependencies |
---|---|
A | - |
B | A |
C | B |
D | B, C |
E | D |
Activity | Dependencies |
---|---|
A | - |
B | - |
C | B |
D | B |
E | A, C |
Draw a network representation for each of the following activity tables below:
Task | Prerequisite |
---|---|
A | - |
B | - |
C | B |
D | A, B |
E | D |
Task | Prerequisite |
---|---|
A | - |
B | - |
C | - |
D | B, C |
E | A, D |
F | B |
G | F, E |
Task | Time (hours) | Prerequisite |
---|---|---|
A | 2 | - |
B | 3 | - |
C | 2 | A, D |
D | 5 | B |
E | 7 | B |
F | 4 | A, D, E |
G | 3 | F |
To assemble a flat-pack desk from a kit requires various activities. These are shown in the following table, together with the number of minutes each activity takes and the order in which some of them must be done:
Activity | Description | Duration (minutes) | Dependencies |
---|---|---|---|
A | \text{Assemble the drawer} | 30 | - |
B | \text{Fix the legs to the desktop} | 15 | - |
C | \text{Attach the drawer} | 15 | A |
D | \text{Attach the sides} | 10 | B |
E | \text{Attach the back} | 5 | B |
F | \text{Attach the network sockets} | 15 | D, E |
G | \text{Connect the network wiring} | 25 | C, F |
Using the provided information, construct a project network.
The following table contains information for a project to convert an old bus into a restaurant:
Activity | Description | Immediate Predecessor | Time (weeks) |
---|---|---|---|
A | \text{Purchase old bus and strip interior} | - | 10 |
B | \text{Purchase equipment} | - | 3 |
C | \text{Hire and train staff} | I, M | 5 |
D | \text{Select and purchase location} | A | 4 |
E | \text{Prepare location} | D | 3 |
F | \text{Obtain food and beverage licenses} | D | 7 |
G | \text{Move the bus to the selected location} | E | 1 |
H | \text{Connect electricity and water} | G, F | 2 |
I | \text{Decorate the interior} | H, B | 3 |
J | \text{Stock bar and kitchen} | I, M | 2 |
K | \text{Advertise promotional events} | G, F | 3 |
M | \text{Install kitchen equipment and dining tables/chairs} | G, F | 4 |
N | \text{Promotional events} | J,K, C | 2 |
Using the provided information, construct a project network.
The table shown specifies the task names, duration and dependencies for a project.
Using the provided information, construct a project network.
Task | Duration | Dependencies |
---|---|---|
B | 2 | - |
D | 5 | B |
F | 7 | - |
H | 3 | - |
J | 4 | D, F, H |
L | 10 | D, F, H |
N | 2 | J |
P | 8 | J |
Q | 7 | L |
S | 5 | N, P, Q |
The table below describes the tasks that are required to build a new personal computer:
Activity | Description | Time (hours) |
---|---|---|
C | \text{Select components} | 2 |
H | \text{Assemble chassis} | 1 |
B | \text{Build components} | 4 |
R | \text{Setup cooling system} | 1 |
O | \text{Install software} | 4 |
T | \text{System testing} | 3 |
D | \text{Prepare user documents} | 2 |
P | \text{Invoice customer} | 1 |
The order in which the tasks should be completed is given below:
Using the provided information, construct a project network.
The process of preparing a meal consists of tasks A to K as shown in the network diagram below:
Complete the following activity table showing dependencies. If an activity has no dependencies, enter X.
Task | Time (minutes) | Dependencies |
---|---|---|
A | 5 | |
B | 2 | |
C | 8 | |
D | 8 | |
E | 4 | |
F | 2 | |
G | 5 | |
H | 1 | |
I | 4 | |
J | 7 | |
K | 4 |
The given precedence table has been provided to control the movement of stock within a store during a refit. The junior manager has been given the task of planning the operation so that the total time taken by the project is kept to a minimum and that staff are used most efficiently. All time is given in hours.
The network shown below requires a dummy task to be added to correctly represent the network, where the order indicates the direction of the arrow.
Which two nodes should be joined with a dummy task?
Task | Time (hours) | Prerequisites |
---|---|---|
A | 5 | - |
B | 5 | - |
C | 4 | B |
D | 8 | A |
E | 3 | D, G |
F | 1 | E |
G | 2 | C |
H | 3 | D |
J | 4 | H |
K | 3 | F, J |
L | 4 | E |