COMP 1500 - Introduction to Computer Science: What is an Algorithm & Computer History

0.0(0)
Studied by 0 people
call kaiCall Kai
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
GameKnowt Play
Card Sorting

1/15

flashcard set

Earn XP

Description and Tags

Vocabulary flashcards covering the formal and informal definitions of algorithms, Alan Turing's core building blocks, key algorithmic properties, and foundational historical milestones in computing.

16 Terms

1
New cards

Algorithm (Merriam-Webster Definition)

A step-by-step procedure for solving a problem or accomplishing some end.

2
New cards

Algorithm (Oxford English Dictionary Definition)

A process or set of rules to be followed in calculations or other problem-solving operations, especially by a computer.

3
New cards

Algorithm (Informal Definition)

An ordered sequence of instructions that is guaranteed to solve a specific problem.

4
New cards

Formal Definition of Algorithm

A well-ordered collection of unambiguous and effectively computable operations that, when executed, produces a result and halts in a finite amount of time.

5
New cards

Sequence (Algorithm Building Block)

One of Alan Turing's building blocks of algorithms; refers to specifying computational order (do this, then that).

6
New cards

Selection (Algorithm Building Block)

One of Alan Turing's building blocks of algorithms; refers to making decisions using conditional logic (if/else).

7
New cards

Iteration (Algorithm Building Block)

One of Alan Turing's building blocks of algorithms; refers to repeating tasks using loops.

8
New cards

Well-Ordered Collection

The algorithmic characteristic stating that steps must follow a clear order so that at any point, the executor always knows what step comes next.

9
New cards

Unambiguous Operation

The algorithmic requirement that each step must be precisely defined with no room for multiple interpretations.

10
New cards

Effectively Computable Operation

The algorithmic requirement that every step must be feasible with the given resources and something the executing machine can actually perform.

11
New cards

Produces a Result

The algorithmic characteristic requiring that execution must generate an output or solve the intended problem.

12
New cards

Halts in a Finite Amount of Time

The algorithmic requirement that execution must eventually stop rather than running indefinitely in an infinite loop.

13
New cards

Difference Engine

An early mechanical computing device designed by Charles Babbage to perform calculations.

14
New cards

Herman Hollerith's Punched Card Machines

Early mechanical data-processing machines used to process and tabulate the 1890 U.S. Census.

15
New cards

Giant Brains

A popular media term from the 1940s used to describe electronic computers like ENIAC because they processed information in ways that seemed human-like.

16
New cards

Early Electronic Computers

Machines such as ENIAC, Colossus, and UNIVAC that transformed the public concept of computing from calculators into general-purpose computers.