Practical Introduction to Data Structures and Algorithms with Java

Prentice Hall, 2010. – 620 p. – 3rd ed. – ISBN: 0136609112, 9780136609117 This book is intended as a teaching text. I believe it is more important for a practitioner to understand the principles required to select or design the data structure that will best solve some problem than it is to memorize a lot of textbook implementations. Hence, I have designed this as a teaching text that covers most standard data structures, but not all. A few data structures that are not widely adopted are included to illustrate important principles. Some relatively new data structures that should become widely used in the future are included. Within an undergraduate program, this textbook is designed for use in either an advanced lower division (sophomore or junior level) data structures course, or for a senior level algorithms course. New material has been added in the third edition to support its use in an algorithms course. Normally, this text would be used in a course beyond the standard freshman level "CS2" course that often serves as the initial introduction to data structures. Readers of this book should have programming experience, typically two semesters or the equivalent of a structured programming language such as Pascal or C, and including at least some exposure to Java. Readers who are already familiar with recursion will have an advantage. Students of data structures will also benefit from having first completed a good course in Discrete Mathematics. Contents: Preface Preliminaries Data Structures and Algorithms Mathematical Preliminaries Algorithm Analysis Fundamental Data Structures Lists, Stacks, and Queues Binary Trees Non-Binary Trees Sorting and Searching Internal Sorting File Processing and External Sorting Searching Indexing Advanced Data Structures Graphs Lists and Arrays Revisited Advanced Tree Structures Theory of Algorithms Analysis Techniques Lower Bounds Patterns of Algorithms Limits to Computation Bibliography Index

the Author, Cliff Shaffer Provides A Superior Learning Tool For Those Who Desire More Rigorous Data Structures And An Algorithm Analysis Book Utilizing Java.

while The Author Covers Most Of The Standard Data Structures, He Concentrates On Teaching The Principles Required To Select Or Design A Data Structure That Will Best Solve A Problem. The Emphasis Is On Data Structures, And Algorithm Analysis, Not Teaching Java. Java Is Utilized Strictly As A Tool To Illustrate Data Structures Concepts And Only The Minimal, Useful Subset Of Java Is Included.

this Is An Undergraduate Text That Focuses On The Analysis Of Fundamental Data Structures And Algorithms Using A Cost/benefit Approach Emphasizing Software Engineering Principles And Programming Efficiencies. Please Note That Code Examples Are In Java. Familiarity With Programming Concepts From Prerequisite Courses Assumed. The Text Places Strong Emphasis On Tradeoffs, Common Practices And Application Needs, With Respect To Data Structures. It Introduces Basic Concepts Of Algorithm Analysis And Analytical Techniques Before Discussing The Fundamental Properties Of Data Structures. Then It Uses These Basic Analytical Techniques In Discussions And Comparisons Of Lists, Stacks And Queues. The Book Also Examines Binary Trees, Their Properties And Implementation, And Builds Upon Binary Trees To Discuss General Trees And Graphs. It Goes On To Explain Internal And External Sorting, Searching And Indexing. The Author Is Associated With Virginia Tech.

The author, Cliff Shaffer provides a superior learning tool for those who desire more rigorous data structures and an algorithm analysis book utilizing Java. While the author covers most of the standard data structures, he concentrates on teaching the principles required to select or design a data structure that will best solve a problem. The emphasis is on data structures, and algorithm analysis, not teaching Java. Java is utilized strictly as a tool to illustrate data structures concepts and only the minimal, useful subset of Java is included. "Clifford A. Shaffer thoroughly covers fundamental data structures and the principles of algorithm analysis. The author focuses on teaching the principles required to select or design the data structure that will best solve a particular problem and includes numerous illustrations, case studies, projects, and practice problems. This text is appropriate for sophomore or junior level students in computer science or professionals."--Jacket This volume provides an understanding of fundamental data structures through clear explanations, illustrations, and case studies. The author also concentrates on teaching the principles required to select or design a data structure that will best solve a problem. The emphasis is on data structures and algorithm analysis, not teaching Java.