Exam 1: An Introduction to Computer Science

The discovery by Gödel places a limit on the capabilities of computers and computer scientists. _________________________

During the ____ generation of computing, the desktop machine shrunk to the size of a typewriter.

____ was the first programmable device.

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

Algorithms usually contain a set of instructions to be executed in any order.

Explain the meaning and significance of the term "effectively computable."

All conceivable problems can be solved algorithmically.

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

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

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

In theoretical computer science, researchers study the logical and ____ of problems and their solutions.

The first electronic programmable computer, ENIAC, was built during World War I.

An operation that is unambiguous is called a ____ operation of the computing agent carrying out the algorithm.

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

Respond to the observation that computer science is the study of how to write computer programs. Include an example to illustrate your argument.

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

List at least six of the recent developments in computer systems.

What was the major change brought about by the second generation of computing?

A(n) ____ instruction carries out a single well-defined task.

The first slide rule appeared around ____.