|Data Structures and Algorithms in Java||
Data Structures and Algorithms in Java
|99.10||approx. 7-9 days|
An abundance of unique, interesting examples, use of the Unified Modeling Language throughout, and the newest Java 1.5 features characterize this text. Drake provides a concise and engaging introduction to Java and object-oriented programming, assuming familiarity with the basic control structures of Java or C and only a pre-calculus level of mathematics.
Five-part structure using the “inverted pyramid” style – Covers object-oriented programming, linear structures, algorithms, trees and collections, and advanced topics, addressing critical concepts up front.
• New Java 1.5 features (generics, autoboxing, Scanner, enhanced for loop) – Keeps both instructor and student up-to-date.
• Extensive use of games as examples – Captures students’ interest and imagination with realistic challenges involving dice, cards, and boards.
• Numerous diagrams – Illustrate key concepts, provide an instant review, and serve as a landmark when reviewing the text.
• Practical approach to real-world programming – Allows readers to compile and run a program as quickly as possible, rather than focusing on abstract software engineering techniques.
• Frequent, early examples in each chapter – Let students to absorb abstract concepts in the context of concrete problems.
• Process of crafting programs – Works through the development of each project, often providing multiple versions of the code and considering alternate designs, to give students experience in the processof crafting programs rather than just the results.
• Use of Unified Modeling Language throughout – Introduces student to the industry standard for diagrams of classes and class relationships.
• Clear, concise presentation – Addresses one data structure at a time.
• Gradual development of classes analogous to the Java Collections Framework – Allows students to see how the data structure or algorithm works, then learn to use the built-in
• Complete, working code in text and online – Provides access to code even when students are not in front of a computer. Includes complete code for B-trees.
• Strong pedagogy – Features at least one extended example in almost every chapter, in addition to exercises at the end of every section and problems and projects at the end of every chapter.
• Introduces generic types (Chapter 4) – Allows a programmer to specify the element type of a collection, improving both program clarity and type safety.
• Solutions manual – Saves instructors valuable classroom preparation time.