Code Pseudocode

1:59 Topic 1 OUTPUT and sequence Cambridge exams write algorithms in pseudocode — not Python, not Java. It is a real notation with real k… 1:56 Topic 2 Variables and DECLARE Pseudocode has no computer to run it, so every rule about storing a value exists to be read by a person.… 1:50 Topic 3 INPUT and data types Everything the user types arrives as text, including the numbers. That single fact is behind most lost m… 2:05 Topic 4 Arithmetic, DIV and MOD Plus, minus, times and slash behave exactly as you would expect, and there is nothing to memorise about … 2:04 Topic 5 Selection: IF Selection is the second control structure, and it is one test with exactly two exits. If the test is tru… 1:59 Topic 6 Selection: CASE When one variable is checked against several fixed values, a stack of IFs gets long. CASE says the same … 2:08 Topic 7 Iteration: FOR Iteration is the third control structure, and a FOR loop is the version you use when you already know ho… 2:11 Topic 8 Iteration: WHILE and REPEAT When you do not know how many repeats you need, the test moves into the loop itself. In a WHILE loop the… 2:07 Topic 9 String handling Three of the string functions have nothing to trip on. LENGTH gives how many characters are in a string … 2:05 Topic 10 1-D arrays Cambridge writes a declaration in one line, and every part of that line is worth a mark. An array stores… 2:14 Topic 11 2-D arrays One index finds a value in a row. A seating plan needs you to say which row first. A 2-D array is a grid… 2:10 Topic 12 Procedures A long algorithm written as one block is hard to mark and harder to read, and the exam rewards splitting… 2:06 Topic 13 Functions A procedure does something. Sooner or later you need one that comes back with an answer. A function work… 2:03 Topic 14 Putting it together Cambridge names four standard methods — totalling, counting, linear search, and finding the maximum or m…