Exam 7: Problem Solving and Algorithms

An array is a named collection of homogeneous items in which individual items are accessed by position.

Which of the following refers to the separation of the logical view of data from its implementation?

Which of the following best describes top-down design?

During top-down design, a concrete step is one that needs to be expanded further.

What is the first step in the "How to Solve It" list?

A(n) _________________ search looks for an item sorted list by eliminating large portions of the data on each comparison.

Which of the following allows a WHILE loop to be contained within the body of another WHILE loop?

In top-down design, the main module is the most abstract.

An algorithm is a calculation that determines how long it will take to solve a problem.

A(n) _______________ search examines each item in turn to find the item being sought.

A plan for solving a problem is not an algorithm if it requires infinite time or data.

An abstract step is one for which some details remain unspecified.

The general case of a recursive solution determines when the recursion stops.

A(n) _______________ is a set of instructions for solving a problem in a finite amount of time using a finite amount of data.

What is the practice of hiding the details of a module with the goal of controlling access to the details of the module?

After a program is in use, changes made to it to enhance functionality or fix errors is called _______________.

The first pass of the _______________ sort algorithm scans the list for the item that should be first in the list, then puts it there.

An array is a named homogeneous collection of items in which individual items are accessed by an index.

Infinite recursion occurs because there is no general case.

_______________ is the ability of a subprogram to call itself.