Deck 7: Problem Solving and Algorithms

Question 1

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

A) Establish the players
B) Understand the problem
C) Refine the problem
D) Gather resources
E) Set a timeline

Answer 1

B

Question 2

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

A) Information hiding
B) Abstraction
C) Data abstraction
D) Procedural abstraction
E) Control abstraction

Answer 2

A

Question 3

Which of the following is the ability for a subprogram to call itself?

A) Argument
B) Parameter
C) Recursion
D) Nested logic
E) Information hiding

Answer 3

C

Question 4

Which of the following eliminates a large portion of the data with each comparison?

A) Selection sort
B) Quicksort
C) Bubble sort
D) Binary search
E) Sequential search

Question 5

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

Question 6

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

Question 7

The approach to problem solving developed by George Polya is valuable, but does not apply to computer-based solutions.

Question 8

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

Question 9

When a named code finishes executing as part of a statement in a program and processing resumes with the statement just below where the name occurred, the place where the name of the code appears is known as the receiving unit.

Question 10

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

Question 11

During top-down design, a(n) _______________ step is one that is sufficiently detailed and needs no further expansion.

Question 12

A(n) _______________ is an instruction that determines the order in which other instructions in a program are executed.

Question 13

A(n) _______________ is the mechanism by which a value is passed into a subprogram.

Question 14

_______________ is the ability of a subprogram to call itself.

Question 15

In terms of problem solving, what are three questions that you might ask if you task is to send flowers to your mother?

Question 16

Are the following directions for shampooing hair a good example of an algorithm? Explain.
Rinse hair
Put shampoo on hair
Lather
Repeat

Question 17

What is a homogeneous structure?

Question 18

Name the four steps in Polya's "How to Solve It" list.

Question 19

Who wrote the book How to Solve It, which outlines a general approach to problem solving?

A) Ada Lovelace
B) Steve Jobs
C) John Vincent Atanasoff
D) George Polya
E) George Boole

Question 20

Which of the following includes selection statements and repetition statements?

A) Control structures
B) Operand specifier
C) Data type
D) Boolean expression
E) Information hiding

Question 21

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

A) Procedural abstraction
B) Control abstraction
C) Data abstraction
D) Control structure
E) Abstract step

Question 22

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

A) Subprogram
B) Clear-box testing
C) Recursion
D) Nested logic
E) Identifiers

Question 23

Which of the following uses a "divide and conquer" approach?

A) Selection sort
B) Insertion sort
C) Bubble sort
D) Binary search
E) Sequential search

Question 24

A record is a named heterogeneous collection of items in which individual items are accessed by position.

Question 25

Letters within quotations are called strings.

Question 26

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

Question 27

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

Question 28

Infinite recursion occurs because there is no general case.

Question 29

An IF statement is an example of a control structure.

Question 30

An algorithm is only useful if it uses a finite amount of time and data.

Question 31

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

Question 32

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

Question 33

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

Question 34

Which of the following best describes top-down design?

A) Gathering small solutions to related subproblems into a complete solution
B) Refining a particular solution into one that is more abstract
C) Decomposing a general solution into more concrete solutions to subproblems
D) Converting modules into subproblems
E) Converting classes into objects

Question 35

Which of the following requires the use of a "splitting value"?

A) Selection sort
B) Quicksort
C) Bubble sort
D) Binary search
E) Sequential search

Question 36

Which of the following allows information to be passed into a subprogram?

A) Record
B) Argument
C) Recursion
D) Nested logic
E) Black-box testing

Question 37

Quicksort is an effective algorithmic sorting approach to use if the data to be sorted is already in random order.

Question 38

Recursion is the ability of a subprogram to call itself.

Question 39

A record is a named heterogeneous collection of items in which individual items are accessed by name.

Question 40

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

Question 41

A concrete step is one that does not need to be expanded further.

Question 42

Algorithms cannot be tested until they are realized in a computer-based programming language.

Question 43

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

Question 44

_______________ is the separation of the logical view of an action from its implementation.

Question 45

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

Question 46

The two basic forms of subprograms that exist are void subprograms, named code that that does a particular task, and ____________________ subprograms, named code that also does a task but returns a single value to the calling unit.

Question 47

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

Question 48

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