Data Structures, Algorighms, and Software Principles - Hardcover

Über die Autorin bzw. den Autor

Thomas A. Standish is the chairman of computer science at the University of California, Irvine. In 1990-91, he became the fourth winner of University of California Irvine's Distinguished Faculty Lectureship for Teaching, the campus' highest distinction for teaching excellence. He has also been a co-winner of his department's best-teacher award, chosen by the popular vote of University of California Irvine undergraduate computer science students.

Von der hinteren Coverseite

This book develops the concepts of data structures and algorithm analysis step-by-step in a gradual fashion, proceeding from concrete examples to abstract principles. The presentation stresses motivation, intuition, and utility before giving technical details. Recurring themes such as recursion, levels of abstraction, efficiency, and trade-offs unify the material. Important software engineering concepts and principles are also covered including modularity, abstract data types, and information hiding, as well as new developments such as risk-based software lifecycle models and object-oriented programming. Mathematical foundations are covered and can be engaged at a variety of depths.

It is assumed that students using this book for a CS2 course will have already taken a CS1 course covering introductory programming using Pascal.

• Develops the concepts and theory of data structures and algorithm analysis step-by-step, in a gradual fashion, proceeding from concrete examples to abstract principles
• Uses recurring themes such as recursion, levels of abstraction, efficiency, and trade-offs to unify the material completely
• Provides mathematical foundations that can be engaged at a variety of depths
• Covers traditional software engineering principles as well as introducing new concepts such as risk-based software lifecycle models, rapid prototyping, and reusable software components
• Introduction to object-oriented programming