The collection of all statements that can be successfully parsed is called the ___ defined by a grammar.

Language

is a rapidly growing area of computer and biological science research in which computers and graphics
software are used to produce highly accurate two- and three-dimensional images of the human body.

Medical imaging

A database management system can relate information between various tables through ____ values.

key

In assembly language, the programmer must take a microscopic view of a task, breaking it down into
tiny subtasks at the level of what is going on in individual ____.

memory locations

The ___ problem-solving cycle involves inputting code to an assembler, translating it to machine
language, loading it into a Von Neumann computer, and executing to produce answers to the problem

algorithmic

The worst case in binary search occurs ____.

when the object to be searched is not in the list

When an operation is unambiguous, we call it a primitive operation, or simply a primitive of the

computing agent carrying out the algorithm.

True

The total number of ____ per second is called hertz.

cycles

An ethical dialectic usually has a clean stopping point.

false
A(n) _____, also called an expert system, attempts to mimic the human ability to engage pertinent facts
and string them together in a logical fashion to reach some conclusion.

rule-based system

The ____ holds the address of the next instruction to be executed.

program counter

____ is the term for the separation of a service from the entity (or entities) providing that service.

Virtualization

A modem modulates a standard analog signal called a ____ wave so that it encodes binary information.

carrier

Registers can be accessed much more quickly than random access memory.

true

Much of the processing in the business world concerns updating "transaction files" with changes from
"master files."

false

To reduce the chance that two passwords will have the same hash value, a timestamp can be appended
to a password, and the result is then run through the encryption algorithm and stored as the encrypted
password in the password file.

true

With a suitable parallel processor, a search for the largest of 1,000,000 numbers requires (2*lgN), or
____ steps.

40
is the ability to write highly optimized programs that contain no wasted time or unnecessary memory
cells.

Efficiency

Computational tasks are tasks for which accurate answers need not be found.

false

A random integer V that takes on one of the values 1, 2, 3, .... , 100, with equal likelihood is called a
_____.

uniform random number

is a design approach that says only when we think we have created the best design possible would we
actually build it.

Computational steering

A(n) ____ is an algorithmic operation that carries out a single numeric computation and stores the
result.

computation

The set of services and resources created by the system software and seen by the user is called a(n)
____ machine.

virtual

The philosopher ____ was known to say "never treat a fellow human merely as a means to an end."

kant

In 1965, Digital Equipment Corp. (DEC) rolled out the _______, the world's first "minicomputer."

PDP-8

The SQL command to create a table only requires specification of the various attributes by name and
data type.
false

____ is the process of translating the detailed designs into computer code.

coding

We assumed that there was a Turing machine that could solve the halting problem, and this assumption
led to a(n) ____.

impossible situation

Each time a Turing machine operation is done, three actions take place.

true

The most common public-key encryption algorithm is ____.

RSA

Once an algorithm is formally specified, the ____ carries out the steps of the algorithm.

computing agent

In ____ computing, miniature computers are embedded into our cars, cameras, kitchen appliances,
home heating systems, clothing, and even our bodies.

ubiquitous

Which of the following operation categories provide the "looping" instructions of an algorithm?

conditional

means that we know which operation to do first and precisely which operation to do next as each step
in an algorithm is completed.

ordering
According to the definition of computer science proposed by Norman Gibbs and Allen Tucker, the
central concept in computer science is the ____.

algorithm

Computer science is the study of all of the following EXCEPT ____.

the formal iterations of algorithms

Hollerith's card machines solved what real-world problem in the late 19th century?

enumerating the 1890 U.S. Census

The fourth generation of computing saw the appearance of the first ____.

microcomputer

A(n) ____ operation is one that can be understood and carried out directly by the computing agent
without further simplification

unambiguous

was the first fully electronic general-purpose programmable computer.

ENIAC

The ____ developed numerical methods for generating square roots, multiplication tables, and
trigonometric tables used by early sailors.

Egyptians

The first generation of computers used ____ for processing and storage.

vacuum tubes

When an algorithm contains no provision to terminate, this is known as a(n) ____.

infinite loop
Computer scientists are exclusively responsible for all of the following EXCEPT ____.

using software packages

Specifying a(n) ____ solution to a problem allows us to take advantage of the speed and power of a
computer system to automate the solution.

algorithmic

The ____ computing device had a memory capacity of 72 numbers and could be programmed to
perform a 23-digit multiplication in just 4 seconds.

Mark I

means there exists a computational process that allows the computing agent to complete that operation
successfully.

Effectively computable

Which of the following operation categories provide the "looping" instructions of an algorithm?

iterative

Which of the following did not appear during the second generation of computing?

integrated circuits

The first computer actually sold was called the ____.

UNIVAC I