Term
|
Definition
| Is an ordered sequence of instructions that is guaranteed to solve a specific problem. |
|
|
Term
|
Definition
| Proposed by Charles Babbage, it was amazingly similar to the design of the modern computer. The design included 4 major components that function identically to the 4 major components of modern computers. Many people consider this to be the “true” first computer system. |
|
|
Term
|
Definition
The study of algorithms, including
Their formal and mathematical properties
Their hardware realizations
Their linguistic realizations
Their applications |
|
|
Term
|
Definition
| The machine, robot, person, or thing carrying out the steps of the algorithm |
|
|
Term
|
Definition
| These are the “question-asking” instructions of an algorithm. They ask a question, and the next operation is selected on the basis of the answer to that question. |
|
|
Term
|
Definition
| Created in 1823 by Charles Babbage, a professor at Cambridge University. The difference Engine can perform addition, subtraction, multiplication, and division to 6 significant digits, and it could solve polynomial equations and other complex mathematical problems as well. Babbage would then go on to extend the capabilities of this machine. |
|
|
Term
|
Definition
| There exists a computational process that allows the computing agent to complete that operation successfully. This is informally known as “Doable”. |
|
|
Term
|
Definition
| (Electronic Numerical Integrator and Calculator), it was created to solve the issue of slow producing fire tables during WWII. It was completed in 1946 (too late to assist in the war effort). It is considered one of the first fully electronic general-purpose programmable computers. |
|
|
Term
| High level programming language |
|
Definition
| A programming language with many commands and features designed to make common tasks easier to program. Any high level functionality is encapsulated as combinations of low level commands. |
|
|
Term
|
Definition
| An algorithm that makes no provision to terminate, and runs on forever. This is a common error in the design of algorithms. |
|
|
Term
|
Definition
| These are the “looping” instructions of an algorithm. They tell us not to go on to the next instruction but, instead, to go back and repeat the execution of a previous block of instructions. |
|
|
Term
|
Definition
| An individual who is against technological change. Any of a group of British workers who between 1811 and 1816 rioted and destroyed laborsaving textile machinery in the belief that such machinery would diminish employment. |
|
|
Term
|
Definition
| sometimes called a personal computer; used at home or at the office by one person; can fit on top of or under a desk |
|
|
Term
|
Definition
| When an operation is unambiguous, we call it a primitive operation, or simply a primitive of the computing agent carrying our algorithm. An algorithm must be composed entirely of primitives. |
|
|
Term
|
Definition
| A sequential instruction carries out a single well-defined task. When that task is finished, the algorithm moves on to the next operation. Sequential operations are usually expressed as simple declarative sentences. |
|
|
Term
|
Definition
| Created by John Von Neumann in 1946. Before this machine, computers were programmed externally using wires, connectors, and plugboards. The memory unit stored only data, not instructions. That the instructions that control the operation of the computer be encoded as binary values and stored internally in the memory unit along with the data. Then to solve a problem you would have to rewrite the instructions- that is, create a new program. Von Neumann invented programming as it is known today. |
|
|
Term
|
Definition
| Is one that can be understood and carried out directly by the computing agent without further simplification or explanation. |
|
|
Term
|
Definition
| The apparent machine that the operating system presents to the user, achieved by hiding the complexities of the hardware behind layers of operating system software. |
|
|
Term
|
Definition
| The important features found on all modern computing systems. |
|
|
