Robert Lafore “Data Structures and Algorithms in Java (2nd Edition) "Sams | 2002-11-16 | ISBN: 0672324539 | PDF | 800 pages | 3,5 Mb
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 in the Instructor Resource Center.
This section is intended for teachers and others who want a quick overview of the contents of the book. It assumes you’re already familiar with the topics and terms involved in a study of data structures and algorithms.
The first two chapters are intended to ease the reader into data structures and algorithms as painlessly as possible.
Chapter 1, “Overview,” presents an overview of the topics to be discussed and introduces a small number of terms that will be needed later on. For readers unfamiliar with object-oriented programming, it summarizes those aspects of this discipline that will be needed in the balance of the book, and for programmers who know C++ but not Java, the key differences between these languages are reviewed.
Chapter 2, “Arrays,” focuses on arrays. However, there are two subtexts: the use of classes to encapsulate data storage structures and the class interface. Searching, insertion, and deletion in arrays and ordered arrays are covered. Linear searching and binary searching are explained. Workshop applets demonstrate these algorithms with unordered and ordered arrays.
In Chapter 3, “Simple Sorting,” we introduce three simple (but slow) sorting techniques: the bubble sort, selection sort, and insertion sort. Each is demonstrated by a Workshop applet.
Chapter 4, “Stacks and Queues,” covers three data structures that can be thought of as Abstract Data Types (ADTs): the stack, queue, and priority queue. These structures reappear later in the book, embedded in various algorithms. Each is demonstrated by
if you like it, you buy it
(Download)
