Python Resource Pack 5 is a set of coding challenges designed to support the teaching and learning of the Python programming language. This pack is designed for those who have some experience of programming in Python, such as completing the exercises in Resource Packs 1 - 4. It is suitable for teaching Python in schools from Year 8 onwards, tutors and learners in adult learning classes or for the hobbyist learning at home. The pack gives learners an opportunity to investigate how to write, append and read text files using Python. It consists of eight programming challenges, each of which introduces different elements of file handling. The pack is designed to support learning that has previously taken place in the classroom, via self-directed study, or by following tutorials. The pack contains: Eight pdf files each containing a file handling coding challenge. Working solutions to each of the eight programs. The challenges are designed so that self-directed research will be required to complete them; they are not a cut-and-paste tutorial.

Math Parser Virtual Machine supports learning how Reverse Polish Notation (RPN) is evaluated to produce answers. Using RPN files created using Math Parser Compiler Emulator (supplied) as input, Math Parser Virtual Machine shows how: The Stack is used in evaluation How the X Register in the CPU is used How the Y Register in the CPU is used How the Accumulator in the CPU is used How run-time errors are handled Fully supported by a comprehensive Help file, Math Parser Virtual Machine includes the algorithm used and explains all the technical terminology.

Data Sorts provides theory notes and interactive models of four common data sorting routines used in computing: the Bubble Sort, Insertion Sort, Merge Sort and Quicksort. The models include a delay feature so sorting occurs at a speed to suit the user, or, alternatively, instantaneously. In addition, the element of the Sort that is currently being processed is highlighted, making it easier to see what is going on and to relate it to the algorithm being used. There is an option to switch on a step-by-step explanation of how each algorithm is functioning. Speed Trials generates a large data set and then allows the user to sort that data using one of the sorting algorithms, timing how long it took. The data can then be returned to its original order, and one of the other sorts used, allowing comparisons to be drawn. Further sets of data can then be generated to substantiate results. Unlike the standalone models, Speed Trials is not deliberately slowed down and has all unnecessary formatting code removed to optimise performance and therefore provide true comparative data. Alongside the five interactive models are a set of theory notes describing each of the sort algorithms and designed to be read before interacting with the models and to reinforce learning as they are used. Data Sorts is supported by a comprehensive help file.

Data Structures provides interactive models and theory notes of four common data structures used in computing: the Stack, Circular Queue, Binary Search Tree and Linked List. Each is designed to prevent the user from performing illegal operations such as adding data to an already full structure and explains why such actions are being taken. The Binary Search Tree and Linked List models include a delay feature so that the Tree may be traversed, and the List read at a speed to suit the user, or, alternatively, instantaneously. In addition, the element of the Tree or List that is currently being accessed is highlighted, making it easier to see what is going on and to relate it to the algorithm being used. The Binary Search Tree includes removal of data from the tree, complete with a Structured English description and a Pseudocode algorithm in the theory notes of how it is accomplished. There is an option to switch on a step-by-step explanation of how data is entered into a Binary Search Tree and how the three traversal methods operate, and how data is inserted into, read from and removed from a Linked List. Alongside the four interactive models are a set of theory notes describing each of the data structures and designed to be read before interacting with the models and to reinforce learning as they are used. Data Structures is supported by a comprehensive help file.

