000 02371nam a2200253 i 4500
003 MIUC
005 20200210093548.0
008 171221s1996 masa|||| |||| 001 | eng d
020 _a9780669400007
040 _aMIUC
_beng
_cMIUC
082 0 _a005.7
100 1 _93087
_aDale, Nell
_q(Nell B.)
245 1 0 _aAbstract data types :
_bspecifications, implementations, and applications /
_cNell Dale, Henry M. Walker.
260 _aLexington ;
_aToronto :
_bD. C. Heath and Company,
_c1996.
300 _axxiii, 624, A1-A98 p. :
_bill. b&w ;
_c24 cm.
336 _2rdacontent
_atext
504 _aIncludes bibliographical references and index.
505 0 _aCh. 1. Abstract specification techniques -- Ch. 2. Analysis of algorithms -- Ch. 3. Toward more generality in algorithm -- Ch. 4. Unstructured data types -- Ch. 5. Semi-structure data types -- Ch. 6. Structure linear data types -- Ch. 7. Binary trees -- Ch. 8. Binary search trees -- Ch. 9. Multi-way search trees -- Ch. 10. Directed graphs or digraphs -- Ch. 11. Undirected graphs and complexity -- Ch. 12. Generalized lists -- Ch. 13. Memory management.
520 _aThis text expands the traditional course focus to examine not only the structure of a data object, but also its type. This broader focus requires a new paradigm for classifying data types. Within each classification, the different ADTs are presented using axiomatic specifications. Various implementation alternatives are discussed for each ADT and algorithms are written in a pseudo-code based on the Pascal-Modula- 2-Ada model. Next, the Big-O complexity of each implementation is discussed and each ADT is used in an application. Classic algorithms provide applications for some of the ADTs; implementation of a previously defined ADT is the application for others. The result is a clear, logical presentation that gives students a solid, practical foundation in current software engineering principles. Applications are included to demonstrate how the ADTs are used in problem-solving. Proven pedagogical features such as detailed examples, highlighted definitions, numerous illustrations, and exercises teach problem-solving skills.
650 0 _93088
_aAbstract data types (Computer science)
650 0 _93089
_aData structures (Computer science)
700 1 _4aut
_93090
_aWalker, Henry M.,
_d1947-
942 _2ddc
_cBK