Schaum's Outline of Data Structures with Java, 2ed

by John R. Hubbard

Overview

Tough Test Questions? Missed Lectures? Not Enough Time?

Fortunately for you, there's Schaum's Outlines. More than 40 million students have trusted Schaum's to help them succeed in the classroom and on exams. Schaum's is the key to faster learning and higher grades in every subject. Each Outline presents all the essential course information in an easy-to-follow, topic-by-topic format. You also get hundreds of examples, solved problems, and practice exercises to test your skills.

This Schaum's Outline gives you

• Practice problems with full explanations that reinforce knowledge
• Coverage of the most up-to-date developments in your course field
• In-depth review of practices and applications

Fully compatible with your classroom text, Schaum's highlights all the important facts you need to know. Use Schaum's to shorten your study time-and get your best test scores!

Schaum's Outlines-Problem Solved.

Product Details

ISBN-13:	9780071611619
Publisher:	McGraw Hill LLC
Publication date:	06/19/2009
Series:	Schaum's Outline Series
Edition description:	New Edition
Pages:	360
Product dimensions:	8.10(w) x 10.70(h) x 0.90(d)

About the Author

JOHN R> HUBBARD is professor of mathematics and Computer Science at the University of Richmond. He received his Ph.D from the University of Michigan (1973) and has been a member of the richmond faculty since 1983.His primary interests are in numerial algorithms and database systems. Dr. Hubbard is the author of severalother books, including Schaum's Outline of programming with C++, Schaum's Outline of Fumdamentals of Computing with C++, Schaum,s Outline of Data Structure with C++, and Schaum's Outline of Data Structures with Java.

Table of Contents

Schaum's Outline of Data Structures with Java, 2edChapter 1. Advanced JavaChapter 2. Object-Oriented ProgrammingChapter 3. Abstract Data TypesChapter 4. Generics in JavaChapter 5. Linked StructuresChapter 6. StacksChapter 7. QueuesChapter 8. CollectionsChapter 9. ListsChapter 10. Hash TablesChapter 11. RecursionChapter 12. TreesChapter 13. Binary TreesChapter 14. Search TreesChapter 15. Heaps and Priority QueuesChapter 16. SortingChapter 17. SetsChapter 18. Graphs