| A | B |
|---|
| Data Abstraction | manage complexity in programs by giving a collection of data a name without referencing the specific details of the representation |
| Element | an individual value in a list that is assigned a unique index |
| Index | a common method for referencing the elements in a list or string using numbers |
| List | an ordered collection of elements |
| Infinite Loop | occurs when the ending condition will never evaluate to true |
| Iteration | a repetitive portion of an algorithm which repeats a specified number of times or until a given condition is met |
| Traversal | the process of accessing each item in a list one at a time |
| Loops Components | loop control variable, conditional, loop control variable modification |
| Argument | the value passed to the parameter |
| Parameter | a variable in a function definition. Used as a placeholder for values that will be passed through the function |
| Return | used to return the flow of control to the point where the procedure (also known as a function) was called and to return the value of expression |
| Procedural Abstraction | a process and allows a procedure to be used only knowing what it does, not how it does it. Procedural abstraction allows a solution to a large problem to be based on the solution of smaller subproblems. This is accomplished by creating procedures to solve each of the subproblems. |
| API | Application Program Interface - specifications for how functions in a library behave and can be used |
| Library | a group of functions (procedures) that may be used in creating new programs |
| Modularity | the subdivision of a computer program into separate subprograms |
