Request for consultation

Thanks for your request. You’ll soon be chatting with a consultant to get the answers you need.
Your form is submitting...
{{formPostErrorMessage.message}} [{{formPostErrorMessage.code}}]
Email Address is required. 'Email Address' must contain at least 0 characters 'Email Address' cannot exceed 0 characters Please enter a valid Email Address
First Name is required. 'First Name' must contain at least 0 characters 'First Name' cannot exceed 0 characters Please enter a valid First Name
Last Name is required. 'Last Name' must contain at least 0 characters 'Last Name' cannot exceed 0 characters Please enter a valid Last Name
Institution is required.
Discipline is required.
Country is required. 'Country' must contain at least 0 characters 'Country' cannot exceed 0 characters Please enter a valid Country
Cengage, at your service! How can we best meet your needs? is required.
Why are you contacting us today? is required. 'Why are you contacting us today?' must contain at least 0 characters 'Why are you contacting us today?' cannot exceed 0 characters Please enter a valid Why are you contacting us today?

Data Structures and Algorithms in Java, 4th Edition

Adam Drozdek

  • {{checkPublicationMessage('Published', '2013-01-15T00:00:00+0000')}}
Starting At £83.99 See pricing and ISBN options
Data Structures and Algorithms in Java 4th Edition by Adam Drozdek

Overview

DATA STRUCTURES AND ALGORITHMS IN JAVA (4E)

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 Wroclaw University, his M.S. from Wright State University, and Ph.D. from Jagiellonian University.
  • A section on treaps (6.10)
  • A section on k-d tress (6.11)
  • A section on k-d B-trees (7.1.5)
  • 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
  • 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
  • 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
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.

Textbook Only Options

Traditional eBook and Print Options

{{collapseContainerClosed['detail_0'] ? 'Show More' : 'Show Less'}}

  • ISBN-10: 9814392782
  • ISBN-13: 9789814392785
  • RETAIL £83.99