Week 5
Week 5
/CC-2101)
Fall’24
Lecture # 09-10
Instructor
Rida Ayesha
1
Lecture # 09-10 Agenda
2
The Management Spectrum (4 Ps)
● Purpose: The 4 Ps framework helps in managing projects
effectively.
● Focus: These 4 key elements guide decision-making and strategy.
1. People
2. Process
3. Product
4. Project
● Key Points:
○ Frameworks like Agile, Waterfall, Scrum.
○ Clear workflows and methodologies.
○ Continuous improvement (e.g., CI/CD pipelines).
● In Software Engineering:
○ Defines how the team works and the tools they use.
○ Enhances productivity and ensures quality.
Process:
● Iterative development through spirals with planning, risk analysis, and prototypes at each
cycle.
Product:
● Video streaming app with features like video upload, streaming, user authentication, and
recommendations.
Project:
Software Tools:
● Microsoft Project, JIRA, Trello, Monday.com, etc.
Milestones
How can we
modify the graph
to estimate
completion?
Mention duration
of each activity?
EF = ES + t
Example:
● If Activity A finishes at EF = 10 and Activity B finishes at EF = 12, and
Activity C depends on both, Activity C's earliest start would be max(10, 12)
= 12.
In summary, we select the maximum EF during the forward pass to ensure that
all dependencies are respected, and each activity begins at the earliest possible
time without violating any constraints.
These slides are designed to accompany Software Engineering:
A Practitioner’s Approach, 8/e (McGraw-Hill, 2014). Slides 28
copyright 2014 by Roger Pressman.
The Project Network
Activity Scheduling in Activity-on-Node
Configuration
■ LF is the latest finish time: ES Duration EF
LF = EF (for last node only)
LF = Minimum {LS following activities} Activity Number
LS Slack LF
■ LS is the latest time an activity can start without
delaying critical path time:
LS = LF - t
Let’s assume Activity A has two successors, Activity B and Activity C:
Now, Activity A must finish before both B and C can start. The LS for Activity A would be the minimum of the LS
values of B and C:
● min(10, 9) = 9
This ensures that Activity A finishes early enough to allow both B and C to complete on time. If Activity A started
later than this, either Activity B or C would be delayed.
These slides are designed to accompany Software Engineering:
A Practitioner’s Approach, 8/e (McGraw-Hill, 2014). Slides 29
copyright 2014 by Roger Pressman.
Drawing Network Diagram
Start 01
02
Start 01
03
2
3
02
04
3
Start 01
1
1
05
03
2
3
02
04
3
Start 01
1
1
05
03
06
2
3
02
04
3
Start 01 1
1 07 Finish
1
05
03
06
The critical path is the longest path through the network; the minimum time the
network can be completed.
Path A: 1 → 2 → 4 → 7 3 + 2 + 3 + 1 = 9 months
Path B: 1 → 2 → 5 → 6 → 7 3 + 2 + 1 + 1 + 1= 8 months
Path C: 1 → 3 → 4 → 7 3 + 1 + 3 + 1 = 8 months
Path D: 1 → 3 → 5 → 6 → 7 3 + 1 + 1 + 1 + 1 = 7 months
Start 01 1
1 Finish
1 07
05
03
06
Start 01 1
1 Finish
3 1 4 07
05
03
06
Start 01 1
5 1 6 Finish
3 1 4 07
05
03
06
Start 01 1
5 1 6 Finish
3 1 4 07
05
03
6 1 7
06
Start 01 8 1 9
5 1 6 Finish
3 1 4 07
05
03
6 1 7
06
Start 01 8 1 9
5 1 6 Finish
3 1 4 07
05
03 8 9
6 1 7
06
6 1 7
06
7 8
6 1 7
06
7 8
6 1 7
06
7 8
6 1 7
06
7 8
Activity LS ES LF EF Slack, S
*1 0 0 3 3 0
*2 3 3 5 5 0
3 4 3 5 4 1 *Critical
*4 5 5 8 8 0 path
5 6 5 7 6 1
6 7 6 8 7 1
*7 8 8 9 9 0
The Project Network
Activity Slack Time: Critical Path
3 2 5
5 3 8
02
04
0 3 3 3 0 5
5 0 8
Start 01 8 1 9
0 0 3 5 1 6 Finish
3 1 4 07
05
03 8 0 9
Critical Path: 6 1 7
4 1 5
1→2→4→7 6 1 7
06
3 + 2 + 3 + 1 = 9 months
7 1 8
5 2 7
Critical Path: F
14 9 16
A→B→D→G→H
3 + 4 + 5 + 4 + 3 = 19 days
These slides are designed to accompany Software Engineering:
A Practitioner’s Approach, 8/e (McGraw-Hill, 2014). Slides 51
copyright 2014 by Roger Pressman.