AQA GCSE Computer Science 3.2 Python Arrays & Records Lesson

AQA GCSE 3.2 Python lesson on 1D and 2D lists and records, plus 10 Diamond Award programming challenges. Exam questions, quiz and full answers.

A complete lesson for AQA 8525 3.2.6 Data structures, sold with the matching Diamond Award challenge booklet.

The lesson (38 editable slides)

• 1D lists, indexing and negative indexing
• 2D lists and how to index them
• One slide for each list method: append, copy, count, extend, clear, index, insert, pop, remove, reverse, sort
• Records: AQA’s RECORD structure, records in Python, and lists of records
• Green, amber and red tasks, including a 2D trace task, with answers
• AQA pseudo-code: arrays
• AQA-style exam questions with a mark scheme
• Success Check quiz and a “Summarise in four steps” plenary
• Teacher notes on every slide

Diamond Award challenges (31 to 40)
Ten list programs, including the largest number without max(), removing duplicates, sorting names and counting words. Includes the answer booklet and the Diamond Award certificate.