• argument: the value that is passed into the function as a parameter
  • memory: aka RAM (Random Access Memory)
  • performance overhead: The additional time or computational resources required to perform a task beyond its intrinsic functionality
  • data structure: How data is stored in the computer. E.g. variable, array, stack etc.
  • call: Calling a function or procedure causes the code inside the function or procedure to be executed
  • function: A block of code which can be run at any time when it is called
  • Parameter: A parameter is a special instruction or piece of information you give to a function or a command to tell it exactly what it should work on.
  • Factorial: n! = 1 x 2 x 3 x 4 x … x (n-1) x n

It’s more usual to start with n and work downwards

0! = 1

  • stack overflow: A stack has run out of space and can’t store any more
  • iteration: Repeating bocks of code with a loop (for or while)
  • Pseudocode: Pseudocode is like a draft of a program, written in simple, everyday language that outlines the main ideas and steps, but doesn’t have to follow strict coding rules.
  • concatenate: join together strings (using +)
  • boolean: Can be either True or False
  • Attribute: A data member or variable associated with a class or object, representing the state or characteristics of that class or object in object-oriented programming.
  • variable: a named storage location in memory used to store data that can change during program execution
  • constant: a named storage location in memory used to store data that cannot be changed during program execution
  • recursion: A process where a function calls itself
  • Nesting: Nesting code is putting one block of code inside another block of code of the seme type. E.g. putting a loop within a loop or an if statement within an if statement
  • Declaring a variable: Declaring a variable is creating the variable and saving space in memory for the variable’s value to be stored
  • append: adds to the end