A procedure primarily supports
Algorithms. Best move: Abstraction and reuse
Procedures package behavior behind a reusable name and parameters.
Use a short diagnostic to expose the first decision that needs repair.
Answer from your current habits. The feedback points to a stronger exam-preparation move.
Algorithms. Best move: Abstraction and reuse
Procedures package behavior behind a reusable name and parameters.
Data. Best move: Perfect reconstruction
Lossless schemes preserve all original information.
Networks. Best move: Redundant routes
Packets can take alternate routes when components fail.
The published format is 70 questions on end-of-course multiple choice and Program plus written responses on Create Performance Task. End-of-course multiple choice - About 1.7 minutes each. Code-tracing items are slower, so bank time on the vocabulary and impact items. Create Performance Task - Done during the year, not on exam day. Start it early enough to record the video and write the responses without rushing.
This course publishes no percentage weightings, so practise by course priority: Create-task evidence capture; List and procedure requirements; Algorithm tracing. Then mix those with the units you have not touched in a fortnight.
Only where the exam allows one, and practising otherwise builds the wrong habit. End-of-course multiple choice: Binary, compression ratios, and speedup are all small mental arithmetic. Provided during the exam: The pseudocode language is given to you. It is not Python or JavaScript, and reading it as if it were is a common way to lose easy points. Create Performance Task: Built during the course on a computer, submitted before exam day, and scored separately.
The Create task needs a student-developed procedure with a parameter that actually changes what the procedure does. A parameter that is never used, or a procedure that ignores it, fails that row of the rubric.