Data Structures and Algorithms in Java,
3rd Edition

Adam Drozdek

Data Structures and Algorithms in Java
ISBN-13: 9789814239233
Copyright 2008 | Published
List Price: USD $105.95

Using the Java programming language, Drozdek highlights three important aspects of data structures and algorithms. First, the book places special emphasis on the connection between data structures and their algorithms, including an analysis of the algorithms’ complexity. Second, the book presents data structures in the context of object-oriented program design. Finally, the book closely examines data structure implementation. Overall, this practical and theoretical book provides students with a solid foundation in data structures for future courses and work in design, implementation, testing, and maintenance of virtually any software system.

Purchase Enquiry INSTRUCTOR’S eREVIEW COPY

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.
13. String Matching.
Appendix A: Computing Big-O.
Appendix B: NP-Completeness.

  • Adam Drozdek

    A well respected author and dedicated instructor, Dr. Adam Drozdek serves as Associate Professor of Computer Science at Duquesne University, where he teaches courses in operating systems and computer architecture, advanced data structures and other advanced computer science courses. Dr. Drozdek has authored numerous successful books, including THE ELEMENTS OF DATA COMPRESSION. He earned his B.S. and M.A. from Wrocław University, his M.S. from Wright State University, and Ph.D. from Jagiellonian University.

  • New! Coverage of a new hashing technique.

  • NEW! Coverage of two new sorting methods.

  • Updated! This new edition contains updated Java code to reflect the inclusion of generic classes in Java 5.

  • Updated! Tables that list methods from java.util packages have been updated to reflect modifications and additions introduced in Java 5 and Java 6.

  • New! Coverage of a new hashing technique.

  • NEW! Coverage of two new sorting methods.

  • Updated! This new edition contains updated Java code to reflect the inclusion of generic classes in Java 5.

  • Updated! Tables that list methods from java.util packages have been updated to reflect modifications and additions introduced in Java 5 and Java 6.

  • Case Studies. Most chapters include a case study that illustrates a complete context in which algorithms and data structures can be used.

  • Java code examples. Brief examples of Java code are included to illustrate the practical importance of data structures.

  • Theoretical analysis. Presentation of algorithms are integrated with analyses of efficiency.

  • Recursion topics. Clarifies recursion topics through their presentation in context of the run-time stack.

  • Case Studies. Most chapters include a case study that illustrates a complete context in which algorithms and data structures can be used.

  • Java code examples. Brief examples of Java code are included to illustrate the practical importance of data structures.

  • Theoretical analysis. Presentation of algorithms are integrated with analyses of efficiency.

  • Recursion topics. Clarifies recursion topics through their presentation in context of the run-time stack.

Cengage provides a range of supplements that are updated in coordination with the main title selection. For more information about these supplements, contact your Learning Consultant.