Discrete Algorithmic Mathematics, Third Edition

| Meaning | Symbol or Example | Page first defined or used | ||
|---|---|---|---|---|
| A. | Abbreviations (alphabetized on the abbreviation) | |||
| Arithemtic-Mean/Geometric-Mean Inequality | AGI | 212 [14] | ||
| Breadth First Search | BFS | 298 | ||
| Computer Algebra System | CAS | xi | ||
| Constant coefficient homogeneous linear difference equation | CCHLDE | 435 | ||
| Constant coefficient linear difference equation | CCLDE | 435 | ||
| Conjunctive Normal Form | CNF | 662 [29] | ||
| Divide and Conquer | D&C | 462 | ||
| Directed acyclic graph | DAG | 716 [4] | ||
| Depth First Search | DFS | 298 | ||
| Disjunctive Normal Form | DNF | 652 | ||
| Fully Parenthesized Notation | FPN | 630 [20] | ||
| Input Specification | IS | 638 | ||
| Left-hand side | LHS | 138 | ||
| Output Specification | OS | 638 | ||
| Polish Prefix Notation | PPN | 319 [48] | ||
| Right-hand side | RHS | 138 | ||
| Reverse Polish Notation | RPN | 318 [47] | ||
| Straightline Towers of Hanoi | STOH | 166 [5] | ||
| Towers of Hanoi | TOH | 99 | ||
| Traveling Salesman Problem | TSP | 323 | ||
| Well-formed formula | wff | 625 | ||
| B. | Algorithms | |||
| Main features of notation: | ||||
| Except for procedures and functions | Section 1.2, pp. 88 90 | |||
| Procedures and functions | Section 1.4, pp. 105 112 | |||
| Notation specific to algorithms: | ||||
| Comments (flush right) | [ k is a counter] | 74 | ||
| Assignment | ? | 74 | ||
| Interchange | ? | 113 [7] | ||
| References to algorithms | ||||
| Algorithm sometimes followed by a number and then by the algorithm name | Algorithm 1.1 POWERA | 74 | ||
| Just the name of the algorithm in large and small capitals |