| Binary |
A basee two numbering system |
| Variable |
data that is assigned to and held within a chosen name |
| Loop |
a system where a segment of code is repeated until a requirement is met |
| Procedure |
a named group of instructions that have paramaters and return values |
| Parameters |
input values of a procedure |
| Arguments |
specify values of the paramaters when the procedure is called |
| Modularity |
An splitting large procedures into smaller ones with more uses |
| Procedural Abstraction |
name for a process that allow a procedure to be used by only knowing what it does |
| Return |
sends the output of the procedure to where it was called |
| Problem |
a general description of a task that can or cannot be solved algorithmically |
| Decision Problem |
A problem with a yes or no answer |
| Organization Problem |
a problem with a goal of finding the best answer |
| Instance |
a problem with a specific input |
| Efficiency |
amount of computing needed to solve a problem |
| Polynomial Efficiency (Good) |
more work takes a proportional amount of time (1 job is +2 time) |
| Exponential Efficiency (Bad) |
more work takes an exponential amount more time (1 job is 2x time) |
| Heuristic Approach |
When optimal solutions are inefficient, look for a possibly optimal solution that is more efficient |
| Decidable Problem |
A decision problem that has a clear solution that will always make a correct output |
| Undecidable Problem |
A decision problem with no solution that is not gaurenteed to produce the correct output |
| Search |
An algorithm that attempts to locate a value in a list |
| Library |
A downloadable package of functions that can be used |