+
Related Flashcards
Related Topics
Cards In This Set
| Front | Back |
|
Algorithm
|
Unambiguous instructions for solving a problem or subproblem in a finite amount of time using a finite amount of data.
|
|
Nested structure
|
A structure in which one control structure is embedded in another.
|
|
Abstract step
|
An algorithm step for which some details remain unspecified.
|
|
Concrete step
|
A step for which the details are fully specified.
|
|
Binary search
|
Looking for an item in an already sorted list by eliminating large fortions of the data on each comparison. eliminates half the array with each comparison.
|
|
Recursion
|
The ability of an algorithm to call itself.
|
|
Information hiding
|
The practice of holding the details of a module with the goal of controlling access to the details of the module.
|
|
Abstraction
|
A model of a complex system that includes only thew details essential to the viewer.
|
|
Data abstraction
|
The seperation of a logical view of data from its implementation.
|
|
Procedural abstraction
|
The separation of a logical view of an action from its implementation.
|
|
Control abstraction
|
The separation of the logical view of a control structure from its implementation.
|
|
Control structure
|
A statement used to alter the normally sequential flow of control.
|
|
Polyas problem solving steps.
|
1. Understanding the problem2. Devise a plan3. Carry out the plan4. Looking back
|
