3 Review(s)

Continuing the success of the popular second edition, the updated and revised Object-Oriented Data Structures Using Java TM, 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, making Object-Oriented Data Structure using Java TM Third Edition a must –have resource for computer science students learning this popular programming language. New and Key Features of the Revised Third Edition: Includes Java generics in Chapter 3 and expands upon their use throughout the text. Includes a new section on concurrency and synchronization Sections have been expanded or modified to increase clarity and student retention. Includes additional code examples and programming exercises, including several project – type exercises. Incorporates an accessible, student friendly writing style with real world case studies Each case study includes a problem description, an analysis of the problem input and required output, and a discussion of the appropriate data structures to use. Chapters conclude with a summary that highlights the most important topics of the chapter and ties together related topics Includes revised end of chapter question and exercises throughout Instructor’s Resource include an instructor’s manual, test bank, and Microsoft PowerPoint slides About the Author 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 and writing. 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 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. Table of Contents 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 Searching Algorithms Appendix A: Java Reserved Words Appendix B: Operator Precedence Appendix C: Primitive Data Types Appendix D: ASCII Subset of Unicode Appendix E: Application of Programmer Interfaces for the Java Classes and Interfaces Used in This Book Index