my last name is CARTER.
Network Diagram
Complete Exercise 3, a through d, on page 229 of the course textbook. Consider Figure 5-28. All duration estimates are in days, and the network proceeds from Node 1 to Node 9. A. Draw an AOA network diagram representing the project.
- Put the node numbers in circles and draw arrows from node to node, labeling each arrow with the activity letter and estimated duration. Add a tenth node with one day with your last name.
- Identify all the paths on the network diagram and note how long they are.
- What is the critical path for this project, and how long is it?
- What is the shortest possible time it will take to complete this project?
The assignment
- Must be two to three double-spaced pages in length (not including title and references pages) and formatted according to APA style as outlined in the Writing CenterLinks to an external site..
- Must include a separate title page with the following:
- Title of paper
- Student’s name
- Course name and number
- Instructor’s name
- Date submitted
- Must document all sources in APA style as outlined in the Writing Center.
- Must include a separate references page that is formatted according to APA style as outlined in the Writing Center.
Carefully review the Grading RubricLinks to an external site. for the criteria that will be used to evaluate your assignment.
Expert Solution Preview
Introduction:
Exercise 3 on page 229 of the course textbook requires drawing an AOA network diagram representing a project with all duration estimates in days. The critical path and the shortest possible time taken to complete the project are also necessary to determine. This assignment must be two to three double-spaced pages, formatted in APA style, with a separate title page and references page, and all sources documented in APA style.
Answer:
A. To draw an AOA network diagram representing the project, we need to put the node numbers in circles and draw arrows from node to node, labeling each arrow with the activity letter and estimated duration. Adding a tenth node with one day with your last name makes the diagram complete.
Node 1 → Node 2 (A, 7) → Node 3 (B, 5) → Node 4 (C, 3) → Node 5 (D, 5) → Node 6 (E, 3) → Node 7 (F, 4) → Node 8 (G, 6) → Node 9 (H, 4) → Node 10 (I, 1) with CARTER
B. The network diagram has three paths: 1-2-3-4-5-6-7-8-9-10; 1-2-3-4-5-7-8-9-10; and 1-2-3-4-5-7-9-10.
The path 1-2-3-4-5-7-9-10 takes the longest with a length of 27 days.
C. The critical path is the path with the longest duration in the network. In this case, it is the path 1-2-3-4-5-7-9-10 with a length of 27 days.
D. To determine the shortest possible time it will take to complete this project, we need to find the smallest sum of the durations of all possible paths in the network. Thus, the shortest possible time is the duration of the critical path, which is 27 days.
