Find the earliest start, carliest finish, latest start and latest finish time using CPM method for all of the following activities and also show the critical path: Task Duration (days) Dependencies TI 10 T2 X+1 T1 T3 Y+1 T4 TI, T3 T5 Z+1 T4 T6 3 TN T7 4 T4, T6 Where, X = alphabetic order of the 1ª letter of your sur/last name Y= alphabetic order of the 2nd letter of your sur/last name Z = alphabetic order of the 3rd letter of your sur/last name N= ((X+1) % (Z+1)) +1 [% indicates modulus operator, example: (5%2)=1, (2%7)–2]. If the value of N >=6, then consider N = 5. N.B.: Make sure you write down your sure/last name at first and also the values of X, Y, Z and N. Then, write down the revised table according to those values. Finally, perform CPM analysis based on the revised table.
Find the earliest start, carliest finish, latest start and latest finish time using CPM method for all of the following activities and also show the critical path: Task Duration (days) Dependencies TI 10 T2 X+1 T1 T3 Y+1 T4 TI, T3 T5 Z+1 T4 T6 3 TN T7 4 T4, T6 Where, X = alphabetic order of the 1ª letter of your sur/last name Y= alphabetic order of the 2nd letter of your sur/last name Z = alphabetic order of the 3rd letter of your sur/last name N= ((X+1) % (Z+1)) +1 [% indicates modulus operator, example: (5%2)=1, (2%7)–2]. If the value of N >=6, then consider N = 5. N.B.: Make sure you write down your sure/last name at first and also the values of X, Y, Z and N. Then, write down the revised table according to those values. Finally, perform CPM analysis based on the revised table.
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
Related questions
Question
last name is sartaj
![4.
Find the earliest start, earliest finish, latest start and latest finish time using CPM method
for all of the following activities and also show the critical path:
Task
Duration (days) Dependencies
T1
10
T2
X+1
T1
T3
Y+1
T4
7
T1, T3
T5
Z+1
T4
T6
3
TN
T7
4
Т4, Т6
Where,
X = alphabetic order of the 1* letter of your sur/last name
Y = alphabetic order of the 2nd letter of your sur/last name
Z = alphabetic order of the 3rd letter of your sur/last name
N=((X+1) % (Z+1))+1 [% indicates modulus operator, example: (5%2)=1, (2%7)=2].
If the value of N>=6, then consider N = 5.
N.B.: Make sure you write down your sure/last name at first and also the values of X, Y,
Z and N. Then, write down the revised table according to those values. Finally, perform
CPM analysis based on the revised table.](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Fdf592b98-d6be-4c3e-bb47-a2d315dc7598%2F7fc468b5-d71c-431f-bcb8-f708d6056b5c%2Fd8zrhgk_processed.png&w=3840&q=75)
Transcribed Image Text:4.
Find the earliest start, earliest finish, latest start and latest finish time using CPM method
for all of the following activities and also show the critical path:
Task
Duration (days) Dependencies
T1
10
T2
X+1
T1
T3
Y+1
T4
7
T1, T3
T5
Z+1
T4
T6
3
TN
T7
4
Т4, Т6
Where,
X = alphabetic order of the 1* letter of your sur/last name
Y = alphabetic order of the 2nd letter of your sur/last name
Z = alphabetic order of the 3rd letter of your sur/last name
N=((X+1) % (Z+1))+1 [% indicates modulus operator, example: (5%2)=1, (2%7)=2].
If the value of N>=6, then consider N = 5.
N.B.: Make sure you write down your sure/last name at first and also the values of X, Y,
Z and N. Then, write down the revised table according to those values. Finally, perform
CPM analysis based on the revised table.
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 6 steps with 4 images
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY