Practical Introduction to Data Structures and Algorithms : Java Edition

Shaffer, Clifford A.

ISBN 10: 0136609112 ISBN 13: 9780136609117
Editorial: Pearson Education, Limited, 1997
Usado Encuadernación de tapa dura

Librería: Better World Books: West, Reno, NV, Estados Unidos de America Calificación del vendedor: 5 de 5 estrellas Valoración 5 estrellas, Más información sobre las valoraciones de los vendedores

Vendedor de AbeBooks desde 14 de marzo de 2016

Este artículo en concreto ya no está disponible.

Descripción

Descripción:

Pages intact with minimal writing/highlighting. The binding may be loose and creased. Dust jackets/supplements are not included. Stock photo provided. Product includes identifying sticker. Better World Books: Buy Books. Do Good. N° de ref. del artículo 3120451-6

Denunciar este artículo

Sinopsis:

With an emphasis on data structures and algorithm analysis, this book includes programming examples in C++. The author concentrates on the principles required to select or design a data structure that will most effectively solve a problem.* Provides an understanding of fundamental data structures through clear explanations, illustrations, and case studies. * Uses actual Java code for nearly all algorithms. * Presents basic analysis terminology early in the text and analysis techniques throughout. The techniques provided assume a range of instructional levels so that they may be used by students with varying backgrounds in the subject. * Provides integrated treatment of both in-memory and disk- based algorithm techniques to allow students to see how these techniques are related, and the key differences between them. * Supports the concept that algorithm analysis is practical and helps in the design of real programs by presenting data structure costs and benefits. * Includes exercises as well as many suggestions for projects to provide students with hands-on experience. * Presents several new data structures, including skip lists, multidimensional search trees, and amortized analysis are discussed. * Provides a chapter on the limits of computation: a brief introduction to computability and NP-completeness to permit an easy-to-understand introduction to these topics.

Reseña del editor: With an emphasis on data structures and algorithm analysis, this book includes programming examples in C++. The author concentrates on the principles required to select or design a data structure that will most effectively solve a problem.* Provides an understanding of fundamental data structures through clear explanations, illustrations, and case studies. * Uses actual Java code for nearly all algorithms. * Presents basic analysis terminology early in the text and analysis techniques throughout. The techniques provided assume a range of instructional levels so that they may be used by students with varying backgrounds in the subject. * Provides integrated treatment of both in-memory and disk- based algorithm techniques to allow students to see how these techniques are related, and the key differences between them. * Supports the concept that algorithm analysis is practical and helps in the design of real programs by presenting data structure costs and benefits. * Includes exercises as well as many suggestions for projects to provide students with hands-on experience. * Presents several new data structures, including skip lists, multidimensional search trees, and amortized analysis are discussed. * Provides a chapter on the limits of computation: a brief introduction to computability and NP-completeness to permit an easy-to-understand introduction to these topics.

"Sobre este título" puede pertenecer a otra edición de este libro.

Detalles bibliográficos

Título: Practical Introduction to Data Structures ...
Editorial: Pearson Education, Limited
Año de publicación: 1997
Encuadernación: Encuadernación de tapa dura
Condición: Good
Edición: Java Ed.

Los mejores resultados en AbeBooks