Data Structures Using Java

Written in an engaging and informal style, this new text is sure to successfully transition your students from writing simple programs in the first semester introductory programming course to writing more sophisticated, efficient, and effective programs in the second semester Data Structures course. Without delving too deep into the details of Java, the author emphasizes the importance of effective orgranization and management of data and writing programs to more efficiently organize and manage the data. Designed to correlate to the curricular guidelines of the ACM/IEEE Computer Science Curriculum 2008, Data Stuctures Using Java introduces students to the more advanced concepts of writing programs while still being accessible to non-computer science majors. Believing that learning how to design and write programs requires hands-on application of concepts, the author includes labs throughtout the text for students to immediately apply and test the newly learned knowledge.The accessible writing style and hands-on approach of Data Structures Using Java, will provide your students with the skills necessary to design and use algorithms and data structures in their programming careers in an uncluttered environment, and efficient manner.Key Features:-Content is mapped to the learning objectives of the curricular guidelines of the 2008 ACM/IEEE Computer Science Curriculum.-Avoids much of the advanced theory to provide students with the practical skills required to write algorithms and create data structures, in a one-term CS2 course.-Ideal for students who want to begin their programming professions immediately-Includes lab exercises throughout for students to apply the newly learned concepts.-Forthcoming instructor resources include Microsoft PowerPoint slides, solutions to the chapter exercises, test bank, and the source code needed for the programming exercises.

Chapter1 Introduction
Chapter2 A Review of Java
Chapter3 Flat Files
Chapter4 Arrays and Linked Lists
Chapter5 Generics, Collections, and Testing
Chapter6 Estimating Asymptotic Efficiency
Chapter7 Stacks and Queues
Chapter8 Recursion
Chapter9 A First Look at Graphs
Chapter10 Trees
Chapter11 Sorting
Chapter12 Searching
Chapter13 Graphs
AppendixA The Author's Idiosyncrasies of Coding Style
AppendixB File Utilities
AppendixC Jargon Terms