Written in an engaging and informal style, Data Structures Using Java facilitates a student's transition from simple programs in the first semester introductory programming course to more sophisticated, efficient, and effective programs in the second semester data structures course. Without delving too deeply into the details of Java, the author emphasizes the importance of effective organization and management of data and the importance of writing programs in a modern, object-oriented style.
Designed to correlate with the curricular guidelines of the ACM/IEEE Computer Science Curriculum 2008, Data Structures Using Java introduces students to the more advanced concepts of writing programs but is still 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 throughout the text for students to immediately apply and test the newly learned material.
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.
Preview Content Now! Scroll to the Samples tab below to preview the preface and sample chapters.
Features & Benefits
- Content correlates 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 enter the programming profession immediately
- Includes lab exercises throughout for students to apply the newly learned concepts.
- Instructor resources include PowerPoint lecture outlines, solutions to the chapter exercises, test bank, and the source code needed for the programming exercises.
Chapter 1 Introduction
Chapter 2 A Review of Java
Chapter 3 Flat Files
Chapter 4 Arrays and Linked Lists
Chapter 5 Generics, Collections, and Testing
Chapter 6 Estimating Asymptotic Efficiency
Chapter 7 Stacks and Queues
Chapter 8 Recursion
Chapter 9 A First Look at Graphs
Chapter 10 Trees
Chapter 11 Sorting
Chapter 12 Searching
Chapter 13 Graphs
Appendix A The Author's Idiosyncrasies of Coding Style
Appendix B File Utilities
Appendix C Jargon Terms
Duncan A. Buell, PhD-University of South Carolina
Professor Buell has taught at universities in Illinois, Ontario, Ohio, and Louisiana in addition to the University of South Carolina, where he was chair of the Department of Computer Science and Engineering for nine years. He also worked for fifteen years at the Institute for Defense Analyses in high performance computing and computational mathematics in support of the National Security Agency. At IDA he managed the Splash 2 reconfigurable computing project and was part of a team that received a Meritorious Unit Citation from DCI George Tenet for the result of “the largest single computation in the history of [the United States intelligence] community.” He is currently focusing his research on electronic voting machines and digital humanities.