This new text introduces students of computer science to the theory, implementation, and applications of data structures and algorithms. Important features of this book include an abstract data type (ADT) approach and informally analyzed implementations using the Big-Oh notation. There is a strong emphasis on program readability, a point which is made in the first chapter and reinforced by example throughout. Recursion is also stressed and a chapter is devoted to its explanation. Clear tables and figures are used throughout the text and there are end-of-chapter exercises and suggestions for further study.
"synopsis" may belong to another edition of this title.
Covering thoroughly the central subject of computer science--data structures and algorithms--this text offers a practical introduction to theory, implementation, and applications using the Abstract Data Type approach. For each of the major data types, it provides a definition in terms of objects and operations, an illustration of its use, and at least one method of implementation. Specific topics include parsing, simulation, expression simplification, BNF, and backtracking. Most implementations are analyzed informally through the Big-Oh notation, introduced in the first chapter. Each discussion is followed by larger applications and overviews of related issues. Special emphasis is placed on recursion, which is fully explained and used to clarify other concepts in the book. In addition, program readability is also stressed and reinforced. Throughout, the superiority of Modula-2 over earlier languages is fully exploited. Exercises comprise almost 15% of the text.
"About this title" may belong to another edition of this title.
Seller: medimops, Berlin, Germany
Condition: good. Befriedigend/Good: Durchschnittlich erhaltenes Buch bzw. Schutzumschlag mit Gebrauchsspuren, aber vollständigen Seiten. / Describes the average WORN book or dust jacket that has all the pages present. Seller Inventory # M00471637785-G
Quantity: 1 available