OCR Computer Science Paper 2
Decomposition - ANS Breaking a complex problem down into smaller problems and solving each one
individually.
Bit rate = sampling frequency X sample size. - ANS The formula to find out the number of bits per second
used in audio recording.
Abstraction - ANS Picking out the important information from the problem and ignoring details that
don't matter.
Compression - ANS A way of making files smaller while staying as true to the original as possible.
Algorithm - ANS A set of instructions for solving a problem.
Lossy Compression - ANS A way of reducing file size that permanently removes data from the file.
Pseudocode - ANS A way of setting out an algorithm that reads like a programming language without
too much emphasis on syntax.
Lossless Compression - ANS A way of reducing file size that temporarily removes data from the file.
Start/Stop - ANS Flow chart: A box with rounded corners.
Function - ANS A set of instructions stored under one name that returns a value.
Inputs/Outputs - ANS Flow chart: A parallelogram box.
, Parameter - ANS Variables that are used to pass values into a sub program.
Processes - ANS Flow chart: A rectangular box.
Argument - ANS A value that is passed into a sub program.
Decisions - ANS Flow chart: A diamond box.
Local Variable - ANS A variable that only exists within the structure it's declared in.
Sub Routines - ANS Flow chart: A rectangular box with lines either side of it.
Global Variable - ANS A variable that exists within all structures in a program.
Binary Search - ANS On an ordered list, compare the middle item with the search value then discard the
half of the list that is too big/small. Repeat.
Input Sanitisation - ANS Removing any unwanted characters before passing data through the program.
Linear Search - ANS On an unordered list, search each item in turn.
Input Validation - ANS Checking if data meets certain criteria before passing it into the program.
Bubble Sort - ANS Move through a list, swapping any items in the wrong order. Repeat, not including the
last item in the list each time, until the list is sorted.
Decomposition - ANS Breaking a complex problem down into smaller problems and solving each one
individually.
Bit rate = sampling frequency X sample size. - ANS The formula to find out the number of bits per second
used in audio recording.
Abstraction - ANS Picking out the important information from the problem and ignoring details that
don't matter.
Compression - ANS A way of making files smaller while staying as true to the original as possible.
Algorithm - ANS A set of instructions for solving a problem.
Lossy Compression - ANS A way of reducing file size that permanently removes data from the file.
Pseudocode - ANS A way of setting out an algorithm that reads like a programming language without
too much emphasis on syntax.
Lossless Compression - ANS A way of reducing file size that temporarily removes data from the file.
Start/Stop - ANS Flow chart: A box with rounded corners.
Function - ANS A set of instructions stored under one name that returns a value.
Inputs/Outputs - ANS Flow chart: A parallelogram box.
, Parameter - ANS Variables that are used to pass values into a sub program.
Processes - ANS Flow chart: A rectangular box.
Argument - ANS A value that is passed into a sub program.
Decisions - ANS Flow chart: A diamond box.
Local Variable - ANS A variable that only exists within the structure it's declared in.
Sub Routines - ANS Flow chart: A rectangular box with lines either side of it.
Global Variable - ANS A variable that exists within all structures in a program.
Binary Search - ANS On an ordered list, compare the middle item with the search value then discard the
half of the list that is too big/small. Repeat.
Input Sanitisation - ANS Removing any unwanted characters before passing data through the program.
Linear Search - ANS On an unordered list, search each item in turn.
Input Validation - ANS Checking if data meets certain criteria before passing it into the program.
Bubble Sort - ANS Move through a list, swapping any items in the wrong order. Repeat, not including the
last item in the list each time, until the list is sorted.