Data Structures in Java

Standish, Thomas A

ISBN 10: 020130564X / ISBN 13: 9780201305647

Editore: Addison Wesley Publishing Company, Reading, MA, 1997

Riguardo questo articolo

Sewn binding. Cloth over boards. 555 p. Contains: Illustrations. Audience: General/trade. No previous owner's name. Clean, tight pages. No bent corners. eb 51.

Codice articolo Alibris.0035034

Dati bibliografici

• Titolo: Data Structures in Java
• Editore: Addison Wesley Publishing Company, Reading, MA
• Data di pubblicazione: 1997
• Lingua: Inglese
• ISBN 10: 020130564X
• ISBN 13: 9780201305647
• Rilegatura: Hard cover
• Condizione: Fine. No dust jacket.

Descrizione articolo

Riassunto

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.

L'autore

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