Exam 1: An Introduction to Computer Science

The evolution of computer science began before the development of the first computer system.

The first electronic programmable computer, ENIAC, was completed just after World War II.

What were the marks of the user-friendly systems that emerged in the fourth generation of computers?

Designing programming languages and translating algorithms into these languages is known as ____ realization.

In 1672, a French philosopher and mathematician designed and built one of the first mechanical calculators named the ____ that could do addition and subtraction.

The first slide rule appeared around ____.

In Babbage's Analytical Engine, a mill was most like the ____ of modern-day computers.

An algorithm is a ____ collection of unambiguous and effectively computable operations that, when executed, produces a result and halts in a finite amount of time.

Unlike the _______________, Leibniz's Wheel could carry out addition, subtraction, multiplication, and division.

Explain the term "unambiguous operation."

Algorithms are exclusive to the field of computer science.

The three types of operations used to construct algorithms are sequential, ___________________, and iterative.

Discuss the four basic components that Babbage's Analytical Engine possessed that equate it to a modern-day computer.

Ultra-large-scale integrated circuits are ____________________-generation innovation in computing.

Briefly respond to the observation that every problem can be solved algorithmically, and discuss the implications of your response.

When an operation is unambiguous, we call it a primitive operation, or simply a primitive of the computing agent carrying out the algorithm.

John Von Neumann's stored program computer lay the groundwork for modern-day computing by allowing the computer to store instructions in ____ alongside the data.

Integrated circuits, built on silicon chips, were introduced during the ____ generation of computing.

What is wrong with the following algorithm? 1.  Set X to be 1 2.  Increment X 3.  Print X 4.  If X > 0, repeat from 2

In computer science terminology, the machine, robot, person, or thing carrying out the steps of the algorithm is called a(n)____.