GCSE Computer Science: Programming Theory

GCSE Computer Science: Programming Theory

1. Algorithms

   • A series of steps to solve a problem or carry out a task
   • Square = calculation/assignment
   • Trapezium = input/output
   • Diamond = Decision

2. Pseudocode

   • Structured English for describing algorithms
   • Allows the designer to focus on the logic of the algorithm without being distracted by the syntax of the programming language
   • E.g. Answer - USERINPUT or Input(Answer) Output "Hello" or Print("Hello") Add 1 to X or X = X + 1

3. Three basic ways of controlling order which the program statements are carried out

   • Sequence - Lines of Code
   • Selection (IF statements - choice)
   • Iteration (Loops - repeat things)