Data Structures in Java by Thomas A Standish
Using Java 1.1, this book teaches the fundamentals of data structures and algorithms. With this exciting new language, Tim Standish takes a fresh look at the subject matter. New challenges arise any time a new language is used, and the author meets these challenges. For example, although Java is a language without explicit pointers, this book offers pointer diagrams to help students visualize, reason about, and understand this major Data Structures topic. Standish's clear presentation helps readers tie the many concepts of data structures together with recurring themes. Central ideas-such as modularity, levels of abstraction, efficiency, and tradeoffs-serve as integrators in the book in order to tie the material together conceptually and to reveal its underlying unity and interrelationships.Thomas A. Standish is the chairman of computer science at the University of California, Irvine. In 1990-91, he became the fourth winner of University of California Irvine's Distinguished Faculty Lectureship for Teaching, the campus' highest distinction for teaching excellence. He has also been a co-winner of his department's best-teacher award, chosen by the popular vote of University of California Irvine undergraduate computer science students.
020130564XAB04062001
| SKU | Unavailable |
| ISBN 13 | 9780201305647 |
| ISBN 10 | 020130564X |
| Title | Data Structures in Java |
| Author | Thomas A Standish |
| Condition | Unavailable |
| Binding Type | Hardback |
| Publisher | Pearson Education (US) |
| Year published | 1997-09-03 |
| Number of pages | 555 |
| Cover note | Book picture is for illustrative purposes only, actual binding, cover or edition may vary. |
| Note | Unavailable |