Advanced Software Design Techniques |
Contents
General Design Techniques | 13 |
Linear Linked Lists | 31 |
Binary Trees | 43 |
Copyright | |
9 other sections not shown
Other editions - View all
Common terms and phrases
A(MAX A(MID A(TOP Advanced Software Design AMTNP Answers to Exercises Appendix arithmetic expression array available nodes Backtracking Binary minus binary tree black box C₁ candidate square chapter cond control structures CROCOL CURP data structure data units deleted DELVAL DISK DISK(SP,TOP(SP doubly linked list Dynamic Programming eight queens problem elements Empty Empty END OF SUBROUTINE END-OF-FILE example executed FNOD GOTO Head node illustrative program infix notation INLVL input INTEGER invariant invocation iteration knight's tour left subtree LEVEL LINK(PRED LLINK LLINK(ROOT loop body loop invariant MAXVAL MCOST nonrecursive NPER Operand OUTPUT OVFLO Parsing partition value permutation PNOD problem pseudo-code RADER recursive algorithms repeat-block representation RETURN END reverse Polish notation right subtree RLINK RLINK(AVAIL ROOT RVAL sequence shown in Figure Software Design Techniques SROOT Step SUBROUTINE BUILD SUBROUTINE EXTEND SUCC SWAP TOKEN TOP(SP unary unary operator variables WMN(M WST(W