Computer Science Ch. 1, 2, 3, & 10

An ____ algorithm is called an exponential algorithm.

0 (2n)

Binary search does ____ comparisons in the worst case.

0 (lg n)

The first slide rule appeared around ____.

1622

The history of mathematics begins ____ years ago.

3,000 or more

FORTRAN and ____________________ were the dominant high-level languages of the 1960s and 1970s.

COBOL

The majority of business transactions, billions of them per day, are still done on ____________________ code that has now been updated and is likely to continue to run for the foreseeable future.

COBOL

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

Computing agent

What is HTML used for?

Creating HTML documents that become web pages when viewed through a browser.

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

ENIAC

____ is an example of a natural language.

English

(True or False): Writing all computer programs in the same programming language would be more efficient because all languages meet essentially the same needs.

False

____ was the first programmable device.

Jacquard's loom

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

Linguistic

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

Mathematical properties

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

Pascaline

0 (lg n), 0 (n) and 0 (n2) are ____ in the amount of work they do as n increases.

Polynomially bounded (also, increasing)

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

Primitive

____ is one of the most common applications of computers.

Searching a list

An algorithm can fall into an infinite loop when ____.

The continuation condition of the loop never becomes false

(True or False): C programs can make use of low-level information such as knowledge of where data are stored in memory. _________________________

True

The worst case in binary search occurs ____.

When the object to be searched (for) is not in the list

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.

algorithm

The study of the efficiency of algorithms is called the ____ of algorithms.

analysis

Problems for which no known polynomial solution algorithm exists are sometimes approached via ____ algorithms.

approximation

In a pretest loop, the continuation condition is tested at the ____ through the loop.

beginning of each pass

____ are useful for rating one machine against another and for rating how sensitive a particular algorithm is with respect to variations in input on one particular machine.

benchmarks

The ____ case of an algorithm requires the least work.

best

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

computer

____ statements are the "question-asking" operations of an algorithm

conditional

Together, conditional and iterative operations are called ____ operations.

control

To create a loop that executes exactly b times, we create a ____.

counter

The selection of an algorithm to solve a problem is greatly influenced by the way the input ____ for that problem are organized.

data

The ____ loop is an example of a posttest loop.

do/while

Part of the job of program ____ is to make clear any assumptions or restrictions about the input size the program was designed to handle.

documentation

___ is the algorithmic equivalence of style.

elegance

In the sequential search algorithm, the minimum amount of work is done if the value being searched for is the ____ value in the list.

first

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

fourth

____ operations provide the computing agent with data values from the outside world that it may then use in later instructions.

input

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

it does not halt in a finite amount of time

In the sequential search algorithm, the worst case occurs when the value being searched for is the ____ value in the list.

last

A(n) ____ is a collection of useful, prewritten algorithms.

library

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

logarithms

A ____ is the repetition of a block of instructions.

loop

"Print the value of product" is an example of a(n) ____ operation.

output

____ operations send results from the computing agent to the outside world.

output

In order to implement a "find" functionality in a word processor, one would have to design a ____ algorithm.

pattern matching

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

preform arithmetic operations

____ involves the fixing of errors that are uncovered through repeated usage with different input values.

program maintenance

The ____ sort algorithm performs the task of sorting a list by growing a sorted subsection of the list from the back to the front.

selection

A purely ____ algorithm is sometimes termed a straight-line algorithm.

sequential

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

sequential

The technique of looking at all the items in a list, starting at the beginning of the list, one at a time, until we either find what we are looking for or come to the end of the list is called ____ search.

sequential

Placing a list of items into alphabetical or numerical order is called ____.

sorting

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

stored program

A surprising number of problems fall into the "____" category.

suspected intractable

An algorithm is essentially useless when ____.

takes to long to execute

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

third

Viewing an operation at a high level of abstraction and fleshing out the details of its implementation at a later time is known as ____ design.

top-down

A(n) ____ is a named storage location that can hold a data value.

variable

In the line of code, "Set the value of Area to length*width", "Area" is a ____.

variable