UNIT VI PROJECT

odeezy82

EXAMPLEVI.pdf

Home >Business & Finance homework help >Accounting homework help >UNIT VI PROJECT

SAFEASSIGNCHECKTEST - CSU SAFEASSIGN PLAGIARISM CHECK TOOL

SafeAssign Originality Report Generator I Odell Kruah

on Fri, Nov 30 2018, 4:44 PM

100% highest match Submission ID: d0da8619-c56f-4e34-9af1-6edd71018503

Attachments (1)

PROJECT VI.docx

1 ODELL KRUAH PROJECT MANAGEMENT UNIT VI NOVEMBER 30,

2018

Part 1

1 DEVELOP AN IN-DEPTH SCHEDULE FOR THE PROJECT YOU

SELECTED AND USED TO DEVELOP THE STATEMENT OF WORK AND

WORK BREAKDOWN STRUCTURE IN UNIT III. PLEASE REFER TO

THE INTEGRATED PROJECT IN CHAPTER 10 ON PAGE 363 (PROJECT

SCHEDULING) OF THE TEXTBOOK FOR MORE INFORMATION. BE

SURE TO INCLUDE THE FOLLOWING COMPONENTS:

· AN ACTIVITY PRECEDENCE DIAGRAM, · AN ACTIVITY DURATION

TABLE, AND · A NETWORK DIAGRAM AND GANTT CHARTS.

· AN ACTIVITY PRECEDENCE DIAGRAM:

