Algorithm Design and Problem-Solving | CS PPT +Worksheets +Activity + Mcq Quiz

Algorithm Design and Problem-Solving | CS PPT +Worksheets +Activity + Mcq Quiz + Marking Scheme

1. Lecture PPT

(12 slides, deep navy/mint theme)
Title → Learning Objectives → Abstraction theory → Worked abstract model (library system) → Decomposition theory → Worked decomposition (Online Quiz System hierarchy chart) → Pseudocode basics (identifiers, IPO, all 5 constructs) → Worked pseudocode program → Structured English & Flowchart → Pseudocode conversion → Stepwise Refinement (4-level walkthrough) → Practice Questions → Summary

1. Worksheet (60 marks across 4 sections)

Section A: Abstraction — define, KEEP/REMOVE table (10 rows), build an abstract model, real-world examples (14 marks)
Section B: Decomposition — define, build a 3-module hierarchy chart, know when to stop, compare with abstraction (14 marks)
Section C: Pseudocode — identifier validity, write all 5 constructs, structured English → pseudocode, flowchart → pseudocode (20 marks)
Section D: Stepwise Refinement — 3-level refinement of a product price problem (12 marks)

1. Class Activity

Escape the Algorithm"
4 real-world scenarios (ATM, Exam Scheduler, Food Delivery, Self-Checkout) with 4 timed stages: Abstraction table → Decomposition hierarchy → Stepwise refinement + full pseudocode → Team presentation + class debate. Includes peer assessment grid.

1. MCQ Quiz

(25 questions, 30 mins)
5 colour-coded sections: Abstraction (Q1–6), Decomposition (Q7–12), Pseudocode Constructs (Q13–19), Flowcharts & Structured English (Q20–22), Stepwise Refinement (Q23–25)

1. Answers & Marking Scheme

(Teacher Copy)
Full model answers for every worksheet question with per-mark tick points, “do not accept” guidance, examiner notes, model pseudocode solutions in code blocks, MCQ answer key table, and grade boundary bands for both assessments.