Published by Pearson (August 29, 2013) © 2014

Mark Weiss
    VitalSource eTextbook (12 months access)
    €40,99
    Adding to cart… The item has been added
    ISBN-13: 9781292038186R365

    Data Structures and Problem Solving Using Java ,4th edition

    Language: English

    For the second or third programming course.

     

    A practical and unique approach to data structures that separates interface from implementation.

     

    This book provides a practical introduction to data structures with an emphasis on abstract thinking and problem solving, as well as the use of Java. It does this through what remains a unique approach that clearly separates each data structure’s interface (how to use a data structure) from its implementation (how to actually program that structure). Parts I (Tour of Java), II (Algorithms and Building Blocks), and III (Applications) lay the groundwork by discussing basic concepts and tools and providing some practical examples, while Part IV (Implementations) focuses on implementation of data structures. This forces the reader to think about the functionality of the data structures before the hash table is implemented.

     

    The full text downloaded to your computer

    With eBooks you can:

    • search for key concepts, words and phrases
    • make highlights and notes as you study
    • share your notes with friends

    eBooks are downloaded to your computer and accessible either offline through the Bookshelf (available as a free download), available online and also via the iPad and Android apps.

    Upon purchase, you'll gain instant access to this eBook.

    Time limit

    The eBooks products do not have an expiry date. You will continue to access your digital ebook products whilst you have your Bookshelf installed.

    • PART ONE: TOUR OF JAVA
    • Chapter 1: Primitive Java
    • Chapter 2: Reference Types
    • Chapter 3: Objects and Classes
    • Chapter 4: Inheritance
    • PART TWO: ALGORITHMS AND BUILDING BLOCKS
    • Chapter 5: Algorithm Analysis
    • Chapter 6: The Collections API
    • Chapter 7: Recursion
    • Chapter 8: Sorting Algorithms
    • Chapter 9: Randomization
    • PART THREE: APPLICATIONS
    • Chapter 10: Fun and Games
    • Chapter 11: Stacks and Compilers
    • Chapter 12: Utilities
    • Chapter 13: Graphs and Paths
    • PART FOUR: IMPLEMENTATIONS
    • Chapter 14: Inner Classes and Implementation of ArrayList
    • Chapter 15: Stacks and Queues
    • Chapter 16: Linked Lists
    • Chapter 17: Trees
    • Chapter 18: Binary Search Trees
    • Chapter 19: Hash Tables
    • Chapter 20: A Priority Queue: The Binary Heap
    • PART FIVE: ADVANCED DATA STRUCTURES
    • Chapter 21: Splay Trees
    • Chapter 22: Merging Priority Queues
    • Chapter 23: The Disjoint Set Class
    • APPENDIX A: Operators
    • APPENDIX B: Graphical User Interfaces
    • APPENDIX C: Bitwise Operators