J277 Paper 2 - Key Vocabulary Flashcards

Front

Algorithm

Back

An abstract program that completes a given task, regardless of the data provided

Front

Search

Back

Searching involves looking through data and making comparisons with a search term until the algorithm either finds the data or determines that it is not present.

Front

Sort

Back

Putting given sets of data into a specified order – usually ascending (alphabetical) or descending (reverse alphabetical).

Front

Linear Search

Back

A type of search where the computer checks each variable, in order, until it finds the search term. It can be potentially very slow.

Front

Binary Search

Back

A search method based on repeatedly halving the searchable data until the search term is found.

Front

Bubble Sort

Back

A method of sorting data that examines pairs of variables and swaps them if they are out of order. This process continues until no more swaps are needed.

Front

Merge Sort

Back

Splits the data into increasingly small segments until single data points are reached, then reassembles the data structure one item at a time.

Front

Insertion Sort

Back

Checks through the data to find the first incorrectly placed item. The algorithm then checks all the previous positions to see where the item fits and inserts it in that place.

Front

Abstraction

Back

Abstraction involves moving a problem out of the specific context to create a general solution that works in similar scenarios. It means ignoring the gritty details to focus on the core problem.

Front

Decomposition

Back

Breaking a problem down into smaller, computationally solvable chunks.