Week 1 Flashcards
A well-ordered collection of unambiguous and effectively computable operations that, when executed, produces a result and halts in a finite amount of time.
Algorithm
The study of algorithms, including their mathematical properties, hardware, and linguistic realizations, and their applications
Computer Science
Algorithmic structure that carries out a single task and then moves on to the next operation in a sequence
Sequential Operations
Algorithmic operation that asks a question and selects the next step to carry out based on the answer to that question.
Conditional Operation
Algorithmic operation that repeats a block of instructions
Iterative operations
The entity that executes the steps of an algorithm
Computing Agent
An operation is ____________ if it can be understood by the computing agent without having to be further defined or simplified
Unambiguous operation
An operation that can be directly understood by the computing agent executing the algorithm and which does not have to be further clarified or explained
Primitive
There exists a method for actually carrying out the intent of the operation
Effectively Computable
The repetitive execution of a block of operations that will never end. This is a fatal error when it occurs in an algorithm
Infinite Loop
People who fear and are opposed to the use of new technologies
Luddites
A machine designed by Charles Babbage in the 1830s. Many consider it to be the first computer, although he never completed it.
Analytical Engine
The first fully electronic general-purpose programmable computer, completed in 1946; it contained 18,000 vacuum tubes and nearly filled a building.
ENIAC
A model of computation in which the instructions to be executed are represented as binary string and stored in the memory of the computer.
stored program computer
The computational model designed by John _________ and first implemented in the EDSAC computer of 1947; the structure and organization of virtually all modern computers.
Von Neumann Architecture
