IB CS Topic 4.2

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.

• Collection

• Variable

• String

• Array

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

• Sequential Search

• Binary Search

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.

• Bubble Sort

• Selection Sort

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

• Flow chart

• Pseudocode

• Big O Notation

• Collection

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

• Effeciency

• Correctness

• Reliability

• Flexibility

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

• Abstraction

• Correctness

• Flexibility

• Reliability

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

• Exception

• Flag

• Problem