Software Project Management: UNIT-2 Prepared by Sathish Kumar/Mit

Download as pptx, pdf, or txt
Download as pptx, pdf, or txt
You are on page 1of 28

Software project management

UNIT-2
PREPARED BY
SATHISH KUMAR/MIT
Organisation of the software project management plan
(SPMP) document

• Introduction
• (a) Objectives
• (b) Major Functions
• (c) Performance Issues
• (d) Management and Technical Constraints
• 2. Project estimates
• (a) Historical Data Used
• (b) Estimation Techniques Used
• (c) Effort, Resource, Cost, and Project Duration Estimates
• 3. Schedule
• (a) Work Breakdown Structure
• (b) Task Network Representation
• (c) Gantt Chart Representation
• (d) PERT Chart Representation
• 4.Project resources
• (a) People
• (b) Hardware and Software
• (c) Special Resources

• 5. Staff organization
• (a) Team Structure
• (b) Management Reporting

• 6. Risk management plan


• (a) Risk Analysis
• (b) Risk Identification
• (c) Risk Estimation
• (d) Risk Abatement Procedures

• 7. Project tracking and control plan


• (a) Metrics to be tracked
• (b) Tracking plan
• (c) Control plan
• 8. Miscellaneous plans
• (a) Process Tailoring

• (b) Quality Assurance Plan

• (c) Configuration Management Plan

• (d) Validation and Verification

• (e) System Testing Plan

• (f ) Delivery, Installation, and Maintenance Plan


Scheduling
• Work Breakdown Structure

• Activity Networks

• Critical Path Method (CPM)

• PERT Charts

• Gantt Charts.
SCHEDULING
• The scheduling problem, in essence, consists of
deciding which tasks would be taken up when
and by whom.

• The project manager monitors the timely


completion of the tasks and takes any
corrective action that may be necessary
whenever there is a chance of schedule
slippage.
Activities of SPM
1. Identify all the major activities that need to be carried out to
complete the project.

2. Break down each activity into tasks.

3. Determine the dependency among different tasks.

4. Establish the estimates for the time durations.

5. Represent the information as activity network.

6. Determine task starting and ending dates from the information represented in
the activity network.

7. Determine the critical path.


8. Allocate resources to tasks.
Work Breakdown Structure
How long to decompose
• The decomposition of the activities is carried out
until any of the following is satisfied:

• A leaf-level sub activity (a task) requires


approximately two weeks to develop.

• Hidden complexities are exposed.

• Opportunities for reuse of existing software.


Activity Networks
• The activity network - estimated durations,
interdependencies.
• Two equivalent representations for activity
networks.
– Activity on Node (AoN):
– Activity on Edge (AoE):
• Activity networks were originally represented
using activity on edge (AoE) representation.
• However, later activity on node (AoN) has
become popular since this representation is
easier to understand and revise.
Critical Path Method (CPM)
• A critical task is one with a zero slack time. A
path from the start node to the finish node
containing only critical tasks is called a critical
path.

• CPM is an algorithmic approach to determine


the critical paths and slack times for tasks.
CPM :critical paths and slack times

• Minimum time (MT): It is the minimum time required to


complete the project.

• Earliest start (ES): It is the time of a task is the maximum


of all paths from the start to this task. The ES for a task is the
ES of the previous task plus the duration of the preceding task.

• Latest start time (LST): It is the difference between MT


and the maximum of all paths from this task to the finish.
The LST can be computed by subtracting the duration of the
subsequent task from the LST of the subsequent task.
• Earliest finish time (EF): The EF for a task is the sum
of the earliest start time of the task and the duration of the
task.

• Latest finish (LF): LF indicates the latest time by which


a task can finish without affecting the final completion
time of the project. LF of a task can be obtained by
subtracting maximum of all paths from this task to finish
from MT.

• Slack time (ST): The slack time (or float time) is the
total time that a task may be delayed before it will affect
the end time of the project. LS-ES and can equivalently be
written as LF-EF.
PERT Charts
• PERT charts can be used to determine the probabilistic times for reaching
various project milestones, including the final mile stone.

• PERT charts like activity networks consist of a network of boxes and arrows.

• The boxes represent activities and the arrows represent task dependencies.

• A PERT chart represents the statistical variations in the project estimates


assuming these to be normal distribution.

• PERT allows for some randomness in task completion times, and therefore
provides the capability to determine the probability for achieving project
milestones based on the probability of completing each task along the path
to that milestone.
• Each task is annotated with three estimates:
• Optimistic (O): The best possible case task
completion time.

• Most likely estimate (M): Most likely task


completion time.

• Worst case (W): The worst possible case task


completion time.
Gantt Charts
• Gantt charts used in software project
management are actually an enhanced version
of the standard Gantt charts.
• In the Gantt charts used for software project
management, each bar consists of a unshaded
part and a shaded part.
• The shaded part of the bar shows the length of
time each task is estimated to take.
• The unshaded part shows the slack time or lax
time.
• A Gantt chart is a special type of bar chart where each
bar represents an activity. The
• bars are drawn along a time line.

• The length of each bar is proportional to the duration


of time planned for the corresponding activity.

• The project manager designates certain key events


such as completion of some
• important activity as a milestone.

You might also like