IGCSE English as a second language - ESL worksheet by TreeOfKnowledge - Free Printable

It looks like you've uploaded a text-based image containing two problems related to task scheduling and project management, but the image itself isn't visible in this interface. However, I can help you solve the problems based on the text you provided.

Let me break down and solve both problems step by step.

---

Problem 1: Task-Order Summary

Task:
"Create a task-order summary for these computer features. There are [7] tasks. For each one, list the name, duration, resource, required, dependency, cost, milestone, and status."

We are given a table with 7 tasks, but only the names of the tasks are listed:

| Task Name |
|------------------|
| Design |
| Budget |
| Programming |
| Install system |
| Test |
| Train |
| Deploy |

We need to fill in the following attributes for each task:
- Duration
- Resource
- Required
- Dependency
- Cost
- Milestone
- Status

Since no specific details were provided (e.g., durations, resources, costs), we’ll make reasonable assumptions based on standard project management practices for a software development or computer system implementation project.

---

#### ✔ Solved Table: Task-Order Summary

| Task Name | Duration | Resource | Required | Dependency | Cost | Milestone | Status |
|------------------|----------|------------------|--------------|--------------------|------------|------------------|------------|
| Design | 2 weeks | Project Manager, UI/UX Designer | Yes | None | $10,000 | Concept Approved | In Progress |
| Budget | 1 week | Finance Team | Yes | None | $500 | Budget Finalized | Completed |
| Programming | 6 weeks | Developers | Yes | Design | $40,000 | Code Complete | In Progress |
| Install system | 1 week | IT Staff | Yes | Programming | $3,000 | System Installed | Not Started |
| Test | 2 weeks | QA Team | Yes | Install system | $8,000 | Testing Complete | Not Started |
| Train | 1 week | Trainer | No | Test | $2,000 | Training Done | Not Started |
| Deploy | 1 day | IT Staff | Yes | Train | $1,000 | Go-Live | Not Started |

---

#### 🔍 Explanation:

- Dependencies: Tasks must be completed in logical order.
- Design must come before Programming.
- Programming before Installation.
- And so on.
- Resources: Based on typical roles involved in software projects.
- Costs: Estimated based on average labor rates and materials.
- Milestones: Key points in the project lifecycle.
- Status: Assumed "In Progress" for early tasks; others pending.

> Note: This is a plausible example since the original problem didn’t provide data. In real scenarios, this would be filled from project documentation.

---

Problem 2: Network Diagram & Critical Path

Task:
"Draw the operations of the network graph. Then, using the [CPM] method, find the critical path."

We’re given a table of activities with their predecessors:

| Predecessor | Operation | Duration | Preceding |
|-------------|-----------|----------|-----------|
| None | A | 2 | – |
| A | B | 4 | A |
| B | C | 3 | B |
| C | D | 1 | C |
| A | E | 3 | A |
| E | F | 2 | E |
| F | G | 1 | F |
| D, G | H | 2 | D, G |

We need to:
1. Draw the network diagram (nodes and arrows).
2. Use Critical Path Method (CPM) to find the critical path and project duration.

---

#### Step 1: Construct the Network Diagram

We’ll use Activity-on-Node (AON) format.

- Start with A (no predecessor).
- From A → B and E.
- B → C → D → H
- E → F → G → H
- H is the final activity.

So the paths are:

1. A → B → C → D → H
2. A → E → F → G → H

---

#### Step 2: Calculate Early Start (ES), Early Finish (EF), Late Start (LS), Late Finish (LF)

We compute forward pass (ES/EF) and backward pass (LS/LF).

| Activity | Duration | ES | EF | LS | LF | Slack |
|---------|----------|----|----|----|----|-------|
| A | 2 | 0 | 2 | 0 | 2 | 0 |
| B | 4 | 2 | 6 | 2 | 6 | 0 |
| C | 3 | 6 | 9 | 6 | 9 | 0 |
| D | 1 | 9 | 10 | 9 | 10 | 0 |
| E | 3 | 2 | 5 | 4 | 7 | 2 |
| F | 2 | 5 | 7 | 7 | 9 | 2 |
| G | 1 | 7 | 8 | 9 | 10 | 2 |
| H | 2 | 10 | 12 | 10 | 12 | 0 |

---

#### Step 3: Identify Critical Path

Critical path = Activities with zero slack.

- A → B → C → D → H
Duration = 2 + 4 + 3 + 1 + 2 = 12 weeks

Other path:
- A → E → F → G → H = 2 + 3 + 2 + 1 + 2 = 10 weeks (not critical)

✔ Critical Path: A → B → C → D → H
✔ Project Duration: 12 weeks

---

✔ Final Answer:

#### Problem 1: Task-Order Summary
(As shown in the table above — filled with reasonable assumptions.)

#### Problem 2: Network Diagram & Critical Path
- Critical Path: A → B → C → D → H
- Total Project Duration: 12 weeks

---

If you'd like, I can generate a visual representation of the network diagram (as ASCII art or describe it clearly). Let me know!