(http://safeassign.blackboard.com/)

PROJECT VI.docx

Word Count: 862 Attachment ID: 244309330

100%

ACTIVITY DURATION TABLE:

ACTIVITY EXPECTED DURATION PREDECESSOR

A 5 DAYS ----

B 10 DAYS A

C 8 DAYS A

D 1 DAY A

E 5 DAYS B, C

F 10 DAYS D, E

G 14 DAYS F

H 3 DAYS G

I 12 DAYS F

J 6 DAYS H, I

A NETWORK DIAGRAM AND GANTT CHARTS:

Part 2

1 PLEASE COMPLETE CASE STUDY 10.1: PROJECT SCHEDULING AT

BLANQUE CHECK CONSTRUCTION ON PAGE 360 OF THE TEXTBOOK,

AND ANSWER THE THREE QUESTIONS AT THE END.

Q1(ANS)

PRECEDENCE DIAGRAM:

1 C=DIFFERENT CONSRUCTION TYPES OF SCHEDULING METHODS

TYPE FROM 1 TO 9 P= DIFFERENT CONSRUCTION PROJECTS WHICH

SHOW THE TYPES OF SCHEDULING METHODS TYPE FROM 1 TO 9

O1=ORGANIZATION ONE O2= ORGANIZATION 2

S E C4 C5 O1 P9 P8 O2 P7 P6 P5 P4 P3 P2 C9 C8 C7 C6 C1 C2 C3 P1

Q2(ANS) ACCORDING TO MY RESEARCH LEVEL AND LITERATURE

REVIEW THE EXPERT OPINION AND PAST HISTORY BOTH ARE THE

BEST TO SOLVE PROBLEM FOR CALCULATING THE CRITICAL

PATH ,WHICH MAY ALSO TELL US THE DURATION OR PROJECT

DELAY TO HANDLE OR RUN OUR CONSTRUCTION COMPANY.

Q3(ANS) THESE BOTH HAVE SOME STRENGTHENS AND

WEAKNESSES AND BOTH GIVE THE RESULTS PROBABLY SAME , BUT

ACCORDING TO LITERATURE AOA IS THE BENEFICIAL FOR

MODELING IT WILL BE HELPFUL AND IN THE BUSINESS FIELD IT

WILL BE IMPORTANT AON WILL BE LESS WIDELY USED , IN CASE OF

LARGE AND COMPLEX PROJECTS IT IS EASIER TO EMPLOY THE

PATH PROCESS USED IN THE AOA. ACCORDING TO AOA WE

ACHIEVE THE EVERY MILESTONE AND PARTICULARLY USED THE

DUMMY PROJECTS OR ACTIVITIES THE CONCEPT OF DUMMY

PROJECT IS NOT SIMPLE AND EASY IT REQUIRE MORE TRAINING

AND PRACTICE. AON CONVENTION ,AOA NETWORK USED BOTH

NODES AND ARROW TO LABEL THE PROJECT.

Part 3

1 DEVELOP A NETWORK ACTIVITY CHART, AND IDENTIFY THE

CRITICAL PATH FOR A PROJECT BASED ON THE INFORMATION

PROVIDED IN THE GANTT CHART BELOW. DRAW THE ACTIVITY

NETWORK AS A GANTT CHART. WHAT IS THE EXPECTED DURATION

OF THE PROJECT?

ACTIVITY EXPECTED DURATION PREDECESSOR

A 5 DAYS ----

B 10 DAYS A

C 8 DAYS A

D 1 DAY A

E 5 DAYS B, C

F 10 DAYS D, E

G 14 DAYS F

H 3 DAYS G

I 12 DAYS F

J 6 DAYS H, I

AN ACTIVITY PRECEDENCE DIAGRAM:

THE TOTAL PATHS CAN BE CALCULATED THERE THE FIRST

DIAGRAM CAN BE DEFINED THE OVERALL PATHS WHICH ARE

GIVEN BELOW

ABEFIJ=5+10+5+10+12+6=48 ABEFGHJ=5+10+5+10+14+3+6=53

ACEFIJ=5+8+5+10+12+6=46 ACEFGHJ=5+10+5+10+14+3+6=51

ADFIJ=5+1+10+12+6=34 ADFGHJ=5+1+10+14+3+6=39

Critical path:

1 THE 2ND PATH CAN BE CONSTRUCTED FOR THE CRITICAL PATH

WHICH HAVE THE LONGEST PATH DURATION

ABEFGHJ=5+10+5+10+14+3+6=53 ITS KNOWN AS A CRITICAL PATH

FOR THE GIVEN ACTIVITY.

PRECEDENCE DIAGRAM AND CRITICAL PATH

END H J G F E B A A J H G E F I START D C B J END START END END

Part 4

1 USING THE INFORMATION PROVIDED IN THE GANTT CHART

BELOW, CONSTRUCT THE PROJECT ACTIVITY NETWORK USING THE

ACTIVITY-ON-NODE (AON) METHODOLOGY, AND LABEL EACH

NODE. IDENTIFY THE CRITICAL PATH AND OTHER PATHS

THROUGH THE NETWORK.

Activity

Duration

Predecessors

B, C

1 E, F, G

ACTIVITY DURATION ES EF LS

LF Slack

1 A 3 0 3 0

0 --

1 B 5 3 8 8

13 5

1 C 7 3 10 3

10 --

1 D 3 10 13 13

13 --

1 E 5 8 13 13

17 5

1 F 4 13 17 13

1 G 2 10 12 15

17 5

1 H 5 17 22 17

22 --

SOLUTION:

1 1 PART 1:

0 A

5 B

5 E

3 D

1 0 3 0

8 5 13

3 5 17

1 13 3 13

0 H

END

0 F

1 17 5 22

0 C

1 13 4 17

3 7 10

5 G

LEGEND

1 15 2 17

ES ID EF

SL DISCRIPTION

1 LS DURATION LF

THE CRITICAL PATH CAN BE CHOOSE WHICH HAVE THE MINIMUM

SLACK AND THEN FIND THE DURATION OR DELAY OF CRITICAL

PATH FIRST OF ALL WE FIND THE CRITICAL PATH OF GIVEN

ACTIVITY THE CRITICAL PATH HAVE MINIMUM SLACK BUT DELAY

SHOULD BE MAXIMUM ,WHICH ARE GIVEN BELOW

ACDFH=3+7+3+4+5=22DAYS/MIN WITH THE CRITICAL POINT OF

SLACK THE FLEXIBILITY OF THE PROJECT IS LIMITED

Citations (1/1)

Matched Text

1 Another student's paper

Suspected Entry: 62% match

Uploaded - PROJECT VI.docx

ODELL KRUAH PROJECT MANAGEMENT

UNIT VI NOVEMBER 30, 2018

Source - Another student's paper

Unit VI Project Odell Kruah Columbia Southern

University 11/18/2018

Suspected Entry: 100% match

Uploaded - PROJECT VI.docx

DEVELOP AN IN-DEPTH SCHEDULE FOR

THE PROJECT YOU SELECTED AND USED

TO DEVELOP THE STATEMENT OF WORK

AND WORK BREAKDOWN STRUCTURE IN

UNIT III

Source - Another student's paper

Develop an in-depth schedule for the project

you selected and used to develop the statement

of work and work breakdown structure in Unit III

Suspected Entry: 100% match

Uploaded - PROJECT VI.docx

PLEASE REFER TO THE INTEGRATED

PROJECT IN CHAPTER 10 ON PAGE 363

(PROJECT SCHEDULING) OF THE

TEXTBOOK FOR MORE INFORMATION

Source - Another student's paper

Please refer to the Integrated Project in Chapter

10 on page 363 (Project Scheduling) of the

textbook for more information

Suspected Entry: 100% match

Uploaded - PROJECT VI.docx

BE SURE TO INCLUDE THE FOLLOWING

COMPONENTS

Source - Another student's paper

Be sure to include the following components

Suspected Entry: 100% match

Uploaded - PROJECT VI.docx

· AN ACTIVITY PRECEDENCE DIAGRAM, ·

AN ACTIVITY DURATION TABLE, AND · A

NETWORK DIAGRAM AND GANTT CHARTS

Source - Another student's paper

· an activity precedence diagram, · an activity

duration table, and · a network diagram and

Gantt charts

Suspected Entry: 100% match

Uploaded - PROJECT VI.docx

· AN ACTIVITY PRECEDENCE DIAGRAM

Source - Another student's paper

· An activity precedence diagram

Suspected Entry: 100% match

Uploaded - PROJECT VI.docx

ACTIVITY DURATION TABLE

Source - Another student's paper

Activity duration table

Suspected Entry: 100% match

Uploaded - PROJECT VI.docx

ACTIVITY EXPECTED DURATION

PREDECESSOR

Source - Another student's paper

Activity Expected Duration Predecessor

Suspected Entry: 100% match

Uploaded - PROJECT VI.docx

A 5 DAYS ----

Source - Another student's paper

A 5 days ----

Suspected Entry: 99% match

Uploaded - PROJECT VI.docx

B 10 DAYS A

Source - Another student's paper

B 10 days A

Suspected Entry: 99% match

Uploaded - PROJECT VI.docx

C 8 DAYS A

Source - Another student's paper

C 8 days A

Suspected Entry: 100% match

Uploaded - PROJECT VI.docx

D 1 DAY A

Source - Another student's paper

D 1 day A

Suspected Entry: 100% match

Uploaded - PROJECT VI.docx

E 5 DAYS B, C

Source - Another student's paper

E 5 days B, C

Suspected Entry: 99% match

Uploaded - PROJECT VI.docx

F 10 DAYS D, E

Source - Another student's paper

F 10 days D, E

Suspected Entry: 99% match

Uploaded - PROJECT VI.docx

G 14 DAYS F

Source - Another student's paper

G 14 days F

Suspected Entry: 99% match

Uploaded - PROJECT VI.docx

H 3 DAYS G

Source - Another student's paper

H 3 days G

Suspected Entry: 100% match

Uploaded - PROJECT VI.docx

I 12 DAYS F

Source - Another student's paper

I 12 days F

Suspected Entry: 100% match

Uploaded - PROJECT VI.docx

J 6 DAYS H, I

Source - Another student's paper

j 6 days H, I

Suspected Entry: 100% match

Uploaded - PROJECT VI.docx

A NETWORK DIAGRAM AND GANTT

CHARTS

Source - Another student's paper

A network diagram and Gantt charts

Suspected Entry: 100% match

Uploaded - PROJECT VI.docx

PLEASE COMPLETE CASE STUDY 10.1

Source - Another student's paper

Please complete Case Study 10.1

Suspected Entry: 99% match

Uploaded - PROJECT VI.docx

PROJECT SCHEDULING AT BLANQUE

CHECK CONSTRUCTION ON PAGE 360 OF

THE TEXTBOOK, AND ANSWER THE THREE

QUESTIONS AT THE END

Source - Another student's paper

Project Scheduling at Blanque Check

Construction on page 360 of the textbook and

answer the three questions at the end

Suspected Entry: 100% match

Uploaded - PROJECT VI.docx

C=DIFFERENT CONSRUCTION TYPES OF

SCHEDULING METHODS TYPE FROM 1 TO 9

P= DIFFERENT CONSRUCTION PROJECTS

WHICH SHOW THE TYPES OF SCHEDULING

METHODS TYPE FROM 1 TO 9

O1=ORGANIZATION ONE O2=

ORGANIZATION 2

Source - Another student's paper

C=DIFFERENT CONSRUCTION TYPES OF

SCHEDULING METHODS TYPE FROM 1 TO 9

P= DIFFERENT CONSRUCTION PROJECTS

WHICH SHOW THE TYPES OF SCHEDULING

METHODS TYPE FROM 1 TO 9

O1=ORGANIZATION ONE O2=

ORGANIZATION 2

Suspected Entry: 100% match

Uploaded - PROJECT VI.docx

S E C4 C5 O1 P9 P8 O2 P7 P6 P5 P4 P3 P2

C9 C8 C7 C6 C1 C2 C3 P1

Source - Another student's paper

S E C4 C5 O1 P9 P8 O2 P7 P6 P5 P4 P3 P2

C9 C8 C7 C6 C1 C2 C3 P1

Suspected Entry: 100% match

Uploaded - PROJECT VI.docx

Q2(ANS) ACCORDING TO MY RESEARCH

LEVEL AND LITERATURE REVIEW THE

EXPERT OPINION AND PAST HISTORY

BOTH ARE THE BEST TO SOLVE PROBLEM

FOR CALCULATING THE CRITICAL

PATH ,WHICH MAY ALSO TELL US THE

DURATION OR PROJECT DELAY TO

HANDLE OR RUN OUR CONSTRUCTION

COMPANY

Source - Another student's paper

Q2(ANS) According to my research level and

literature review the expert opinion and past

history both are the best to solve problem for

calculating the critical path ,which may also tell

us the duration or project delay to handle or run

our construction company

Suspected Entry: 100% match

Uploaded - PROJECT VI.docx

Q3(ANS) THESE BOTH HAVE SOME

STRENGTHENS AND WEAKNESSES AND

BOTH GIVE THE RESULTS PROBABLY

SAME , BUT ACCORDING TO LITERATURE

AOA IS THE BENEFICIAL FOR MODELING IT

WILL BE HELPFUL AND IN THE BUSINESS

FIELD IT WILL BE IMPORTANT AON WILL

BE LESS WIDELY USED , IN CASE OF

LARGE AND COMPLEX PROJECTS IT IS

EASIER TO EMPLOY THE PATH PROCESS

USED IN THE AOA

Source - Another student's paper

Q3(ANS) These both have some strengthens

and weaknesses and both give the results

probably same , but according to literature AOA

is the beneficial for modeling it will be helpful

and in the business field it will be important

AON will be less widely used , in case of large

and complex projects it is easier to employ the

path process used in the AOA

Suspected Entry: 100% match

Uploaded - PROJECT VI.docx

ACCORDING TO AOA WE ACHIEVE THE

EVERY MILESTONE AND PARTICULARLY

USED THE DUMMY PROJECTS OR

ACTIVITIES THE CONCEPT OF DUMMY

PROJECT IS NOT SIMPLE AND EASY IT

REQUIRE MORE TRAINING AND PRACTICE

Source - Another student's paper

according to AOA we achieve the every

milestone and particularly used the dummy

projects or activities the concept of dummy

project is not simple and easy it require more

training and practice

Suspected Entry: 100% match

Uploaded - PROJECT VI.docx

AON CONVENTION ,AOA NETWORK USED

BOTH NODES AND ARROW TO LABEL THE

PROJECT

Source - Another student's paper

AON Convention ,AOA network used both

nodes and arrow to label the project

Suspected Entry: 100% match

Uploaded - PROJECT VI.docx

DEVELOP A NETWORK ACTIVITY CHART,

AND IDENTIFY THE CRITICAL PATH FOR A

PROJECT BASED ON THE INFORMATION

PROVIDED IN THE GANTT CHART BELOW

Source - Another student's paper

Develop a network activity chart and identify the

critical path for a project based on the

information provided in the Gantt chart below

Suspected Entry: 100% match

Uploaded - PROJECT VI.docx

DRAW THE ACTIVITY NETWORK AS A

GANTT CHART

Source - Another student's paper

Draw the activity network as a Gantt chart

Suspected Entry: 100% match

Uploaded - PROJECT VI.docx

WHAT IS THE EXPECTED DURATION OF

THE PROJECT

Source - Another student's paper

What is the expected duration of the project

Suspected Entry: 100% match

Uploaded - PROJECT VI.docx

ACTIVITY EXPECTED DURATION

PREDECESSOR

Source - Another student's paper

Activity Expected Duration Predecessor

Suspected Entry: 100% match

Uploaded - PROJECT VI.docx Source - Another student's paper

A 5 DAYS ---- A 5 days ----

Suspected Entry: 99% match

Uploaded - PROJECT VI.docx

B 10 DAYS A

Source - Another student's paper

B 10 days A

Suspected Entry: 99% match

Uploaded - PROJECT VI.docx

C 8 DAYS A

Source - Another student's paper

C 8 days A

Suspected Entry: 100% match

Uploaded - PROJECT VI.docx

D 1 DAY A

Source - Another student's paper

D 1 day A

Suspected Entry: 100% match

Uploaded - PROJECT VI.docx

E 5 DAYS B, C

Source - Another student's paper

E 5 days B, C

Suspected Entry: 99% match

Uploaded - PROJECT VI.docx

F 10 DAYS D, E

Source - Another student's paper

F 10 days D, E

Suspected Entry: 99% match

Uploaded - PROJECT VI.docx

G 14 DAYS F

Source - Another student's paper

G 14 days F

Suspected Entry: 99% match

Uploaded - PROJECT VI.docx

H 3 DAYS G

Source - Another student's paper

H 3 days G

Suspected Entry: 100% match

Uploaded - PROJECT VI.docx

I 12 DAYS F

Source - Another student's paper

I 12 days F

Suspected Entry: 100% match

Uploaded - PROJECT VI.docx

J 6 DAYS H, I

Source - Another student's paper

j 6 days H, I

Suspected Entry: 100% match

Uploaded - PROJECT VI.docx

AN ACTIVITY PRECEDENCE DIAGRAM

Source - Another student's paper

· An activity precedence diagram

Suspected Entry: 99% match

Uploaded - PROJECT VI.docx

THE TOTAL PATHS CAN BE CALCULATED

THERE THE FIRST DIAGRAM CAN BE

DEFINED THE OVERALL PATHS WHICH

ARE GIVEN BELOW

Source - Another student's paper

The total paths can be calculated there the first

diagram can be defined the overall paths which

are given below

Suspected Entry: 100% match

Uploaded - PROJECT VI.docx

ABEFIJ=5+10+5+10+12+6=48

ABEFGHJ=5+10+5+10+14+3+6=53

Source - Another student's paper

ABEFIJ=5+10+5+10+12+6=48

ABEFGHJ=5+10+5+10+14+3+6=53

ACEFIJ=5+8+5+10+12+6=46

ACEFGHJ=5+10+5+10+14+3+6=51

ADFIJ=5+1+10+12+6=34

ADFGHJ=5+1+10+14+3+6=39

ACEFIJ=5+8+5+10+12+6=46

ACEFGHJ=5+10+5+10+14+3+6=51

ADFIJ=5+1+10+12+6=34

ADFGHJ=5+1+10+14+3+6=39

Suspected Entry: 99% match

Uploaded - PROJECT VI.docx

THE 2ND PATH CAN BE CONSTRUCTED

FOR THE CRITICAL PATH WHICH HAVE THE

LONGEST PATH DURATION

Source - Another student's paper

The 2nd path can be constructed for the critical

path which have the longest path duration

Suspected Entry: 99% match

Uploaded - PROJECT VI.docx

ABEFGHJ=5+10+5+10+14+3+6=53 ITS

KNOWN AS A CRITICAL PATH FOR THE

GIVEN ACTIVITY

Source - Another student's paper

ABEFGHJ=5+10+5+10+14+3+6=53 Its known

as a critical path for the given activity

Suspected Entry: 99% match

Uploaded - PROJECT VI.docx

PRECEDENCE DIAGRAM AND CRITICAL

PATH

Source - Another student's paper

Precedence diagram and critical path

Suspected Entry: 100% match

Uploaded - PROJECT VI.docx

END H J G F E B A A J H G E F I START D C

B J END START END END

Source - Another student's paper

end H j G F E B A A J H G E F I START D C B

J END START end END

Suspected Entry: 100% match

Uploaded - PROJECT VI.docx Source - Another student's paper

USING THE INFORMATION PROVIDED IN

THE GANTT CHART BELOW, CONSTRUCT

THE PROJECT ACTIVITY NETWORK USING

THE ACTIVITY-ON-NODE (AON)

METHODOLOGY, AND LABEL EACH NODE

Using the information provided in the Gantt

chart below, construct the project activity

network using the activity-on-node (AON)

methodology, and label each node

Suspected Entry: 100% match

Uploaded - PROJECT VI.docx

IDENTIFY THE CRITICAL PATH AND OTHER

PATHS THROUGH THE NETWORK

Source - Another student's paper

Identify the critical path and other paths through

the network

Suspected Entry: 100% match

Uploaded - PROJECT VI.docx

E, F, G

Source - Another student's paper

E, F, G

Suspected Entry: 100% match

Uploaded - PROJECT VI.docx

ACTIVITY DURATION ES EF LS

Source - Another student's paper

Activity Duration ES EF LS

Suspected Entry: 100% match

Uploaded - PROJECT VI.docx

A 3 0 3 0

Source - Another student's paper

A 3 0 3 0

Suspected Entry: 100% match

Uploaded - PROJECT VI.docx

B 5 3 8 8

Source - Another student's paper

B 5 3 8 8

Suspected Entry: 100% match

Uploaded - PROJECT VI.docx

C 7 3 10 3

Source - Another student's paper

C 7 3 10 3

Suspected Entry: 100% match

Uploaded - PROJECT VI.docx

D 3 10 13 13

Source - Another student's paper

D 3 10 13 13

Suspected Entry: 100% match

Uploaded - PROJECT VI.docx

E 5 8 13 13

Source - Another student's paper

E 5 8 13 13

Suspected Entry: 100% match

Uploaded - PROJECT VI.docx

F 4 13 17 13

Source - Another student's paper

F 4 13 17 13

Suspected Entry: 100% match

Uploaded - PROJECT VI.docx

G 2 10 12 15

Source - Another student's paper

G 2 10 12 15

Suspected Entry: 99% match

Uploaded - PROJECT VI.docx

H 5 17 22 17

Source - Another student's paper

H 5 17 22 17

Suspected Entry: 100% match

Uploaded - PROJECT VI.docx

1 PART 1

Source - Another student's paper

1 Part 1

Suspected Entry: 100% match

Uploaded - PROJECT VI.docx

0 3 0

Source - Another student's paper

0 3 0

Suspected Entry: 100% match

Uploaded - PROJECT VI.docx

8 5 13

Source - Another student's paper

8 5 13

Suspected Entry: 100% match

Uploaded - PROJECT VI.docx

3 5 17

Source - Another student's paper

3 5 17

Suspected Entry: 100% match

Uploaded - PROJECT VI.docx

13 3 13

Source - Another student's paper

13 3 13

Suspected Entry: 100% match

Uploaded - PROJECT VI.docx

17 5 22

Source - Another student's paper

17 5 22

Suspected Entry: 100% match

Uploaded - PROJECT VI.docx

13 4 17

Source - Another student's paper

13 4 17

Suspected Entry: 100% match

Uploaded - PROJECT VI.docx

3 7 10

Source - Another student's paper

3 7 10

Suspected Entry: 100% match

Uploaded - PROJECT VI.docx

15 2 17

Source - Another student's paper

15 2 17

Suspected Entry: 100% match

Uploaded - PROJECT VI.docx

ES ID EF

Source - Another student's paper

ES ID EF

Suspected Entry: 100% match

Uploaded - PROJECT VI.docx

LS DURATION LF

Source - Another student's paper

LS DURATION LF

Suspected Entry: 99% match

Uploaded - PROJECT VI.docx

THE CRITICAL PATH CAN BE CHOOSE

WHICH HAVE THE MINIMUM SLACK AND

THEN FIND THE DURATION OR DELAY OF

CRITICAL PATH FIRST OF ALL WE FIND

THE CRITICAL PATH OF GIVEN ACTIVITY

THE CRITICAL PATH HAVE MINIMUM

SLACK BUT DELAY SHOULD BE

MAXIMUM ,WHICH ARE GIVEN BELOW

Source - Another student's paper

The critical path can be choose which have the

minimum slack and then find the duration or

delay of critical path first of all we find the critical

path of given activity the critical path have

minimum slack but delay should be maximum,

which are given below

Suspected Entry: 100% match

Uploaded - PROJECT VI.docx

ACDFH=3+7+3+4+5=22DAYS/MIN WITH THE

CRITICAL POINT OF SLACK THE

FLEXIBILITY OF THE PROJECT IS LIMITED

Source - Another student's paper

ACDFH=3+7+3+4+5=22days/min With the

critical point of slack, the flexibility of the project

is limited