Python Resource Pack 6 is a set of coding challenges designed to support the teaching and learning of the Python programming language. This pack is designed for those who have some experience of programming in Python, such as completing the exercises in Resource Packs 1 - 5. It is suitable for teaching Python in schools at GCSE, AS and A Level, for tutors and learners in adult learning classes or for the hobbyist learning at home. As part of the higher-level learning and exam preparation for which the pack is designed, emphasis is placed on the system life cycle and program documentation by requiring: Preparatory design before attempting to code the solution to the challenge. Full validation to prevent the wrong type of data or incorrect values from being entered. The use of meaningful names for variables, functions and procedures. Fully commenting code. Full testing (both unsuccessful and successful tests, together with any corrective actions) to be recorded as a part of the solution alongside the code. The pack is designed to support learning that has previously taken place in the classroom, via self-directed study, or by following tutorials. The pack contains eleven challenges, each consisting of: A pdf file with one or more coding challenges and, in some cases, supplementary extension work. Fully commented example solutions to the challenge or challenges and any extensions. The following topics are introduced: Writing recursive as opposed to iterative solutions. The global command to create static variables. The round command to round numbers to a given degree of accuracy. The use of end= in print commands. The % mathematical operator to perform modulo division. The** .append()** command with lists. The ** function for calculating exponents; The math module; The import math command. The math.degrees() command to convert from radians to degrees. The math.asin() command (the equivalent of sin-1) The math.pi() command representing π. The math.sin() command. The math.cos() command. The in command for checking if an item is in a list. The pass command in error trapping. The match… case command to make selections based on the value of a variable. The not in command to search for strings within strings. The use of constants and a constants file. The challenges are designed so that self-directed research will be required to complete them; they are not a cut-and-paste tutorial. The challenges: Calculate factorials. Includes extension work. Temperature scale converter. Fibonacci Sequence. Includes extension work. Perfect Numbers. Problems inspired by Isambard Kingdom Brunel. Platonic Solids. Happy Numbers. String interrogation. Includes extension work. Counting game. Includes extension work. Kaprekar and Harshad Numbers. Includes extension work. Thue-Morse Sequence. Palindromes. Number Base Converter.

Python Resource Pack 8 is a set of coding challenges designed to support the teaching and learning of the Python programming language. This pack is designed for those who have some experience of programming in Python, such as completing the exercises in Resource Packs 1 - 7. It is suitable for teaching Python in schools at AS and A Level, for tutors and learners in adult learning classes or for the hobbyist learning at home. As part of the higher-level learning and exam preparation for which the pack is designed, these challenges necessitate a greater degree of design and coding ability than the challenges in Resource Packs 6 and 7. Emphasis is placed on the system life cycle and program documentation by requiring: Full design prior to coding (system flowchart, program flowchart, pseudocode, data dictionary). Full validation so only valid data can be entered by the user. Meaningful names for variables, procedures and functions. Full error trapping. Fully commented code. Complete evidence of the program being tested during development (Alpha Testing or White Box Testing). Complete evidence of the program being tested post development (Beta Testing or Black Box Testing). The pack is designed to support learning that has previously taken place in the classroom, via self-directed study, or by following tutorials. The pack contains five challenges, each consisting of: A pdf file with one or more coding challenges and, in some cases, supplementary extension work. Fully commented example solutions to the challenge or challenges and any extensions. The following topics are introduced: The datetime module, and specifically date() and datetime() within it. The dateutil add-on module, and specifically relativedelta() within it. The challenges are designed so that self-directed research will be required to complete them; they are not a cut-and-paste tutorial.

Python Resource Pack 7 is a set of coding challenges designed to support the teaching and learning of the Python programming language. This pack is designed for those who have some experience of programming in Python, such as completing the exercises in Resource Packs 1 - 6. It is suitable for teaching Python in schools at AS and A Level, for tutors and learners in adult learning classes or for the hobbyist learning at home. As part of the higher-level learning and exam preparation for which the pack is designed, these challenges necessitate a greater degree of design and coding ability than the challenges in Resource Pack 6. Emphasis is placed on the system life cycle and program documentation by requiring: Preparatory design before attempting to code the solution to the challenge. Full validation to prevent the wrong type of data or incorrect values from being entered. The use of meaningful names for variables, functions and procedures. Fully commenting code. Full testing (both unsuccessful and successful tests, together with any corrective actions) to be recorded as a part of the solution alongside the code. The pack is designed to support learning that has previously taken place in the classroom, via self-directed study, or by following tutorials. The pack contains nine challenges, each consisting of: A pdf file with one or more coding challenges and, in some cases, supplementary extension work. Fully commented example solutions to the challenge or challenges and any extensions. The following topics are introduced: The // mathematical operator to perform integer division. The [:n] string operator to get the leftmost n characters of a string. The [-n:] string operator to get the rightmost n characters of a string. The re.sub regular expression function. The chr() and ord() commands to get a character from an ASCII value. The pow() command to calculate powers. The math.sqrt() command for calculating square roots. The challenges are designed so that self-directed research will be required to complete them; they are not a cut-and-paste tutorial.