Inhaltsangabe
Algorithms and data structures lie at the heart of computer science, and are essential tools for every practising programmer. This book provides an in-depth treatment of the central algorithms and data structures of computer science, together with an introduction to the techniques of design, correctness and analysis required for understanding them. Beginning with coverage of techniques followed by the major application areas of lists, trees, symbol tables, priority queues, sorting, disjoint sets, and graph algorithms. The theory is then completed with a closing chapter on lower bounds.
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
Über die Autorin bzw. den Autor
Jeffrey H. Kingston is a senior lecturer in the Basser Department of Computer Science at the University of Sydney, Australia. He has published correctness proofs and analyses of a variety of data structures ans algorithms; his other research interests include document formatting, computerized timetable construction and computer science curriculum design.
0201360624AB04062001
Von der hinteren Coverseite
Features:
Consistent use of state-of-the-art techniques throughout, including object-oriented programming
Topics have been carefully selected to ensure that they are of real practical importance and presented in a logical sequence
Complete and carefully tested Eiffel implementations with many attractive examples, diagrams and exercises
0201360624B04062001
„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.
