Weiss, Mark Allen. <br/><br/>
Data structures & algorithm analysis in Java / 
 Data structures and algorithm analysis in Java 
Mark Allen Weiss. 
 - Reading, Mass. ;  Tokyo ;  Bonn :  Addison-Wesley Longman, Inc.,   c1999. 
 - xviii, 542 p. :  ill. ;  25 cm. 
<br/><br/> CONTENT :<br/><br/>Chapter 1  Introduction<br/>1.1 Whats the book about ?<br/>1.2 Mathematics review<br/>1.3 A brief introduction to recursion<br/>1.4 Generic objects in java<br/>1.5 Exceptions<br/>etc.<br/><br/>Chapter 2  Algorithm analysis<br/>2.1 Mathematical background<br/>2.2 Model <br/>2.3 What to analyze<br/>2.4 Running time calculations<br/>etc.<br/><br/>Chapter 3  Lists,Stacks and queues<br/>3.1 Abstract data types (ADTs )<br/>3.2 The list ADT<br/>3.3 The stack ADT<br/>3.4 The queue ADT<br/>etc.<br/><br/>Chapter 4  Trees<br/>4.1 Preliminaries<br/>4.2 Binary trees<br/>4.3 The search tree ADT- Binary search trees<br/>4.4 AVL Trees.<br/>etc.<br/><br/>Chapter 5  Hashing<br/>5.1 General idea<br/>5.2 Hash function<br/>5.3 Separate chaining<br/>5.4 Open addressing<br/>5.5 Rehashing<br/>5.6 Extendible hashing<br/><br/>Chapter 6: Priority queues<br/>6.1 Model<br/>6.2 Simple implementations <br/>6.3 Binary heap<br/>6.4 Applications of priority queues<br/>etc.<br/><br/>Chapter 7: Sorting<br/>7.1 Preliminaries<br/>7.2 Insertion sort<br/>7.3 A lower bound for simple sorting algorithms<br/>7.4 Shellsort<br/>etc.<br/><br/>Chapter 8: The disjoint set ADT<br/>8.1 Equivalence relations<br/>8.2 The dynamic equivalence problem<br/>8.3 Basic data structure<br/>8.4 Smart union algorithms <br/>etc.<br/><br/>Chapter 9: Graph algorithms <br/>9.1 Definitions<br/>9.2 Topological sort<br/>9.3 Shortest-path algorithms <br/>etc.<br/><br/>Chapter 10: Algorithms design techniques<br/>10.1 Greedy algorithms<br/>10.2 Divide and conquer<br/>10.3 Dynamic programming<br/>etc.<br/><br/>Chapter 11: Amortized analysis <br/>11.1 An unrelated puzzle<br/>11.2 Binomial queues<br/>11.3 Skew heaps<br/>etc.<br/><br/>Chapter 12: Advanced data structures and implementation<br/>12.1 Top-down splay trees<br/>12.2 Red-black trees<br/>12.3 Deterministic skip lists<br/>etc.<br/><br/><br/> 
<br/><br/>Includes bibliographical references and index. 
<br/><br/><label>ISBN: </label>9780201357547 0201357542 
<br/><br/><label>LCCN: </label>98038827  
<br/><br/><label>Subjects--Topical Terms: </label><br/>Java (Computer program language)<br/>Data structures (Computer science)<br/>Computer algorithms.
<br/><br/><label>Dewey Class. No.: </label>005.73  / WEI