Data Structures and Other Objects Using Java
ISBN: 9780321375254 | 0321375254
Edition: 3rdFormat: Paperback
Publisher: Addison Wesley
Pub. Date: 1/1/2006
Why Rent from Knetbooks?
Because Knetbooks knows college students. Our rental program is designed to save you time and money. Whether you need a textbook for a semester, quarter or even a summer session, we have an option for you. Simply select a rental period, enter your information and your book will be on its way!
Top 5 reasons to order all your textbooks from Knetbooks:
- We have the lowest prices on thousands of popular textbooks
- Free shipping both ways on ALL orders
- Most orders ship within 48 hours
- Need your book longer than expected? Extending your rental is simple
- Our customer support team is always here to help
Michael Mains gentle approach to data structures and objects has introduced thousands of beginning programmers to foundational data structures using the practical Java language. This Third Edition makes the most of the enhancements and advantages of Java 5.0 including the use of generic data types. An early group of chapters reviews the key aspects of object-oriented programming giving students the foundation for understanding significant programming concepts. With this framework they are able to accomplish writing functional data structures by... MORE
| The Phases of Software Development | |
| Specification, Design, Implementation | |
| Running Time Analysis | |
| Testing and Debugging | |
| Abstract Data Types and Java Classes | |
| Classes and Their Members | |
| Using a Class | |
| Packages | |
| Parameters, Equals Methods, and Clones | |
| Collection Classes | |
| A Review of Ja... MORE | |
| An ADT for a Bag of Integers | |
| Programming Project: The Sequence ADT | |
| Applets for Interactive Testing | |
| Linked Lists | |
| Fundamentals of Linked Lists | |
| Methods for Manipulating Nodes | |
| Manipulating an Entire Linked List | |
| The Bag ADT with a Linked List | |
| Programming Project: The Sequence ADT with a Linked List | |
| Arrays vs. Linked Lists vs. Doubly Linked Lists | |
| Java Objects and Iterators | |
| Java's Object Type | |
| A Bag of Objects | |
| JCL Collections and Nodes of Objects | |
| Iterators | |
| Stacks | |
| Introduction to Stacks | |
| Stack Applications | |
| Implementations of the Stack ADT | |
| More Complex Stack Applications | |
| Queues | |
| Introduction to Queues | |
| Queue Applications | |
| Implementations of the Queue | |
| ADT | |
| Priority Queues | |
| Recursive Thinking | |
| Recursive Methods | |
| Studies of Recursion: Fractals and Mazes | |
| Reasoning about Recursion | |
| Trees | |
| Introduction to Trees | |
| Tree Representations | |
| A Class for Binary Tree Nodes | |
| Tree Traversals | |
| Binary Search Trees | |
| Tree Projects | |
| Heaps | |
| B-Trees | |
| Trees, Logs, and Time Analysis | |
| Searching | |
| Serial Search and Binary Search | |
| Open-Address Hashing | |
| Using Java's Hashtable Class | |
| Chained Hashing | |
| Time Analysis of Hashing | |
| Sorting | |
| Quadratic Sorting Algorithms | |
| Recursive Sorting Algorithms | |
| An O(N LOG N) Algorithm Using a Heap | |
| Software Reuse with Extended Classes | |
| Extended Classes | |
| Simulation of an Ecosystem | |
| Using Extended Classes for ADTs | |
| Graphs | |
| Graph Definitions | |
| Graph Implementations | |
| Graph Traversals | |
| Path Algorithms | |
| Appendices | |
| Java's Primitive Types and Arithmetic Overflow | |
| Java Input | |
| Throwing and Catching Java Exceptions | |
| Java's Vector and Hashtable | |
| A Class for Nodes in a Linked List | |
| A Class for a Bag of Objects | |
| Further Big-O Notation | |
| Javadoc | |
| Table of Contents provided by Publisher. All Rights Reserved. |
