Business Analysis for Information Technology
Books and Selected Products
Sams
November 2002
Hardcover, 800 pages
ISBN: 0672324539

Description
Appropriate for all courses in data structures and algorithms, and for many intermediate–to–advanced level courses in Java programming.
Many students view data structures and algorithms as difficult to understand, but this book thoroughly demystifies them. Working in Java, Robert Lafore presents each essential data structure and algorithm, using clear and simple example programs accessible through a Web browser–based “Workshop Applets.” These programs demonstrate graphically exactly what each data structure looks like and how it works. Coverage includes: arrays, stacks, queues, simple and advanced sorts, linked lists, recursion, binary trees, red–black trees, 2–3–4 trees, external storage, hash tables, heaps, weighted graphs, and more. For this Second Edition, Lafore has rewritten each program to improve its operation, clarify the algorithms it illustrates, and reflect the latest versions of the Java 2 SDK. Lafore has also added brand–new questions and exercises at the end of every chapter. The result: students gain deep mastery over today‘s best practices and approaches for manipulating virtually any form of data with Java.
Features
Presents state–of–the–art techniques students can rely upon for many years to come.
Helps students review the material and confirm that they understand it in detail.
Illuminates all the algorithms and data structures students will need to manipulate any kind of data with Java.
Brings algorithms and data structures to life, making them easier than ever for students to understand.
New To This Edition
Presents state–of–the–art techniques students can rely upon for many years to come.
Helps students review the material and confirm that they understand it in detail.
Backcover Copy
Data Structures and Algorithms in Java, Second Edition is designed to be easy to read and understand although the topic itself is complicated. Algorithms are the procedures that software programs use to manipulate data structures. Besides clear and simple example programs, the author includes a workshop as a small demonstration program executable on a Web browser. The programs demonstrate in graphical form what data structures look like and how they operate. In the second edition, the program is rewritten to improve operation and clarify the algorithms, the example programs are revised to work with the latest version of the Java JDK, and questions and exercises will be added at the end of each chapter making the book even more useful.
Educational Supplement
Suggested solutions to the programming projects found at the end of each chapter are made available to instructors at recognized educational institutions. This educational supplement can be found at www.prenhall.com, in the Instructor Resource Center.
Author Bios
Robert Lafore has degrees in Electrical Engineering and Mathematics, has worked as a systems analyst for the Lawrence Berkeley Laboratory, founded his own software company, and is a best–selling writer in the field of computer programming. Some of his current titles are C++ Interactive Course and Object–Oriented Programming in C++. Earlier best–selling titles include Assembly Language Primer for the IBM PC and XT and (back at the beginning of the computer revolution) Soul of CP/M.