Deck 1: An Introduction to Computer Science

Question 1

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

Answer 1

True

Question 2

Algorithms are exclusive to the field of computer science.

Answer 2

False

Question 3

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

Answer 3

True

Question 4

The statement "If the mixture is too dry, then add one-half cup of water to the bowl" is an example of a(n)iterative operation. _________________________

Question 5

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

Question 6

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

Question 7

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

Question 8

The Analytical Engine was the first computing device to use the base-2 binary numbering system. _________________________

Question 9

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

Question 10

One of the most fundamentally important virtues of a(n)____________________ is that if we can specify one to solve a problem, then we can automate the solution.

Question 11

According to Norman Gibbs's and Allen Tucker's definition of computer science, the central concept in computer science is the compiler . _________________________

Question 12

Computer science is the study of how to write computer programs.

Question 13

All conceivable problems can be solved algorithmically.

Question 14

At its most basic level, computer science is the study of algorithms.

Question 15

FORTRAN and COBOL, the first high-level (English-like)programming languages, appeared during the first generation of computing. _________________________

Question 16

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

Question 17

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

Question 18

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

Question 19

The Pascaline and Leibnitz's Wheel are examples of early computers.

Question 20

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

Question 21

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

A)Pascaline
B)Leibniz Wheel
C)Abacus
D)TI-85

Question 22

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

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

Question 23

An algorithm may be too ____ to be of any use.

A)difficult to read
B)inefficient
C)difficult to create
D)offensive

Question 24

Jacquard's Loom was considered the first "computing device" because it was ____ and had memory where information was stored in a machine-readable form.

A)compact
B)electric
C)mathematically efficient
D)programmable

Question 25

The history of ____ begins 3,000 years ago.

A)computer science
B)logarithms
C)the Pascaline
D)mathematics

Question 26

______ operations are the "looping" instructions of an algorithm.

A)Sequential
B)Looping
C)Iterative
D)Hierarchal

Question 27

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.

A)binary values
B)external displays
C)vacuum tubes
D)data cylinders

Question 28

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

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

Question 29

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

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

Question 30

The ____ revolution enabled us to implement algorithms that automated the drudgery of repetitive mental tasks.

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

Question 31

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

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

Question 32

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

A)computing agent
B)algorithmic agent
C)computing representative
D)algorithmic representative

Question 33

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

A)RAM
B)processor
C)logic unit
D)input/output

Question 34

In computer science, it is not simply the construction of a high-quality __________ that is important but also the methods it embodies.

A)processor
B)program
C)memory module
D)storage device

Question 35

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

A)theoretical
B)scientific
C)practical
D)logical

Question 36

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 37

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

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

Question 38

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

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

Question 39

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.

A)sequential
B)computing agent
C)mechanical calculator
D)well-ordered

Question 40

The first slide rule appeared around ____.

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

Question 41

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

Question 42

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

Question 43

List at least six of the recent developments of the fifth generation of computing.

Question 44

Define each of the categories to which the operations used to construct algorithms belong. Provide two to three examples within each category.

Question 45

Explain the achievement of the Difference Engine of Charles Babbage, and explain the challenge he faced in trying to construct the larger model.

Question 46

Explain the term "unambiguous operation."

Question 47

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

Question 48

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

Question 49

Explain the significance of the Von Neumann architecture.

Question 50

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