Computational Thinking and Algorithms Practice Flashcards

Vocabulary terms and definitions from the lecture notes covering computational thinking, algorithm design, symbols, errors, and searching/sorting algorithms.

Decomposition

The process of breaking down a problem into smaller, more manageable sub-problems that each accomplish a specific task.

Abstraction

The process of removing unnecessary details to focus on the essential parts of a problem.

Algorithmic Thinking

The ability to create a clear set of instructions (algorithms) to find the solution to a problem.

Pattern Recognition

The process of identifying similarities or recurring features in problems and solutions.

Inputs

What data the algorithm receives.

Processing

How the data is transformed or calculated during the algorithm.

Outputs

The result or outcome produced by the algorithm, often presented to the user.

Trace Tables

A tool used to track the value of variables and how they change as the algorithm runs step by step to identify logical errors.

Pseudo-code

A simplified, informal way of describing an algorithm that is closer to human language than programming code, but structured like code.

OCR Exam Reference Language

The specific pseudo-code format used if asked to write pseudo-code in an exam.

Flowcharts

Diagrams that use symbols and shapes to represent the steps and decision-making processes of an algorithm.

Line (Flowchart)

Used to connect flowchart symbols and determine the flow of the algorithm.

Input / Output (Flowchart)

Represented by a parallelogram; used when data is entered or printed out.

Process (Flowchart)

Represented by a rectangle; shows an operation being performed, such as a calculation.

Decision (Flowchart)

Represented by a diamond; used when a yes/no or True/False question is asked, leading to different paths.

Sub-program (Flowchart)

Represented by a rectangle with two vertical lines; refers to a predefined procedure or function.

Terminal (Flowchart)

Represented by an oval; used at the beginning and end (Start / Stop) of a flowchart.

Syntax Error

An error that breaks the rules of the language (e.g., a missing colon in Python) and prevents the code from running.

Logic Error

An error where the code runs but produces the wrong result, such as using $+$ instead of $\times$.

Searching Algorithms

Step-by-step methods used to find a specific value (target) in a list of data.

Linear Search

A searching algorithm that checks each item one by one from the start until the target is found or the end of the list is reached.

Binary Search

A divide and conquer searching algorithm for sorted lists that repeatedly divides the list in half and compares the middle element to the target.

0-indexed

A numbering system where the first item in a list or array is at index $0$, the second is at index $1$, and so on.

Sorting Algorithms

Methods used to arrange data, usually numbers or strings, into a specific order such as ascending or descending.

Bubble Sort

A sorting algorithm that repeatedly compares adjacent items and swaps them if they are in the wrong order until no more swaps are needed.

Merge Sort

A divide and conquer sorting algorithm that continuously splits a list in half until each sublist has one item, then merges them back together in order.

Insertion Sort

A sorting algorithm that starts at the second item and inserts each subsequent item into its correct position relative to the items on its left.