RENT TEXTBOOKS

by: Weiss, Mark A.

ISBN: 9780321541406 | 0321541405

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... MORE), 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 Fourth Edition features many new updates as well as new exercises.

---

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 structurers"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 structuresbeforethe hash table is implemented. Primitive Java; Reference Types; Objects and Classes; Inheritance; Algorithm Analysis; The Collections API; Recursion; Sorting Algorithms; Randomization; ApplicationsGames, Stacks and Compilers, Utilities, Simulation, Graphs and Paths; Inner Classes and Implementation of ArrayList Stacks and Queues; Linked Lists; Trees; Binary Search Trees; Hash Tables; A Priority Queue: The Binary Heap; Advanced Data StructuresSplay Trees, Merging Priority Queues, The Disjoint Set Class A useful guide for Java programmers that includes lots of sample code and basic theory.

---

Data Structures and Problem Solving Using Java takes a practical and unique approach to data structures that separates interface from implementation. It is suitable for the second or third programming course.

 

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 Fourth Edition features many new updates as well as new exercises.

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

... MOREChapter 8: Sorting Algorithms

Chapter 9: Randomization

 

PART THREE: APPLICATIONS

Chapter 10: Fun and Games

Chapter 11: Stacks and Compilers

Chapter 12: Utilities

Chapter 13: Simulation

Chapter 14: Graphs and Paths

 

PART FOUR: IMPLEMENTATIONS

Chapter 15: Inner Classes and Implementation of ArrayList

Chapter 16: Stacks and Queues

Chapter 17: Linked Lists

Chapter 18: Trees

Chapter 19: Binary Search Trees

Chapter 20: Hash Tables

Chapter 21: A Priority Queue: The Binary Heap

 

PART FIVE: ADVANCED DATA STRUCTURES

Chapter 22: Splay Trees

Chapter 23: Merging Priority Queues

Chapter 24: The Disjoint Set Class

 

APPENDIX A: Operators

APPENDIX B: Graphical User Interfaces

APPENDIX C: Bitwise Operators

 

Mark Allen Weiss is a Professor in the School of Computing and Information Sciences at Florida International University in Miami Florida. He received his Bachelor's Degree in Electrical Engineering from The Cooper Union in 1983, and his Ph.D. in Computer Science from Princeton University in 1987, working under Bob Sedgewick. He has been at FIU since 1987, and was promoted to Professor in 1996. His interests include data structures, algorithms, and education, and he is most well-known for his highly-acclaimed Data Structures textbooks, which have been used at hundreds of universities worldwide.