M110: Python Programming - Algorithms, Flowcharts & Pseudocodes Overview

These flashcards cover key vocabulary related to algorithms, flowcharts, and pseudocode as discussed in the M110 Python Programming lecture.

Algorithm

An ordered set of unambiguous steps that describes a process.

Flowchart

A diagram made up of shapes connected by arrows that depicts the logical steps to carry out a task.

Pseudocode

A method to outline a program using English-like phrases without specific programming language syntax.

Characteristics of an Algorithm

An algorithm should be unambiguous, have well-defined inputs and outputs, finite, feasible, and independent of programming code.

Finite

The property of an algorithm to terminate after a finite number of steps.

Input

The information needed to solve a problem in an algorithm.

Output

The result produced by an algorithm.

Decision Structure

A case in an algorithm where a choice between two or more alternatives is made based on a condition.

Looping

The process of repeatedly executing a series of instructions until a condition is met.

Sentinel-Controlled Repetition

A type of loop that continues until a specific sentinel value is encountered indicating termination.

Flowchart Symbols

Symbols used in flowcharts represent steps like processing, input/output, decision-making, terminals, and connectors.

Repetition Structure

Any program instruction that repeats some statement or sequence of statements several times.