Algorithms - 7th Grade Computer Science

Vocabulary flashcards reviewing core algorithm concepts, key historical figures, building blocks, characteristics, properties, and comparison with pseudocode and programs based on 7th-grade lecture notes.

Algorithm

A step-by-step set of instructions designed to solve a problem or accomplish a task.

Al-Khwārizmī

A Muslim mathematician and astronomer who introduced Hindu-Arabic numerals and algebra to European mathematicians, and whose Latinized name ('algoritmi') is the origin of the word 'algorithm'.

Alan Turing

An English mathematician and logician (1912–1954) who provided the formal definition of algorithms in the context of computing.

Automation

A benefit of algorithms that allows computers and machines to perform tasks without human help.

Three Building Blocks of Algorithms

The core structures of any algorithm: Sequence, Selection, and Loop (Iteration).

Sequencing

The process of carrying out instructions step by step in a specific, correct order.

Selection

The process of making a decision in an algorithm based on a condition, choosing between two or more paths depending on whether the condition is true or false.

Iteration

The process of repeating a set of instructions until a condition is met or for a specific number of times.

Language Independent

A characteristic of algorithms meaning that their core logic works regardless of the programming language used to implement them.

Finiteness

The property or characteristic requiring that an algorithm must end after a limited number of steps rather than running infinitely.

Deterministic

A property of an algorithm ensuring that given the exact same input, it will always follow the same steps and yield the exact same output.

Pseudocode

A way of expressing an algorithm using plain English mixed with programming-like structures to plan and understand logic before writing code.

Program

A set of instructions written in a programming language following strict syntax rules that a computer can run.

Input (Algorithm Stage)

Data entered into the computer system for the algorithm to use at the beginning of execution.

Processing (Algorithm Stage)

The logical steps or calculations performed by the computer on the input data.

Output (Algorithm Stage)

The result produced after the algorithm finishes processing.

Termination (Algorithm Stage)

The point where the algorithm stops after completing its task.

Clarity

An advantage of algorithms where complex problems are broken down into simple, understandable steps.

Feasible

A characteristic of algorithms stating that all steps must be practical and possible to execute with available resources.

Effectiveness

A characteristic ensuring each step of an algorithm is simple, meaningful, and contributes toward solving the problem.