|
|
||
![]() |
||
| HELP | ||
|
$87.00 List price:
HARDCOVER, USED
Ships in 1 to 3 days
available for shipping or prepaid pickup only
Available for In-store Pickup
in 7 to 12 days
More copies of this ISBN:Practical Introduction To Data Structures and Algorithm Analysis (98 Edition)by Clifford A. Shaffer
Synopses & ReviewsPlease note that used books may not include additional media (study guides, CDs, DVDs, solutions manuals, etc.) as described in the publisher comments.
Publisher Comments: The author, Cliff Shaffer provides a superior learning tool for those who desire more rigorous data structures and an algorithm analysis book utilizing Java. While the author covers most of the standard data structures, he concentrates on teaching the principles required to select or design a data structure that will best solve a problem. The emphasis is on data structures, and algorithm analysis, not teaching Java. Java is utilized strictly as a tool to illustrate data structures concepts and only the minimal, useful subset of Java is included. Book News Annotation:In this text for a single-semester undergraduate course, or for self-
study by technical professionals, Shaffer (computer science, Virginia
Tech) discusses numerous techniques for representing data, covering
most standard data structures. He writes the programming examples in
Java, and appends a description of the Java syntax and concepts
needed to understand the program examples. Assumes two semesters of
experience in a structured programming language, such as Pascal or C.
Annotation c. Book News, Inc., Portland, OR (booknews.com) Synopsis:This volume provides an understanding of fundamental data structures through clear explanations, illustrations, and case studies. The author also concentrates on teaching the principles required to select or design a data structure that will best solve a problem. The emphasis is on data structures and algorithm analysis, not teaching Java.
Table of ContentsPreface.
I. PRELIMINARIES. 1. Data Structures and Algorithms.
2. Mathematical Preliminaries.
3. Algorithm Analysis.
II. FUNDAMENTAL DATA STRUCTURES. 4. Lists, Stacks, and Queues.
5. Binary Trees.
6. General Trees.
7. Graphs.
III. SORTING AND SEARCHING. 8. Internal Sorting.
9. File Processing and External Sorting.
10. Searching.
11. Indexing.
IV. APPLICATIONS AND ADVANCED TOPICS. 12. Lists and Arrays Revisited.
13. Advanced Tree Structures.
14. Analysis Techniques.
15. Limits to Computation.
V. APPENDIX. A. Java Tutorial for C and Pascal Programmers.
Bibliography.
Index. What Our Readers Are SayingBe the first to add a comment for a chance to win!Product Details
Related Aisles | ||||||||||||
|
| |||||||||||||
|
|
|||||||||||||