Data Structures, Algorithms, and Software Principles in C, 1st edition
Published by Pearson (September 30, 1994) © 1995
- Thomas A. Standish
- Hardcover, paperback or looseleaf edition
- Affordable rental option for select titles
- Free shipping on looseleafs and traditional textbooks
Using C, this book develops the concepts and theory of data structures and algorithm analysis in a gradual, step-by-step manner, proceeding from concrete examples to abstract principles. Standish covers a wide range of both traditional and contemporary software engineering topics. The text also includes an introduction to object-oriented programming using C++. By introducing recurring themes such as levels of abstraction, recursion, efficiency, representation and trade-offs, the author unifies the material throughout. Mathematical foundations can be incorporated at a variety of depths, allowing the appropriate amount of math for each user.
1. Preparing for the Journey.
2. Linked Data Representations.
3. Introduction to Recursion.
4. Modularity and Data Abstraction.
5. Introduction to Software Engineering Concepts.
6. Introduction to Analysis of Algorithms.
7. Linear Data Structures—Stacks and Queues.
8. Lists, Strings, and Dynamic Memory Allocation.
9. Trees.
10. Graphs.
11. Hashing and the Table ADT.
12. External Collections of Data.
13. Sorting.
14. Advanced Recursion.
15. Object-Oriented Programming.
16. Advanced Software Engineering Concepts.
Appendix Math Reference and Tutorial. 0201591189T04062001
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.
0201591189AB04062001
Need help? Get in touch