Chapter 6, Problem 9QQ

How to solved below problem based on software engineer knowledge? See the explanation of the planning case as below, when should this project start? Identify the Critical Path of planning this project. Is it possible to reduce the number of people dedicated to the project? "Software developers have identified the work breakdown structure (WBS) as shown in the table. The company applies the Modified Water Fall approach at WBS Level 1 (x.) and Level 2 (x.x), while the iteration approach at a lower level is planned to be handed over to the customer on 17 August 2023. Note that the effective time for one day is 8 (eight) hours, and working days in a week are 5 (five) days. Specifically to support this project, there are 2 Business Analysts (part timer), 2 Senior Programmers (full timer), 4 Junior Programmers (full timer), and two Testers (full timer)". Please add other assumptions if necessary.   No. Work Breakdown Structure Estimated man hour 1. Requirements Definition 2…

A project has three sequences of activities (paths), two of which are critical.  The critical paths of this project can be characterized in the following way: a. The slack times for each task in the entire project are zero. b. The chain of activities (from start to finish) that has the largest sum of activity durations. c. The early start date and early finish date are always the same for each activity on the critical path. d. To reduce the project duration, you must reduce the slack time of a task on the critical path. e. None of the above are correct.

Given that there are FIVE (5) processes (A, B, C, D and E) and FOUR (4) resources (R1, R2,R3 and R4) involved in a project. Assume that all the resources are non-sharable and the number of instances for each resource is 2, 3, 2, 3 respectively. *Process A holds one instance of R1, R2 and R4. It requests one instance of R3.* Process B holds one instance of R1 and R3. It requests one instance of R4.* Process C holds one instance of R2 and R4.* Process D holds one instance of R2 and R4. It requests one instance of R1.* Process E holds one instance of R3. It requests one instance of R2. (i) Draw a directed resources allocation graph for the above scenario and Are these five processes in a deadlock state? Justify your answer.