Lecture 1 Ch 1

Vocabulary flashcards covering key computational concepts, algorithm characteristics, and problem-solving strategies from the introductory lectures.

Algorithm

A clear, precise, and executable step-by-step method to solve a problem that eventually stops and produces an output.

Halting Problem

A problem concerning whether a general algorithm exists to decide if a program will run forever or stop eventually.

Running Time

The amount of time required for an algorithm to produce an output, often evaluated in the worst case or on average relative to the input size.

Memory (Algorithm Performance)

The amount of memory consumed while running an algorithm to store data and variables.

Input

The data received by a computer or algorithm to perform computations on.

Output

The result reported by a computer or algorithm after executing computations.

Verification Task

A task where a candidate claim or answer is provided, and the algorithm evaluates whether to accept or reject it by outputting true or false.

Finding Task

A task where no candidate answer is provided, requiring the algorithm to directly compute and construct the result.

Roles

Placeholders or variables created in an algorithm script with specific purposes to store and track information during execution.

Current Maximum

A specific role created in an algorithm to track and store the largest value examined so far in a sequence.

Current Value

A specific role created in an algorithm to represent the sequence element currently being examined.

C#

The programming language used in this course to make programming principles precise.