4. Calculate the late finishing time (backwards calculations) 5. Calculate the slack time of the non-critical path activities 5. Identify the critical path (highlight critical path activities)

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
icon
Related questions
Question

i need 4 ,5 ,6

H
E
S
F
Notations used
Earliest
Activity
Earliest
Start
Finish
Time
Tie
Duration
Calculations:
End time of preceding activity is the start time of succeeding activity
Add duration of activity to start time to get end time of activity
In case of 2 or more activities preceding an activity take activity with the latest finish time to
calculate the start time of the activity.
15
15 H 23
36 | 44
8
D 15
19 G 25
25 I
36
11
9F
19
10
The last activity ends on the 44th day so,
The total time taken by a project is 44 days
Transcribed Image Text:H E S F Notations used Earliest Activity Earliest Start Finish Time Tie Duration Calculations: End time of preceding activity is the start time of succeeding activity Add duration of activity to start time to get end time of activity In case of 2 or more activities preceding an activity take activity with the latest finish time to calculate the start time of the activity. 15 15 H 23 36 | 44 8 D 15 19 G 25 25 I 36 11 9F 19 10 The last activity ends on the 44th day so, The total time taken by a project is 44 days
Activity 2: Identify the critical path for the following three scenarios of a project activities
(tables given below) and their required times to be completed in addition to their predecessors
for developing a Website":
Activity Description
Duration (days) Preceding Activities
A
Determine user neceds
8
в
Review s/w and languages
Purchase software
9.
D
Design format and style
9.
E
Write programs
A
F
Review outcome product
with user
10
Make revisions
D, F
H
Select server site
E
Install on server and test
11
G
J
H, I
1. Draw the path.
2. Calculate the early finishing time (forwards calculations)
3. Highlight the total time to complete the project (days or weeks)
4. Calculate the late finishing time (backwards calculations)
5. Caleulate the slack time of the non-critical path activities
6. Identify the critical path (highlight critical path activities)
Transcribed Image Text:Activity 2: Identify the critical path for the following three scenarios of a project activities (tables given below) and their required times to be completed in addition to their predecessors for developing a Website": Activity Description Duration (days) Preceding Activities A Determine user neceds 8 в Review s/w and languages Purchase software 9. D Design format and style 9. E Write programs A F Review outcome product with user 10 Make revisions D, F H Select server site E Install on server and test 11 G J H, I 1. Draw the path. 2. Calculate the early finishing time (forwards calculations) 3. Highlight the total time to complete the project (days or weeks) 4. Calculate the late finishing time (backwards calculations) 5. Caleulate the slack time of the non-critical path activities 6. Identify the critical path (highlight critical path activities)
Expert Solution
steps

Step by step

Solved in 2 steps with 1 images

Blurred answer
Knowledge Booster
Public key encryption
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.
Similar questions
Recommended textbooks for you
Database System Concepts
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)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education