Taylor's Library

Normal view MARC view ISBD view

Data structures and algorithms in Java / Adam Drozdek.

By: Drozdek, Adam.
Publisher: Pacific Grove, Calif. : Brooks/Cole, c2001Description: xvii, 622 p. ; 25 cm.ISBN: 0534376681.Subject(s): Computer algorithms | Data structures (Computer science) | Java (Computer program language)DDC classification: 005.133
Contents:
1. Object-Oriented Programming Using Java. - 2. Complexity Analysis. - 3. Linked Lists. - 4. Stacks and Queues. - 5. Recursion. - 6. Binary Trees. - 7. Multiway Trees. - 8. Graphs. - 9.Sorting. - 10. Hashing. - 11. Data Compression. - 12. Memory Management. - Appendix A. Computing Big-O. - Name Index. - Subject Index.
Summary: In Data Structures and Algorithms in Java, Adam Drozdek has successfully created a textbook that makes the subject accessible to students who are new to data structures, while providing an appealing scope of material for more advanced students. This text emphasizes the connection between data structures and algorithms ; carefully presents the difficult subject of recursion ; offers a case study in every chapter (except Chapter 2) ; provides programming assignments in all but the second chapter. Dozdek amply illustrates discussion of data structures with figures and case studies, which strengthens student understanding of the power and utility of data structures. - Back cover
Item type Current location Shelf location Call number Copy number Status Notes Date due Barcode
Main Collection Taylor's Library-TU

Floor 3, Shelf 1 , Side 2, TierNo 4, BayNo 6

 005.133 DRO (Browse shelf) 1 Available SOCIT,15008,03,GR 5000041137

1. Object-Oriented Programming Using Java. - 2. Complexity Analysis. - 3. Linked Lists. - 4. Stacks and Queues. - 5. Recursion. - 6. Binary Trees. - 7. Multiway Trees. - 8. Graphs. - 9.Sorting. - 10. Hashing. - 11. Data Compression. - 12. Memory Management. - Appendix A. Computing Big-O. - Name Index. - Subject Index.

In Data Structures and Algorithms in Java, Adam Drozdek has successfully created a textbook that makes the subject accessible to students who are new to data structures, while providing an appealing scope of material for more advanced students. This text emphasizes the connection between data structures and algorithms ; carefully presents the difficult subject of recursion ; offers a case study in every chapter (except Chapter 2) ; provides programming assignments in all but the second chapter. Dozdek amply illustrates discussion of data structures with figures and case studies, which strengthens student understanding of the power and utility of data structures. - Back cover

Computer programming, programs & data