MARC details
| 000 -CABECERA |
|---|
| campo de control de longitud fija |
03724 a2200277 4500 |
| 008 - DATOS DE LONGITUD FIJA--INFORMACIÓN GENERAL |
|---|
| campo de control de longitud fija |
250318s########|||||||||||||||||||||||#d |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER |
|---|
| International Standard Book Number |
0-471-19308-9 |
| 040 ## - FUENTE DE CATALOGACIÓN |
|---|
| Centro catalogador/agencia de origen |
GAMADERO2 |
| Lengua de catalogación |
spa |
| Centro/agencia transcriptor |
GAMADERO2 |
| 100 ## - ENTRADA PRINCIPAL--NOMBRE DE PERSONA |
|---|
| Nombre de persona |
Michael T. Goodrich |
| 245 ## - MENCIÓN DEL TÍTULO |
|---|
| Título |
Data Structures and algorithms in JAVA / |
| 250 ## - MENCION DE EDICION |
|---|
| Mención de edición |
1 |
| 260 ## - PUBLICACIÓN, DISTRIBUCIÓN, ETC. |
|---|
| Nombre del editor, distribuidor, etc. |
John Wiley and sons |
| Lugar de publicación, distribución, etc. |
Mexico |
| Fecha de publicación, distribución, etc. |
1999 |
| 300 ## - DESCRIPCIÓN FÍSICA |
|---|
| Extensión |
738 |
| Otras características físicas |
Ilustraciones, tablas, graficos |
| Dimensiones |
24cm |
| 490 0# - MENCIÓN DE SERIE |
|---|
| Mención de serie |
series |
| 504 ## - NOTA DE BIBLIOGRAFÍA, ETC. |
|---|
| Nota de bibliografía, etc. |
Editorial <br/>John Wiley and sons<br/>ISBN <br/>0-471-19308-9 |
| 505 ## - NOTA DE CONTENIDO CON FORMATO |
|---|
| Nota de contenido con formato |
1 Design Principles<br/><br/>1.1 Data Structures and Algorithms<br/><br/>1.2 Object-Oriented Design Principles<br/><br/>1.3 Object-Oriented Design Techniques.<br/><br/>1.4 Java Examples of Object-Oriented Design<br/><br/>1.5 Object-Oriented Design Patterns<br/><br/>1.6 Exercises<br/><br/>2 Analysis Tools<br/><br/>2.1 What Is Running Time Anyway?<br/><br/>2.2 Pseudo-Code.<br/><br/>2.3 A Quick Mathematical Review<br/><br/>2.4 Simple Justification Techniques<br/><br/>*<br/><br/>2.5 Analysis of Algorithms.<br/><br/>2.6 Asymptotic Notation<br/><br/>2.7 Asymptotic Analysis<br/><br/>2.8 Exercises<br/><br/>3 Stacks, Queues, and Linked Lists<br/><br/>3.1 Stacks<br/><br/>3.2 Queues.<br/><br/>3.3 Linked Lists<br/><br/>3.4 Double-Ended Queues<br/><br/>3.5 Case Study: A Stock Analysis Applet.<br/><br/>3.6 Exercises<br/><br/>4 Sequences<br/><br/>4.1 Ranked Sequences<br/><br/>4.2 Positional Sequences<br/><br/>4.3 General Sequences<br/><br/>4.4 Case Study: Bubble-Sort on a Sequence<br/><br/>4.5 Iterators and Enumerations<br/><br/>4.6 Exercises<br/><br/>5 Trees<br/><br/>5.1 The Tree Abstract Data Type<br/><br/>5.2 Basic Algorithms on Trees.<br/><br/>5.3 Binary Trees,<br/><br/>5.4 Data Structures for Representing Trees<br/><br/>5.5 An Applet that Draws a Binary Tree *<br/><br/>5.6 Exercises<br/><br/>6 Priority Queues<br/><br/>6.1 The Priority Queue Abstract Data Type<br/><br/>6.2 Implementing a Priority Queue with a Sequence<br/><br/>6.3 Heaps<br/><br/>6.4 The Locator Design Pattern *<br/><br/>6.5 Exercises<br/><br/>7 Dictionaries<br/><br/>7.1 The Dictionary Abstract Data Type<br/><br/>7.2 Implementing a Dictionary with a Sequence<br/><br/>7.3 Binary Search Trees..<br/><br/>7.4 AVL Trees<br/><br/>7.5 Skip Lists<br/><br/>7.6 Hash Tables<br/><br/>7.7 Supporting Locators in a Dictionary *<br/><br/>7.8 Exercises<br/><br/>8 Sorting, Sets, and Selection<br/><br/>8.1 Merge-Sort<br/><br/>8.2 Sets<br/><br/>8.3 Quick-Sort<br/><br/>8.4 A Lower Bound on Comparison-Based Sorting<br/><br/>8.5 Bucket-Sort and Radix-Sort<br/><br/>8.6 Selection<br/><br/>8.7 Exercises<br/><br/> |
| 520 ## - RESUMEN, ETC. |
|---|
| Resumen, etc. |
The design and analysis of efficient data structures has long been recognized as a key subject in computer science, for the study of data structures is part of the core of every collegiate computer science major or minor program we are famil-iar with. Typically, in programs based upon semesters, elementary data structures are briefly introduced in the first programming or introduction to computer science course (CS1), and this is followed by a more in-depth introduction to data structures course (CS2). Furthermore, this introductory course is typically listed as a prereq-uisite for a host of other courses, and is often itself followed at a later point in the curriculum by a more in-depth study of data structures and algorithms (DS&A). Curricula based upon the quarter system follow a similar approach, but divide the subject matter into more courses. In either case, however, we feel that the central role of data structure design and analysis in the curriculum is fully justified, given the importance of efficient data structures in most software systems, including op-erating systems, databases, compilers, and scientific simulation systems. |
| 526 ## - NOTA DE INFORMACIÓN SOBRE EL PROGRAMA DE ESTUDIO |
|---|
| Program name |
Ingeniería en Tecnologías de la Información y Comunicación |
| 650 #0 - PUNTO DE ACCESO ADICIONAL DE MATERIA--TÉRMINO DE MATERIA |
|---|
| Término de materia o nombre geográfico como elemento de entrada |
Ingeniería en tecnologias de la información y comunicaciones |
| 9 (RLIN) |
585 |
| 700 ## - ENTRADA AGREGADA--NOMBRE PERSONAL |
|---|
| Nombre de persona |
Roberto Tamassia |
| 942 ## - ELEMENTOS DE ENTRADA SECUNDARIOS (KOHA) |
|---|
| Tipo de ítem Koha |
Libro |
| Fuente del sistema de clasificación o colocación |
Clasificación Decimal Dewey |
| Edición |
1ERA EDICION |
| 945 ## - CATALOGADORES |
|---|
| Número del Creador del Registro |
1 |
| Nombre del Creador del Registro |
admin |
| Número de último modificador del registro |
1261 |
| Nombre del último modificador del registro |
Jenny Viridiana Quiroz Linares |
