Data Structures and Algorithms in Java,
4th Edition

Adam Drozdek

Data Structures and Algorithms in Java
ISBN-13: 9789814392785
Copyright 2013 | Published
List Price: USD $109.95

Data structures serve as a foundation upon which many other computer science fields are built. Thus, some knowledge of data structures is a prerequisite for students who wish to work in the design, implementation, testing, or maintenance of virtually any software systems. The Java language, an object-oriented descendant of C and C++, has gained popularity in industry and academia as an excellent programming language due to widespread use of the Internet. Thus, the use of Java to teach a data and algorithms course is well justified.

Purchase Enquiry INSTRUCTOR’S eREVIEW COPY

Preface.
About the Author.
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.
Name and Subject Indexes.

  • 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.

  • A section on treaps (6.10)

  • A section on treaps (6.10)

  • A section on k-d tress (6.11)

  • A section on k-d tress (6.11)

  • A section on k-d B-trees (7.1.5)

  • A section on k-d B-trees (7.1.5)

  • A section on generational garbage collection (12.3.4)

  • A section on generational garbage collection (12.3.4)

  • Emphasizes the connection between data structures and their algorithms, with an analysis of the algorithms’ complexity

  • Emphasizes the connection between data structures and their algorithms, with an analysis of the algorithms’ complexity

  • Presents data structures in the context of object-oriented program design

  • Presents data structures in the context of object-oriented program design

  • Illustrates the complete context in which certain algorithms and data structures can be used through case studies

  • Illustrates the complete context in which certain algorithms and data structures can be used through case studies

  • Examines the efficiency of algorithms with theoretical analysis, with suggestions to improve them

  • Examines the efficiency of algorithms with theoretical analysis, with suggestions to improve them

  • Simplifies the understanding of recursion by considering run-time stacks together with the algorithms

  • Simplifies the understanding of recursion by considering run-time stacks together with the algorithms

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.