Page Tools:

Object-Oriented Data Structures Using Java, Third Edition

Author(s): Nell Dale, PhD, University of Texas, Austin
Daniel T. Joyce, Villanova University
Chip Weems, University of Massachusetts, Amherst
Details:
  • ISBN-13: 9781449613549
  • Hardcover    802 pages      © 2012
Price: International Sales $178.95 US List
Add to Cart Request a Review Copy

Continuing the success of the popular second edition, the updated and revised Object-Oriented Data Structures Using Java, Third Edition is sure to be an essential resource for students learning data structures using the Java programming language. It presents traditional data structures and object-oriented topics with an emphasis on problem-solving, theory, and software engineering principles. Beginning early and continuing throughout the text, the authors introduce and expand upon the use of many Java features including packages, interfaces, abstract classes, inheritance, and exceptions. Numerous case studies provide readers with real-world examples and demonstrate possible solutions to interesting problems.  The authors' lucid writing style guides readers through the rigor of standard data structures and presents essential concepts from logical, applications, and implementation levels.  Key concepts throughout the Third Edition have been clarified to increase student comprehension and retention, and end-of-chapter exercises have been updated and modified.

 

Instructor resources include:

  • Answers to the exercises in the text
  • Glossary of terms
  • PowerPoint® slides
  • Test bank

Features & Benefits

  • Includes the use of generics throughout the text, providing the dual benefits of allowing for a type safe use of data structures plus exposing students to modern approaches.
  • This text is among the first data structures textbooks to address the topic of concurrency and synchonization, which are growing in the importance as computer systems move to using more cores and threads to obtain additional performance with each new generation. Concurrency and synchonization are introduced in the new Section 5.7, where it begins with the basics of Java threads.
  • Provides numerous case studies and examples of the problem solving process. Each case study includes problem description, an analysis of the problem input and required output, and a discussion of the appropriate data structures to use.
  • Expanded chapter exercises allow you as the instructor to reinforce topics for your students using both theoretical and practical questions.
  • Chapters conclude with a chapter summary that highlights the most important topics of the chapter and ties together related topics.
Chapter  1  Getting Organized
Chapter  2  Abstract Data Types
Chapter  3  The Stack ADT
Chapter  4  Recursion
Chapter  5  The Queue ADT
Chapter  6  The List ADT
Chapter  7  More Lists
Chapter  8  Binary Search Trees
Chapter  9  Priority Queues, Heaps, and Graphs
Chapter  10  Sorting and Search Algorithms

Nell Dale, PhD-University of Texas, Austin


Nell Dale received a B.S. in Mathematics and Psychology from the University of Houston, a M.A. in Mathematics, from the University of Texas at Austin, and a Ph.D. in Computer Sciences from the University of Texas at Austin. Nell Dale has been on the faculty at the University of Texas, Austin since 1975. She teaches occasionally but concentrates on computer science education, writing, traveling, tennis, and bridge -- and her family of course.

Additional Titles by this Author

Daniel T. Joyce-Villanova University


Daniel Joyce is an Associate Professor with the Computing Science department at Villanova University. He enjoys managing the departments' project-based courses.  Joyce's research interests are in software engineering with a focus in software requirements identification.  He is also active in the computer science education community.

Chip Weems-University of Massachusetts, Amherst

Chip Weems is an Associate Professor of computer science at the University of Massachusetts at Amherst. He received his Bachelor's and Master's degrees from Oregon State University in 1977 and 1979, respectively. He received a Ph.D. from the University of Massachusetts in 1984. Over the last 23 years, he has taught courses in introductory programming, software engineering, computer architecture, and parallel processing. Since 1986 he has co-authored 13 textbooks that have helped over a million students learn to program computers. His books have been translated into French, Spanish, and Russian. He conducts research in computer architecture, compilers, parallel processing, and compiler-architecture co-optimization.

Additional Titles by this Author
  • All computer science curricula contain courses on algorithms and data structures. This work has all the content needed to be the main textbook for such courses. Java is a popular choice among programming languages; it is object oriented and strongly typed. As such, it is ideal for getting students into the right habits to follow in programming, and it is a useful language for student labs and projects. This book provides excellent guidance on how to conceive of abstractions, and how to structure algorithms around those abstractions. Dale, Joyce, and Weems cover all the classic data structures and algorithms. Topics discussed include lists, stacks, queues, hashes, B-trees, graphs, and various approaches for searching and sorting. This book also contains a good set of illustrations and code samples. This new edition contains updated chapter exercises and enhanced explanations of key concepts. The level of the material is well suited for use by second-year computer science students and above.

    -F.H. Wild III, University of Rhode Island

The following instructor resources are available to qualified instructors for download

ISBN-13: 9781449613549

Additional Resources for Instructors
Answers to End of Chapter Questions
Powerpoint™
Test Bank