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 Appendix array available nodes Backtracking binary tree black box description buckets CALL cond control structures create CURP data structures data units deleted DELVAL diagram disks doubly linked list eight queens problem elements eliminated Empty Empty END OF SUBROUTINE example executed FORTRAN FUNCTION SQRT(N GOTO head node illustrative program infix notation INLVL input integers interfaces iteration knight's tour LEVEL LINK(PRED LLINK loop body loop invariant MAXVAL MCOST nonrecursive Operand output OVFLO partition value permutation PNOD Polish notation precede problem pseudo-code queens recursive algorithms representation represented RETURN END RETURN(A reverse Polish reverse Polish notation right subtree RLINK RLINK(AVAIL RLINK(ROOT ROOT RVAL selection sequence shown in Figure singly linked list Software Design Techniques solution square stack Step structured programming SUBROUTINE EXTEND successful completion SWAP tion TOKEN TOP(DP traversal unary unary operator users variables