Data Structures and Algorithms Using Java

by William McAllister

Overview

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.

Product Details

ISBN-13:	9780763757564
Publisher:	Jones & Bartlett Learning
Publication date:	12/31/2008
Edition description:	1E
Pages:	580
Product dimensions:	7.30(w) x 9.00(h) x 1.40(d)

About the Author

William McAllister has been a full-time faculty member at St. Joseph's College, NY, for the past 13 years and an adjunct professor at Suffolk County Community College for the past 30 years. He has taught a variety of computer science courses including data structures. For the past eight years, he has served as the Associate Chairperson of the Mathematics and Computer Science Department at St. Joseph's College, and is currently the co-principal investigator on a $500,000 grant from the National Science Foundation aimed at improving the number of skilled computer professionals in the national workforce. Prior to joining St. Joseph's he worked in industry for 27 years, initially as an engineer and then as a computer scientist. His areas of expertise are algorithm development, pedagogy, and curriculum development. He is very active in student programming competitions both on the collegiate and high school levels, and founded and annually conducts an ACM-sanctioned Long Island Regional High School Programming Competition, coaches the St. Joseph's intercollegiate programming team, and conducted the 2007 CCSC Eastern Regional programming competition.

Table of Contents

Preface
Chapter 1 Overview and Java Review
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
Appendix Appendices