Chapter Seven - Problem Solving and Algorithms

Question 1

nested structure (nested logic)

Answer 1

• structures in which ONE CONTROL STRUCTURE is EMBEDDED within another CONTROL STRUCTURE; (e.g. while(true) if(value>0))

Question 2

abstract step?

Answer 2

• algorithmic step for which some DETAILS remain UNSPECIFIED

Question 3

concrete step?

Answer 3

• step for which the details are FULLY SPECIFIED

Question 4

binary search?

Answer 4

• looking for an item in an ALREADY SORTED list by ELIMINATING LARGE PORTIONS of the data on each comparison.

Question 5

recursion?

Answer 5

• ability of an algorithm to RECALL ITSELF

Question 6

information hiding?

Answer 6

• makes DETAILS at a LOWER LEVEL INACCESSIBLE during the design of higher levels

Question 7

abstraction

Answer 7

• model of a complex system that includes only the DETAILS ESSENTIAL to the VIEWER (dog example with owner, trainer, and vet)

Question 8

data abstraction

Answer 8

• separation of the LOGICAL view of data from its IMPLEMENTATION. e.g. banks computer represents number in twos complements but this distinction is of no important to you as long as your bank statements are accurate.

Question 9

procedural abstraction

Answer 9

• separating the logical view of an ACTION from its implementation e.g. giving a name to a subprogram

Question 10

control abstraction

Answer 10

• separation of the logical view of a CONTROL STRUCTURE from its implementation

Question 11

control structure

Answer 11

• statement used to ALTER the normally SEQUENTIAL FLOW of CONTROL e.g. WHILE and IF