Understand computational thinking through abstraction, decomposition, patterns and algorithms
Key knowledgeUnderstand computational thinking through abstraction, decomposition, patterns and algorithms.
Build the idea
Investigate P′=0.2P(1−P/1000), P(0)=100, with the exact benchmark P(t)=1000/[1+9e(−0.2t)]. A numerical table, symbolic derivative and graph answer different questions. Keep step size, initial values and domain constraints visible. The listed checkpoints support verification of your implementation and are not a claim about an unseen software run.
Try the sample task
Implement Euler’s method with h=1 from t=0 to t=2. Identify abstraction, decomposition, the repeated pattern and the algorithm. Give the expected rows.
The full worksheet includes the worked solution and remaining task set.
What this activity covers
Follow the workflow in a suitable tool and record your own inputs and outputs. These are expected checkpoints, not evidence of a completed student technology run. Other representations and contexts need further practice.