What people are saying - Write a review
We haven't found any reviews in the usual places.
Fundamental Design Techniques
General Design Techniques
Linear Linked Lists
9 other sections not shown
A(MAX Advanced Software Design AMTNP Answers to Exercises Appendix arithmetic expression array available nodes Backtracking Binary minus binary tree black box candidate square chapter cond control structures CURP data structure data units deleted DELVAL DISK(DP,TOP(DP disks doubly linked list Dynamic Programming eight queens eight queens problem elements Empty Empty END OF SUBROUTINE end-of-file example executed GOTO head node illustrative program infix notation INLVL input integer invariant invocation iteration knight's tour left subtree LEVEL LINK(PRED LLINK loop body loop invariant MAXVAL MCOST nonrecursive NPER Operand OUTPUT OVFLO paren partition value permutation PNOD problem program SUBROUTINE pseudo-code RADER recursive algorithms repeat-block representation RETURN END reverse Polish notation right subtree RLINK RLINK(AVAIL RLINK(ROOT ROOT RVAL sequence shown in Figure Software Design Techniques SRLAB Step SUBROUTINE EXTEND SUBROUTINE PREORD SUBROUTINE PREORD(ROOT TCOST TOP(SP unary unary operator variables WMN(M WST(W