|
| Login | Sign up | My Wish List |
![]() | Ada Plus Data Structures by Nell Dale ISBN-10: 9780669292657 ISBN-10: 0-669-29265-6 ISBN-13: 9780669292657 ISBN-13: 978-0-669-29265-7 Textbook Binding 1999-06 Jones & Bartlett Publishers Find Lowest Price | |
Editorials | ||
Product Description This text provides a clear, comprehensive introduction to data structures, algorithms, and data abstraction for freshman and sophomore-level students who have completed an introductory programming course in Pascal, Ada, or comparable language. Its accessible introduction to object-oriented design methodologies is balanced by a solid presentation of traditional abstract data types, computer science theory, and concepts derived from software engineering practices. Written in an intuitive style, the text emphasizes abstraction, information hiding, encapsulation, life-cycle verification, reuse, and analysis of algorithms. Clear, well-documented code, numerous illustrations, and effective pedagogical support help students develop strong analytic and programming skills. | ||
Reviews | ||
Good Textbook As a freshman at an upstate New York state university, this was the textbook for the second sequential computer science course. Of course, the choice was obvious: McCormick being a former professor at the school. At that point, I was a beginning programmer, having already taken basic programming classes. This book, however, is responsible for my now-firm grasp of data structures and algorithms. Both dynamic and static structures, complex and simple, this book is the primer for an understanding of data structures in Ada. As an Ada textbook alone, it has its faults: it assumes the reader has a knowledge of the programming language, but from that point teaches a method of programming that enforces good stylistic patterns and strong code. Now, when it comes to algorithm layout in my position as a design engineer, I turn to Ada first for a comprehensible design structure, and then port it to other languages as necessary. | ||