Other versions by this Author
| Introduction | |
| What's New in the Second Edition | |
| What This Book Is About | |
| What's Different About This Book | |
| Who This Book Is For | |
| What You Need to Know Before You Read This Book | |
| The Software You Need to Use This Book | |
| How This Book Is Organized | |
| Enjoy Yourself! | |
| Overview | |
| What Are Data Structures and Algorithms Good For? Overview of Data Structures | |
| Overview of Algorithms | |
| Some Definitions | |
| Object-Oriented Programming | |
| Software Engineering | |
| Java for C++ Programmers | |
| Java Library Data Structures | |
| Summary | |
| Questions | |
| Arrays | |
| The Array Workshop Applet | |
| The Basics of Arrays in Java | |
| Dividing a Program into Classes | |
| Class Interfaces | |
| The Ordered Workshop Applet | |
| Java Code for an Ordered Array | |
| Logarithms | |
| Storing Objects | |
| Big O Notation | |
| Whay Not Use Arrays for Everything | |
| Summary | |
| Questions | |
| Experiments | |
| Programming Projects | |
| Simple Sorting | |
| How Would You Do It | |
| Bubble Sort | |
| Selection Sort | |
| Insertion Sort | |
| Sorting Objects | |
| Comparing the Simple Sorts | |
| Summary | |
| Questions | |
| Experiments | |
| Programming Projects | |
| Stacks and Queues | |
| A Different Kind of Structure | |
| Stacks | |
| Queues | |
| Priority Queues | |
| Parsing Arithmetic Expressions | |
| Summary | |
| Questions | |
| Experiments | |
| Programming Projects | |
| Linked Lists | |
| Links | |
| The Link List Workshop Applet | |
| A Simple Linked List | |
| Finding and Deleting Specified Links | |
| Double-Ended Lists | |
| Linked-List Efficiency | |
| Abstract Data Types | |
| Sorted Lists | |
| Doubly Linked Lists | |
| Iterators | |
| Summary | |
| Questions | |
| Experiments | |
| Programming Projects | |
| Recursion | |
| Triangular Numbers | |
| Factorials | |
| Anagrams | |
| A Recursive Binary Search | |
| The Towers of Hanoi | |
| Mergesort | |
| Eliminating Recursion | |
| Some Interesting Recursive Applications | |
| Summary | |
| Questions | |
| Experiments | |
| Programming Projects | |
| Advanced Sorting | |
| Shellsort | |
| Paartitioning | |
| Quicksort | |
| Radix Sort | |
| Summary | |
| Questions | |
| Experiments | |
| Programming Projects | |
| Binary Trees | |
| Why Use Binary Trees? Tree Terminology | |
| An Analogy | |
| How Do Binary Search Trees Work | |
| Finding a Node | |
| Inserting a Node | |
| Traversing the Tree | |
| Finding Maximum and Minimum Values | |
| Deleting a Node | |
| The Efficiency of Binary Trees | |
| Trees Represented as Arrays | |
| Duplicate Keys | |
| The Complete tree | |
| Java Program | |
| The Huffman Code | |
| Summary | |
| Questions | |
| Experiments | |
| Programming Projects | |
| Red-Black Trees | |
| Our Approach to the Discussion | |
| Balanced and Unbalanced Trees | |
| Using the RBTree Workshop Applet | |
| Experimenting with the Workshop Applet | |
| Rotations | |
| Inserting a New Node | |
| Deletion | |
| The Efficiency of Red-Black Trees | |
| Red-Black Tree Implementation | |
| Other Balanced Trees | |
| Summary | |
| Questions | |
| Experiments | |
| 2-3-4 Trees and External Storage | |
| Introduction to 2-3-4 Trees | |
| The Tree234 Workshop Applet | |
| Java Code for a 2-3-4 Tree | |
| 2-3-4 Trees and Red-Black Trees | |
| Efficiency of 2-3-4 Trees | |
| 2-3 Trees | |
| External Storage | |
| Summary | |
| Questions | |
| Experiments | |
| Programming Projects | |
| Hash Tables | |
| Introduction to Hashing | |
| Open Addressing | |
| Separate Chaining | |
| Hash Functions | |
| Hashing Efficiency | |
| Hashing and External Storage | |
| Summary | |
| Questions | |
| Experiments | |
| Programming Projects | |
| Heaps | |
| Introduction to Heaps | |
| The Heap Workshop Applet | |
| Java Code fo Heaps | |
| A Tree-based Heap | |
| Heapsort | |
| Summary | |
| Questions | |
| Experiments | |
| Programming Projects | |
| Graphs | |
| Introduction to Graphs | |
| Searches | |
| Minimum Spanning Trees | |
| Topological Sorting with Directed Graphs | |
| Connectivity in Directed Graphs | |
| Summary | |
| Questions | |
| Experiments | |
| Programming Projects | |
| Weighted Graphs | |
| Minimum Spanning Tree with Weighted Graphs | |
| The Shortest-Path Problem | |
| The All-Pairs Shortest-Path Problem | |
| Efficien | |
| Table of Contents provided by Publisher. All Rights Reserved. |
Data Structures and Algorithms in Java
by Robert LaforeFormat: eBook
Pub. Date: 2002-11-06
Publisher(s): Pearson Technology Group
-
This Item Qualifies for Free Shipping!*
*Excludes marketplace orders.
List Price: $102.35
Rent Book
Select for Price
Rent Digital
$76.79
New Book
We're Sorry
Sold Out
Used Book
We're Sorry
Sold Out
Table of Contents
An electronic version of this book is available through VitalSource.
This book is viewable on PC, Mac, iPhone, iPad, iPod Touch, and most smartphones.
By purchasing, you will be able to view this book online, as well as download it, for the chosen number of days.
Digital License
You are licensing a digital product for a set duration. Durations are set forth in the product description, with "Lifetime" typically meaning five (5) years of online access and permanent download to a supported device. All licenses are non-transferable.
More details can be found here.
A downloadable version of this book is available through the eCampus Reader or compatible Adobe readers.
Applications are available on iOS, Android, PC, Mac, and Windows Mobile platforms.
Please view the compatibility matrix prior to purchase.