Deck 1: An Introduction to Computer Science

Question 1

All conceivable problems can be solved algorithmically.

Answer 1

False

Question 2

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

Answer 2

True

Question 3

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

Answer 3

False

Question 4

Mechanical devices for performing complex calculations existed prior to the 20th century.

Question 5

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

Question 6

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

Question 7

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

Question 8

Computer science is the study and use of computers and computer programs.

Question 9

The statement: "If the mixture is too dry, then add one-half cup of water to the bowl" is an example of a conditional operation.

Question 10

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

Question 11

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

Question 12

Algorithms are exclusive to the field of computer science.

Question 13

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

Question 14

Euclid's algorithm finds prime numbers between any two given numbers.

Question 15

All problems have algorithmic solutions, but some of the solutions are impractical.

Question 16

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

Question 17

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

Question 18

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

Question 19

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

Question 20

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.

Question 21

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

A) stored program
B) external program
C) programmable function
D) memory unit

Question 22

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

Question 23

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

A) primary
B) complementary
C) basic
D) primitive

Question 24

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.

A) sequence
B) computing agent
C) mechanical calculator
D) algorithm

Question 25

Wireless data communications are a fifth-generation innovation in computing.

Question 26

In 1614, John Napier invented ____ as a way to simplify difficult mathematical computations.

A) algorithms
B) logarithms
C) electronic computers
D) mechanical calculators

Question 27

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

A) EDVAC
B) EDSAC
C) ENIAC
D) Mark I

Question 28

____ was the first programmable device.

A) Leibnitz's Wheel
B) the Analytic Engine
C) the Pascaline
D) Jacquard's loom

Question 29

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

Question 30

Which of the following is an application of computers?

A) searching a list
B) running a company
C) writing programs
D) generating a list of all the prime numbers

Question 31

The first slide rule appeared around ____.

A) 1183
B) 1622
C) 1882
D) 1945

Question 32

FORTRAN and COBOL, the first high-level ("natural") programming languages, appeared during the ____ generation of computing.

A) first
B) second
C) third
D) fourth

Question 33

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

Question 34

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

A) mathematical properties
B) difficulty level
C) uniqueness
D) the time it takes to formulate them

Question 35

The operation "Replace i with i - 1" is a(n) ____ operation.

A) sequential
B) conditional
C) iterative
D) hierarchal

Question 36

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

A) sequential
B) conditional
C) hierarchal
D) iterative

Question 37

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

Question 38

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

A) programming language
B) compiler
C) linguistic
D) interpreter

Question 39

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

A) Mark I
B) Difference Engine
C) Analytic Engine
D) ENIAC

Question 40

The history of mathematics begins ____ years ago.

A) 250
B) 1,000
C) 3,000
D) 10,000

Question 41

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

A) it is too hard to read
B) it takes too long to solve
C) it takes too long to create
D) people might be offended by the results

Question 42

What is a computing agent?

A) something that carries out steps of the algorithm
B) a person who works with users and developers for improving software
C) a person that writes computer code
D) the hardware that powers the computer

Question 43

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

A) slide rules and logarithms
B) the concept of zero and the decimal based system
C) mechanical calculators and analytic machines
D) numerical methods for generating square roots

Question 44

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

A) it does not produce a result
B) it is ambiguous
C) it does not halt in a finite amount of time
D) it is not well-ordered

Question 45

Automation of mental tasks was part of a movement known as the ____ revolution.

A) industrial
B) technological
C) computer
D) designer

Question 46

Repetition is characteristic of ____ operations.

A) sequential
B) conditional
C) iterative
D) recursive

Question 47

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

A) Pascaline
B) Leibnitz's wheel
C) abacus
D) TI-85

Question 48

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

A) first
B) second
C) third
D) fourth

Question 49

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

A) first
B) second
C) third
D) fourth

Question 50

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

A) store memory
B) process instructions
C) perform arithmetic and logic
D) accept input