Terms in this set (31)
The ability to solve problems, logically.
Breaking down a problem into smaller parts, making the problem easier to tackle.
Looking for similarities and trends within a problem. Using your prior experience to solve a problem.
Focusing on the important elements of a problem, ignoring any unnecessary details.
The creation of a step-by-step set of instructions to solve a problem.
A method of presenting an algorithm in a written language that closely resembles program code.
A set of step-by-step instructions to complete a given problem.
A storage location within a computer programme. For example, the value 100 can be assigned to the variable score as shown with the following pseudocode: score100
An indicator that a user will be inputting some information into the program.
An indicator that information will be outputted onto the screen.
Process / Task
Represents an operation to be carried out.
A set of instructions or tasks in order, meaning that each action follows a previous action.
Involves a comparison of information. A decision has one input and two possible outputs based on the outcome of the comparison: TRUE or FALSE.
Iteration / looping
Involves the repetition of a sequence of instructions until a certain condition is met.
Linear Search Algorithm
An algorithm that searches for data within an array in sequence. Every item is checked and if a match is found, the item is returned, otherwise the search continues until the end of the array. Can be used on unsorted data. Very effective for smaller arrays, inefficient for searching large arrays.
Binary Search Algorithm
A binary search algorithm works by repeatedly dividing the searched interval, beginning with the whole array. This method is a very effective method of searching a large array of data, but the data must be sorted into order (largest to smallest or vice versa).
Merge Sort Algorithm
This is a recursive algorithm that splits an array in half until you get to each individual item. The array can then be sorted through a merge which is the process of taking two smaller sorted arrays and combining them into a single, sorted array.
Bubble Sort Algorithm
Sorts data into either ascending or descending order. Compares two items at a time and swaps them round if they are not in the required order. The next pair is then compared. When all data in the array has been compared, this is known as a pass and will then return to the start of the array to compare data again. This process is repeated until all values are in the correct order.
The forms in which data can be stored.
A whole number.
A number that contains decimal places.
A logic system which uses the operators AND, OR and NOT. Data is either TRUE or FALSE.
A single character which can be a letter, number or symbol.
Usually written as a sequence of characters enclosed in single or double quotation marks, E.g. 'hello' or "hello".
A subroutine is a self-contained sequence of program instructions that perform a specific task. It can be repeatedly called upon and used within a program.
A procedure is a type of subroutine that performs a specific sequence of commands.
A function n is a type of subroutine which performs a specific sequence of commands which return a value.
A parameter allows information or instructions to be passed into a subroutine. The values within parameters are called arguments.
Local variables are declared within a subroutine. They can only be used within that subroutine.
Global variables are those declared outside of a subroutine and can be used within any subroutine within the program.
A subroutine defined within another subroutine.
YOU MIGHT ALSO LIKE...
Year 9 Computing Keywords
Term 5 Computing EOY Revision