Exam 1: An Introduction to Computer Science

Indian mathematicians made important discoveries that contributed to the foundations of computer science. What were the discoveries?

John Von Neumann created the modern computer architecture when he developed a computer that stored its program in its own memory.

Babbage's analytical engine used a mill. What was its function?

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

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

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

Computer science is the study of the uses and applications of computers and software.

An algorithm that contains an infinite loop cannot be a correct solution to a problem.

What is a computing agent?

The first slide rule appeared around ____.

If you can specify an algorithm to solve a problem you can automate its solution.

Whether or not an operation is a primitive depends, in part, on the computing agent that is expected to execute it.

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

Repetition is characteristic of ____ operations.

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

____ was the first programmable device.

One of the most fundamentally important virtues of an algorithm is that if we can specify an algorithm to solve a problem, then we can automate the solution.

The history of mathematics begins ____ years ago.

Algorithms are exclusive to the field of computer science.

The ____, invented in 1672 by a French philosopher, was a mechanical calculator that could do addition and subtraction.