Deck 1: An Introduction to Computer Science

Question 1

Hollerith's machines were one of the first examples of the use of automated information processing to solve large-scale, real-world problems.

Answer 1

True

Question 2

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

Answer 2

True

Question 3

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

Answer 3

False
- algorithm

Question 4

Computer science is the study of computers.

Question 5

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

Question 6

Wireless communications are a(n) ____________________-generation innovation in computing.

Question 7

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

Question 8

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 9

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

Question 10

Algorithms are exclusive to the field of computer science.

Question 11

Leibniz's ____________________ could carry out addition, subtraction, multiplication, and division.

Question 12

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

Question 13

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

Question 14

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 15

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

Question 16

All conceivable problems can be solved algorithmically.

Question 17

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

Question 18

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

Question 19

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

Question 20

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

Question 21

____ was the first programmable device.

A) A Leibniz Wheel
B) The Analytic Engine
C) The Pascaline
D) Jacquard's loom

Question 22

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 23

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 24

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 25

____ is one of the most common applications of computers.

A) Searching a list
B) Running a company
C) Writing a program
D) Generating a list of all the prime numbers

Question 26

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

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

Question 27

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

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

Question 28

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

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

Question 29

The history of mathematics begins ____ years ago.

A) 250
B) 1,000
C) 2,000
D) 3,000 or more

Question 30

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

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

Question 31

The first slide rule appeared around ____.

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

Question 32

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 33

An algorithm is essentially useless when ____.

A) it's difficult to read
B) it takes too long to execute
C) it takes too long to create
D) people might be offended by the results

Question 34

In Babbage's analytical engine, a mill was used to ____.

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

Question 35

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

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

Question 36

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 37

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

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

Question 38

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 39

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

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

Question 40

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

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

Question 41

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

Question 42

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

Question 43

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

Question 44

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

Question 45

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

Question 46

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

Question 47

What are embedded systems?

Question 48

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

Question 49

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

Question 50

Explain the significance of the Von Neumann architecture.