Exam 1: An Introduction to Computer Science

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.

The ____ was the first fully electronic general-purpose programmable computer.

The operation "Print x if n = 0; print n if n ¹ 0" is a(n) ____ operation.

Which of the following is an application of computers?

Leibnitz's Wheel could carry out addition, subtraction, multiplication, and division.

Charles Babbage gave up on his second Difference engine because the current technology could not support his project.

All conceivable problems can be solved algorithmically.

Hollerith's major contribution was increasing the scale of information processing.

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

The first accurate definition of computer science described it as a study of algorithms.

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

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

Learning about an algorithm's ____ is an important component of the study of algorithms.

For an operation to be part of a proper algorithm it must be effectively computable.

Aside from being unsolvable, why might an algorithm be useless?

Implementing algorithms on computers can increase production by taking over repetitive physical tasks.

In 1946, John Von Neumann proposed a radically different computer design based on a model called the ____ computer.

The five generations of modern computers are distinguished mainly by fundamental changes in the underlying computer architecture.

The ____ was the first computing device to use the base-2 binary numbering system.

Computer science work was carried out even before the electronic computer was invented.