comparing the efficiency of the search and sort algorithms representing a game of snakes and ladders using a one-dimensional array to indicate the positions of snakes and ladders. 3.1.1, 3.2.2, Understand and Be able to decompose 3 hours Students should be taught 3.2.3, 3.2.10, explain the term problems into about why, when writing longer (which is not 3.2.11 decomposition. subroutines and call them programs, it is useful to required until later) and know why this is a decompose them, and the Describe the good idea. facilities in their programming structured approach language to do this. They should to programming. Be able to perform also cover the difference integer division, including between local and global the use of remainders. variables. At this stage,
comparing the efficiency of the search and sort algorithms representing a game of snakes and ladders using a one-dimensional array to indicate the positions of snakes and ladders. 3.1.1, 3.2.2, 3.2.3, 3.2.10, 3.2.11 Understand and explain the term decomposition. Describe the structured approach to programming. Be able to decompose problems into subroutines and call them and know why this is a good idea. Be able to perform integer division, including the use of remainders. 3 hours Students should be taught about why, when writing longer programs, it is useful to decompose them, and the facilities in their programming language to do this. They should also cover the difference between local and global variables. At this stage, (which is not required until later)
AQA-8520-SOW.DOCX