Imagen de portada de Amazon
Imagen de Amazon.com

A practical guide to data structures and algorithms using Java / Sally Goldman, Kenneth Goldman.

Por: Colaborador(es): Tipo de material: TextoTextoSeries The Chapman & Hall/CRC applied algorithms and data structures seriesEditor: Boca Raton : Chapman & Hall/CRC, c2008Descripción: xxvii, 1026 páginas : ilustraciones + 1 CD-ROM (4 3/4 in.)Tipo de contenido:
  • texto
Tipo de medio:
  • no mediado
Tipo de soporte:
  • volumen
ISBN:
  • 158488455X
  • 9781584884552
Tema(s): Clasificación CDD:
  • 005.133 G619p 2008
Recursos en línea:
Contenidos:
Pt. I. Introduction -- Design principles -- Selecting an abstract data type -- How to use this book -- Pt. II. Collection data structures and algorithms -- Part II organization -- Foundations -- Partition ADT and the union-find data structure -- Collection of elements -- Abstract collection -- Positional collection ADT -- Abstract positional collection -- Array data structure -- Circular array data structure -- Dynamic array and dynamic circular array data structures -- Tracked array data structure -- Singly linked list data structure -- Doubly linked list data structure -- Buffer ADT and its implementation -- Queue ADT and implementation -- Stack ADT and implementation -- Set ADT -- Direct addressing data structure -- Open addressing data structure -- Separate chaining data structure -- Priority queue ADT -- Binary heap data structure -- Leftist heap data structure -- Pairing heap data structure -- Fibonacci heap data structure -- Ordered collection ADT -- Sorted array data structure -- Abstract search tree class -- Binary search tree data structure -- Balanced binary search trees -- Red-black tree data structure -- Splay tree data structure -- B-tree data structure -- B+-tree data structure -- Skip list data structure -- Digitized ordered collection ADT -- Trie node types -- Trie data structure -- Compact trie data structure -- Compressed trie data structure -- Patricia trie data structure -- Ternary search trie data structure -- Spatial collection ADT -- KD-tree data structure -- Quad tree data structure -- Tagged collection ADTs -- Tagged bucket collection ADTs -- Pt. III. Graph data structures and algorithms -- Part III organization -- Graph ADT -- Abstract graph and graph algorithms -- Adjacency matrix data structure -- Adjacency list data structure -- Weighted graph ADT -- Abstract weighted graph and weighted graph algorithms -- Pt. IV. Appendices: A. Java fundamentals -- B. Complexity analysis -- C. Design patterns illustrated in this book.
Etiquetas de esta biblioteca: No hay etiquetas de esta biblioteca para este título. Ingresar para agregar etiquetas.
Valoración
    Valoración media: 0.0 (0 votos)
Existencias
Tipo de ítem Biblioteca actual Colección Signatura topográfica Copia número Estado Notas Fecha de vencimiento Código de barras Reserva de ítems
Libro Biblioteca Central Colección General 005.133 G619p 2008 (Navegar estantería(Abre debajo)) Disponible GEN 33409002404352
CD-ROM Biblioteca Central Material Complementario 005.133 G619p 2008 (Navegar estantería(Abre debajo)) cd-rom Disponible CD-ROM 33409002416349
Total de reservas: 0

Incluye bibliografía (p. 997-1004).

Pt. I. Introduction -- Design principles -- Selecting an abstract data type -- How to use this book -- Pt. II. Collection data structures and algorithms -- Part II organization -- Foundations -- Partition ADT and the union-find data structure -- Collection of elements -- Abstract collection -- Positional collection ADT -- Abstract positional collection -- Array data structure -- Circular array data structure -- Dynamic array and dynamic circular array data structures -- Tracked array data structure -- Singly linked list data structure -- Doubly linked list data structure -- Buffer ADT and its implementation -- Queue ADT and implementation -- Stack ADT and implementation -- Set ADT -- Direct addressing data structure -- Open addressing data structure -- Separate chaining data structure -- Priority queue ADT -- Binary heap data structure -- Leftist heap data structure -- Pairing heap data structure -- Fibonacci heap data structure -- Ordered collection ADT -- Sorted array data structure -- Abstract search tree class -- Binary search tree data structure -- Balanced binary search trees -- Red-black tree data structure -- Splay tree data structure -- B-tree data structure -- B+-tree data structure -- Skip list data structure -- Digitized ordered collection ADT -- Trie node types -- Trie data structure -- Compact trie data structure -- Compressed trie data structure -- Patricia trie data structure -- Ternary search trie data structure -- Spatial collection ADT -- KD-tree data structure -- Quad tree data structure -- Tagged collection ADTs -- Tagged bucket collection ADTs -- Pt. III. Graph data structures and algorithms -- Part III organization -- Graph ADT -- Abstract graph and graph algorithms -- Adjacency matrix data structure -- Adjacency list data structure -- Weighted graph ADT -- Abstract weighted graph and weighted graph algorithms -- Pt. IV. Appendices: A. Java fundamentals -- B. Complexity analysis -- C. Design patterns illustrated in this book.

No hay comentarios en este titulo.

para colocar un comentario.

Con tecnología Koha