‫الجامعة التكنولوجية – قسم علوم الحاسوب‬

‫تقرير االمتحان النهائي للفصل الدراسي (كورس الثاني )‬

‫‪ ‬لسنة ‪2020-2019‬‬

‫عنوان التقرير‬
‫)‪ (Network Analysis‬‬
 Network Analysis
 Introduction
Network scheduling is a technique used for planning, and scheduling large projects in the field of
construction, maintenance, fabrication, purchasing computer system etc. The technique is a method
of minimizing the trouble spots such as production, delays and interruptions, by determining critical
factors and coordinating various parts of the overall job. There are two basic planning and control
technique that utilize a network to complete a predetermined project or schedule. These are
Program Evaluation and Review Technique (PERT) and Critical Path Method (CPM). A project is
defined as a combination of interrelated activities all of which must be executed in a certain order
for its completion

 Activity: These are the portions of a project/operation that consume time or resources and have
definable start and end. Commonly used synonyms are “Task”, and “Job”. Activities are graphically
represented by arrows with arrow heads showing the direction.

Figure 1: Graph of an Activity

 Event: The beginning and ending points of activities are called events. Theoretically any event is
an instantaneous point in time. Commonly used synonyms are “Node”, and “Connector”. Events
are graphically represented by numbered circles, although any geometric figure will serve the
purpose

Figure 2: Graph of an Even

 Merge and Burst Events: If an event represents the joint completion of more than one
activity, it is called a “merge” event. If an event represents the joint initiation of more than one
activity, it is called a “burst” event..

Figure 3: Merge Events Figure 4: Burst Events

 Dummy activity certain activities which neither consumes time nor resources but are used simply
to represent a connection or a link between the events are known as dummies. It is shown in the
network by a dotted line. The purpose of introducing dummy activity is (i) To maintain uniqueness
in the numbering system as every activity may have distinct set of events by which the activity can
be identified. (ii) To maintain a proper logic in the network. Note: No two activities can be
identified by the same beginning and end event, In such cases, a dummy activity is introduced to
resolve the problem.
D
B
B
A D
A
Dummy

c C

 Rules of Network analysis

There are number of rules in connection with the handling of events and activities of a project
network that should be followed.
1. Try to avoid arrows which cross each other.
2. Use straight arrows.
3. (No event can occur until every activity preceding, it has been completed.
4. An event cannot occur twice i.e. there must be no loops.
5. An activity succeeding an event cannot be started until that event has occurred.
6. Use arrows from left to right. Avoid mixing two directions, vertical and standing arrows may
be used if necessary.
7. Dummies should be introduced if it is extremely necessary.
8. The network has only one entry point called the start event and one point of emergence called the
end or terminal event
 EXAMPLE- 1
Construct the arrow diagram comprising activities A, B, C, ………,and L, such that the following
relationships are satisfied.
1. A. B, and C, the first activities of the project, can start simultaneously.
2. A and B precede D.
3. B precedes E, F, and H.
4. F and C precede G.
5. E and H precede I and J.
6. C, D, F, and J precede K.
7. K precedes L.
8. I, G, and L are the terminal activities of the project.

SOLUTION:
The resulting arrow diagram is shown below. The diagram shows that the dummy activities
D1and D2 are used to establish correct precedence relationships. D3 is used to identify activities
E and H with unique end events. The event of the project are numbered such that their ascending
order indicates the direction of progress in the project

D K
7
3
7 L
J
A

D1 4 D3
H I
9
B E
1 2
5
F D2
C G
6

EXAMPLE- 2
Construct a network for the project whose activities and their precedence relationships are as
given in Table I:
 Activity A B C D E F G H I
Predecessor __ A A __ D B,C,E F D G,H
Activity

SOLUTION:
From the given constraints, it is clear that A, D are the starting activity and I the terminal activity.
B. C are starting with the same event and are both the predecessors of the activity F. Also E has to
be the predecessor of F. Hence, we have to introduce a dummy activity

B
4

2
A D1

C
F G I
1
5 6 7 8

D E
3
H

EXAMPLE- 3
Construct a network for the project whose activities and their precedence relationships are as
given in Table 2.
TABLE2

Activity A B C D E F G H I J K
Predecessor - - - A C B,D B,D E,F A G,H E,F
Activity

SOLUTION:

2 I
A

D
G
6 J
B
F
1 4
H
7
K
 C 3 E 5

EXAMPLE- 4
Construct the network for the project whose activities, their durations and their precedence
relationships are as given in Table 3:
TABLE 3

Activity Predecessor Activity Duration

A - 2
B A 6
C B 6
D B 1
E A 3
F E,D 3
G C,F 2

SOLUTION:

3
C
B
6
6

1 D
A G
1 2 5 6
E
2 F
2
3 3

4
References
-Dr. Mahmoud Al-Naimi-Network analysis, https://www.slideshare.net/DrMahmoudAlNaimi1?
utm_campaign=profiletracking&utm_medium=sssite&utm_source=ssslideview,pages 05 ,(Published on
Oct 24, 2016 )

- Dr. khan-Network Construction , https://www.coursehero.com/file/7399509/Network-Construction/

-Wikipedia, https://en.wikipedia.org/wiki/Weighted_correlation_network_analysis