Book ratings by Goodreads. Table of contents Algorithm Analysis. Concurrent and Real-time Systems Steve Schneider. After earning a B.
|Published (Last):||21 November 2005|
|PDF File Size:||13.11 Mb|
|ePub File Size:||7.33 Mb|
|Price:||Free* [*Free Regsitration Required]|
Experienced object-oriented programmers find that certain ways of doing things work best and that these ways occur over and over again. The book shows how these patterns are used to create good software designs. In particular, the following design patterns are used throughout the text: singleton, container, iterator, adapter and visitor. Virtually all of the data structures are presented in the context of a single, unified, polymorphic class hierarchy.
This framework clearly shows the relationships between data structures and it illustrates how polymorphism and inheritance can be used effectively.
In addition, algorithmic abstraction is used extensively when presenting classes of algorithms. By using algorithmic abstraction, it is possible to describe a generic algorithm without having to worry about the details of a particular concrete realization of that algorithm.
In the past when the topics in this book were taught at the graduate level, students could be expected of having the needed background in mathematics. However, because the book is targeted for second- and third-year students, it is necessary to fill in the background as needed. Reviews: : "Who should buy this book?
Data Structures and Algorithms with Object-Oriented Design Patterns in C++
Data Structures and Algorithms with Object-Oriented Design Patterns in Python