TM111 Meeting 1: Algorithms, Flowcharts, and Pseudocodes

Comprehensive vocabulary flashcards covering the core concepts of algorithms, flowchart symbols and conventions, pseudocode design, control structures, and sentinel-controlled iteration from TM111 Meeting #1.

Algorithm

An ordered set of unambiguous steps that describes a process, which can be implemented in more than one programming language.

Unambiguous (Algorithm Characteristic)

The requirement that an algorithm must be clear, with each of its steps (or phases) and their inputs/outputs leading to only one meaning.

Finiteness

The characteristic requiring that an algorithm must terminate after a finite number of steps.

Feasibility

The characteristic specifying that an algorithm should be executable and achievable with the available resources.

Flowchart

A diagram made up of shapes connected by arrows that graphically depicts the logical steps to carry out a task and shows how the steps relate to each other.

Pseudocode

A tool that uses English-like phrases to outline a program and describe an algorithm generically without using any specific programming language syntax.

Flowline

An arrow symbol in a flowchart used to connect symbols and indicate the flow of logic.

Terminal Symbol

An oval or rounded rectangular flowchart symbol used to represent the beginning (Start) or the end (End) of a task.

Input/Output Symbol

A parallelogram flowchart symbol used for reading and displaying operations, inside of which the data to be read or displayed are described.

Processing Symbol

A rectangular flowchart symbol used for arithmetic and data-manipulation operations, containing instructions listed inside.

Decision Symbol

A diamond-shaped flowchart symbol used for logic or comparison operations that has one entry flowline and two exit paths depending on a "yes" or "no" answer.

Connector Symbol

A circular flowchart symbol used to join different flowlines, such as breaks across pages, bottom-to-top jumps, or upward flows exceeding 3 symbols.

Sequence Structure

A control structure where instructions are executed by following them from one line to the next without skipping lines, requiring no condition step.

Decision Structure

A selection structure in which a choice between two alternatives is made based on whether a given condition evaluates to true or false.

Iteration (Looping)

A structure where a program instruction or sequence of statements is repeated several times based on logical tests.

While Loop

A repetition control structure used to execute a statement or a block of statements repeatedly as long as a specified condition is true.

Sentinel Value

A special input value chosen so it cannot be confused with acceptable data, used to indicate the "end of data entry" or a "condition of termination".

Sentinel-Controlled Repetition

An indefinite repetition process where the total number of repetitions is not known before the loop starts executing, continuing until a sentinel value is entered.