Book description
With an accessible writing style and manageable amount of content, Data Structures and Algorithms Using Java is the ideal text for your course. This outstanding text correlates to the recommended syllabus put forth by the Association of Computing Machinery standard curriculum guidelines. The author has produced a resource that is more readable and instructional than any other, without compromising the scope of the ACM CS103, Data Structures and Algorithms, course material. The text’s unique, student-friendly pedagogical approach and organizational structure will keep students engaged in the process of self-directed investigative discovery both inside and outside the classroom.
The pedagogical features of the text, based on the author’s 30 years of teaching experience, include succinct code examples, a unique common template used as the organizational basis of each chapter, the use of pseudocode to present the major algorithms developed in the text, nearly 300 carefully designed figures, and a concise review of Java.
Table of contents
- Cover Page
- Title Page
- Copyright Page
- Dedecation Page
- Contents
- Preface
-
Chapter 1 - Overview and Java Review
- 1.1 - Data Structures
- 1.2 - Selecting a Data Structure
- 1.3 - Fundamental Concepts
- 1.4 - Calculating Speed (Time Complexity)
- 1.5 - Calculating Memory Overhead (Space Complexity)
-
1.6 - Java Review
- 1.6.1 - Arrays of Primitive Variables
- 1.6.2 - Definition of a Class
- 1.6.3 - Declaration of an Object
- 1.6.4 - Accessing Objects
- 1.6.5 - Standard Method Name Prefixes
- 1.6.6 - Shallow and Deep Copies
- 1.6.7 - Declaration of an Array of Objects
- 1.6.8 - Objects that Contain Objects as Data Members
- 1.6.9 - Classes that Extend Classes, Inheritance
- 1.6.10 - Parent and Child References
- 1.6.11 - Generic Types
- Knowledge Exercises
- Programming Exercises
- Chapter 2 - Array-Based Structures
- Chapter 3 - Restricted Structures
- Chapter 4 - Linked Lists and Iterators
- Chapter 5 - Hashed Data Structures
- Chapter 6 - Recursion
- Chapter 7 - Trees
- Chapter 8 - Sorting
- Chapter 9 - Graphs
-
Appendices
- Appendix A - ASCII Table
- Appendix B - Derivation of the Average Search Length of a Nondirect Hashed Data Structure
- Appendix C - Proof That If an Integer, P, is not Evenly Divisible by an Integer Less Than the Square Root of P, It is a Prime Number
- Appendix D - Calculations to Show That (n + 1) (log2(n + 1) − 2) is the Minimum Sort Effort for the Binary Tree Sort
- Glossary
- Index
Product information
- Title: Data Structures and Algorithms Using Java
- Author(s):
- Release date: December 2008
- Publisher(s): Jones & Bartlett Learning
- ISBN: 9781449612863
You might also like
book
Java 9 Data Structures and Algorithms
Gain a deep understanding of the complexity of data structures and algorithms and discover the right …
book
A Practical Guide to Data Structures and Algorithms using Java
Although traditional texts present isolated algorithms and data structures, they do not provide a unifying structure …
book
Beginning Java Data Structures and Algorithms
Though your application serves its purpose, it might not be a high performer. Learn techniques to …
book
Object-Oriented Data Structures Using Java, 4th Edition
Object-Oriented Data Structures Using Java, Fourth Edition presents traditional data structures and object-oriented topics with an …