Zum Hauptinhalt springen Zur Suche springen Zur Hauptnavigation springen
Beschreibung
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.
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.
Inhaltsverzeichnis

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

Details
Erscheinungsjahr: 2013
Genre: Importe, Informatik
Rubrik: Naturwissenschaften & Technik
Medium: Taschenbuch
Inhalt: 948 S.
ISBN-13: 9781292025766
ISBN-10: 129202576X
Sprache: Englisch
Einband: Kartoniert / Broschiert
Autor: Weiss, Mark
Weiss, Mark A.
Auflage: 4. Auflage
Hersteller: Pearson
Pearson Business
Pearson Education Limited
Verantwortliche Person für die EU: Pearson Studium im Verlag Pearson Benelux B.V. Zweigniederla, Sankt-Martin-Str. 82, D-81541 München, buchhandel@pearson.com
Maße: 276 x 216 x 51 mm
Von/Mit: Mark Weiss (u. a.)
Erscheinungsdatum: 23.07.2013
Gewicht: 2,297 kg
Artikel-ID: 110086446