IB Computer Science Topic 4.2 - Connecting Computational Thinking and Program Design

Definition

Term

Stores a value that can be changed during execution. Has a name/identifier.

Can hold multiple data elements of only same type (String, int, boolean, etc.) or objects. Has a name, size cannot be changed during execution. Can be one-dimensional/linear or two-dimensional.

Useful for storing different properties of entity, e.g. Student names and equivalent grades

Simplest search algorithm. Looks through every index in array for search value.

Unlike above, requires sorted array. Eliminates upper or lower half of array every iteration until search value is found.

Very slow sorting algorithm that compares two adjacent elements in array, swapping them if not in correct (ascending or descending) order. Stops when no swaps were required.

Very simple sorting algorithm, where largest or smallest element of array is swapped with leftmost unsorted element.

Like resizable array, and may hold elements of different data types. Operations include: addItem(), getNext(), hasNext()

Visual representation of algorithm

Algorithm whose syntax is not as strict as computer languages. Cannot be understood by computers.

Amount of computer resources such as CPU and memory required to perform functions.

Extent to which algorithm satisfies expectations and all objectives from design and implementation phase, and is free from faults

Capability of algorithm to maintain predefined level of performance and perform all required functions under stated conditions, having long mean time between failures.

Effort required to modify algorithm for purposes other than what it was originally developed for.

Measure of efficiency of algorithm. Represented as O(n), where n is number of times algorithm is executed.

Indicates condition. Its value is changed when condition changed. Usually boolean variable. For example, can be used to end a loop.