Incorporates the idea of data abstraction as a programming technique. In fact, it takes as its central theme the idea that abstraction is a powerful technique for writing well-structured computer programs. Written specifically for the CS 2 student, it presents all the CS 2 material and early on discusses the use of abstraction as a means to help solve problems by separating the implementation issues from the specification issues. Classical abstract data types are covered, but presented as examples of this powerful technique rather than as defining that technique. With its goal of helping students become good programmers, it covers both memory and time efficiency considerations, various testing and verification techniques and useful sorting methods. The material is presented consistently throughout--the motivation for the concept to be covered is given, followed by examples and a significant case study. End-of-chapter programming problems that incorporate the ideas discussed are included.See Nodes DescendStairs pseudocode, 100-102 Destroy procedure, 55, 56-57, 243 Devices. ... 326 and adjacency matrix, 327-328 of digraphs, 326-327 directed, 207 and Graph ADT, 329-330 and parent/child relationships, 209 weighting factors for, ... 27, 28, 30, 32-33, 36, 45, 47 Error checking, 84 Error- resistant approach, 386-388 EvalExprs program, 40-43 Eval function, 230, 231 Execution time, 263anbsp;...
|Title||:||Pascal and Beyond...|
|Author||:||Steve Fisher, Stuart Reges|
|Publisher||:||John Wiley & Sons Incorporated - 1992|