Use the PERT diagram shown to the right to answer the following questions. Assume that time is measured in days. a. Find a critical path for task G. b. Find a critical path for task H. c. Find a critical path for the vertex "End." d. On what day will task F begin? e. On what day will task G begin? f. How many days are required to complete this project?
Use the PERT diagram shown to the right to answer the following questions. Assume that time is measured in days. a. Find a critical path for task G. b. Find a critical path for task H. c. Find a critical path for the vertex "End." d. On what day will task F begin? e. On what day will task G begin? f. How many days are required to complete this project?
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
Related questions
Question
100%
Use the PERT diagram shown to the right to answer the following questions. Assume that time is measured in days.
a. Find a critical path for task G.
b. Find a critical path for task H.
c. Find a critical path for the vertex "End."
d. On what day will task F begin?
e. On what day will task G begin?
f. How many days are required to complete this project?
Transcribed Image Text:### PERT Diagram Activity
#### Questions:
Use the PERT diagram shown to the right to answer the following questions. Assume that time is measured in days.
a. Find a critical path for task G.
b. Find a critical path for task H.
c. Find a critical path for the vertex "End."
d. On what day will task F begin?
e. On what day will task G begin?
f. How many days are required to complete this project?
### Diagram Explanation:
The diagram displayed is a PERT (Program Evaluation Review Technique) chart, which is used for planning and scheduling tasks in a project. The PERT chart consists of nodes representing tasks (A, B, C, D, E, F, G, H, I) and directed edges connecting these nodes. The beginning of the project starts at the node labeled "Begin," and the conclusion is at the node labeled "End."
1. **Nodes**:
- Each node represents a task that must be completed.
- Nodes are labeled from A to I.
2. **Edges**:
- Directed edges indicate the sequence of task execution.
- Each edge connects two tasks and shows the precedence relationship.
3. **Critical Paths**:
- A critical path is the longest time path through the network, determining the shortest completion time for the entire project.
4. **Tasks and Dependencies**:
- Task dependencies illustrate the order in which tasks must be performed.
In this PERT diagram:
- Task A, B, and C are the immediate successors of the "Begin" node.
- Task D, E, and F follow after A, B, and C respectively.
- Task G and H follow after D and E.
- Task I is influenced by G and H and leads to the "End" node.
To answer the questions, one must determine the critical paths and task timings based on the outlined dependencies.
>Note: The specific durations of tasks are not given in the diagram. The diagram provides the project structure sans individual task durations. For detailed project planning and scheduling, the duration values would be required.
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 2 steps
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Recommended textbooks for you
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education