MARC details
| 000 -CABECERA |
|---|
| campo de control de longitud fija |
05692 a2200277 4500 |
| 008 - DATOS DE LONGITUD FIJA--INFORMACIÓN GENERAL |
|---|
| campo de control de longitud fija |
2014 |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER |
|---|
| International Standard Book Number |
9781783554874 |
| 040 ## - FUENTE DE CATALOGACIÓN |
|---|
| Centro catalogador/agencia de origen |
GAMADERO |
| Lengua de catalogación |
spa |
| Centro/agencia transcriptor |
GAMADERO |
| 041 ## - CÓDIGO DE IDIOMA |
|---|
| Código de lengua del texto/banda sonora o título independiente |
Español |
| 050 00 - SIGNATURA TOPOGRÁFICA DE LA BIBLIOTECA DEL CONGRESO |
|---|
| Número de clasificación |
QA76.73 J39 2014 |
| 100 ## - ENTRADA PRINCIPAL--NOMBRE DE PERSONA |
|---|
| Nombre de persona |
LOIANE GRONER |
| 245 ## - MENCIÓN DEL TÍTULO |
|---|
| Título |
LEARNING JAVA SCRIPT DARA ESTRUCTURES AND ALGORITH / |
| 250 ## - MENCION DE EDICION |
|---|
| Mención de edición |
1RA |
| 260 ## - PUBLICACIÓN, DISTRIBUCIÓN, ETC. |
|---|
| Nombre del editor, distribuidor, etc. |
PACKT |
| Lugar de publicación, distribución, etc. |
UK |
| Fecha de publicación, distribución, etc. |
2014 |
| 300 ## - DESCRIPCIÓN FÍSICA |
|---|
| Extensión |
201 |
| Otras características físicas |
ILUSTRACION |
| Dimensiones |
19 X 23.5 CM |
| 504 ## - NOTA DE BIBLIOGRAFÍA, ETC. |
|---|
| Nota de bibliografía, etc. |
Formato<br/>Libro Físico<br/>Autor<br/>Loiane Groner <br/>Editorial<br/>Packt Publishing<br/>Idioma<br/>Inglés<br/>N° páginas<br/>218<br/>Encuadernación<br/>Tapa Blanda<br/>Dimensiones<br/>23.5 x 19.1 x 1.2 cm<br/>Peso<br/>0.38 kg.<br/>ISBN13<br/>9781783554874 |
| 505 ## - NOTA DE CONTENIDO CON FORMATO |
|---|
| Nota de contenido con formato |
Learning JavaScript Data Structures and Algorithms<br/>Table of Contents<br/>Learning JavaScript Data Structures and Algorithms<br/>Credits<br/>About the Author<br/>Acknowledgments<br/>About the Reviewers<br/>www.PacktPub.com<br/>Support files, eBooks, discount offers, and more<br/>Why subscribe?<br/>Free access for Packt account holders<br/>Preface<br/>What this book covers<br/>What you need for this book<br/>Who this book is for<br/>Conventions<br/>Reader feedback<br/>Customer support<br/>Downloading the example code<br/>Downloading the color images of this book<br/>Errata<br/>Piracy<br/>Questions<br/>1. JavaScript – A Quick Overview<br/>Setting up the environment<br/>The browser is enough<br/>Using web servers (XAMPP)<br/>It's all about JavaScript (Node.js)<br/>JavaScript basics<br/>Variables<br/>Variable scope<br/>Operators<br/>Truthy and falsy<br/>The equals operators (== and ===)<br/>Control structures<br/>Conditional statements<br/>Loops<br/>Functions<br/>Object-oriented programming<br/>Debugging and tools<br/>Summary<br/>2. Arrays<br/>Why should we use arrays?<br/>Creating and initializing arrays<br/>Adding and removing elements<br/>Two-dimensional and multi-dimensional arrays<br/>References for JavaScript array methods<br/>Joining multiple arrays<br/>Iterator functions<br/>Searching and sorting<br/>Custom sorting<br/>Sorting strings<br/>Searching<br/>Outputting the array into a string<br/>Summary<br/>3. Stacks<br/>Creating a stack<br/>The complete Stack class<br/>Using the Stack class<br/>Decimal to binary<br/>Summary<br/>4. Queues<br/>Creating a queue<br/>The complete Queue class<br/>Using the Queue class<br/>The priority queue<br/>The circular queue – Hot Potato<br/>Summary<br/>5. Linked Lists<br/>Creating a linked list<br/>Appending elements to the end of the linked list<br/>Removing elements from the linked list<br/>Inserting an element at any position<br/>Implementing other methods<br/>The toString method<br/>The indexOf method<br/>The isEmpty, size, and getHead methods<br/>Doubly linked lists<br/>Inserting a new element at any position<br/>Removing elements from any position<br/>Circular linked lists<br/>Summary<br/>6. Sets<br/>Creating a set<br/>The has (value) method<br/>The add method<br/>The remove and clear methods<br/>The size method<br/>The values method<br/>Using the Set class<br/>Set operations<br/>Set union<br/>Set intersection<br/>Set difference<br/>Subset<br/>Summary<br/>7. Dictionaries and Hashes<br/>Dictionaries<br/>Creating a dictionary<br/>The has and set methods<br/>The remove method<br/>The get and values methods<br/>The clear, size, keys, and getItems methods<br/>Using the Dictionary class<br/>The hash table<br/>Creating a hash table<br/>Using the HashTable class<br/>Hash table versus hash set<br/>Handling collisions between hash tables<br/>Separate chaining<br/>The put method<br/>The get method<br/>The remove method<br/>Linear probing<br/>The put method<br/>The get method<br/>The remove method<br/>Creating better hash functions<br/>Summary<br/>8. Trees<br/>Trees terminology<br/>Binary tree and binary search tree<br/>Creating the BinarySearchTree class<br/>Inserting a key in a tree<br/>Tree traversal<br/>In-order traversal<br/>Pre-order traversal<br/>Post-order traversal<br/>Searching for values in a tree<br/>Searching for minimum and maximum values<br/>Searching for a specific value<br/>Removing a node<br/>Removing a leaf node<br/>Removing a node with a left or right child<br/>Removing a node with two children<br/>More about binary trees<br/>Summary<br/>9. Graphs<br/>Graph terminology<br/>Directed and undirected graphs<br/>Representing a graph<br/>The adjacency matrix<br/>The adjacency list<br/>The incidence matrix<br/>Creating the Graph class<br/>Graph traversals<br/>Breadth-first search (BFS)<br/>Finding the shortest paths using BFS<br/>Further studies on the shortest paths algorithms<br/>Depth-first search (DFS)<br/>Exploring the DFS algorithm<br/>Topological sorting using DFS<br/>Summary<br/>10. Sorting and Searching Algorithms<br/>Sorting algorithms<br/>Bubble sort<br/>Improved bubble sort<br/>Selection sort<br/>Insertion sort<br/>Merge sort<br/>Quick sort<br/>The partition process<br/>Quick sort in action<br/>Searching algorithms<br/>Sequential search<br/>Binary search<br/>Summary<br/>Index<br/> |
| 520 ## - RESUMEN, ETC. |
|---|
| Resumen, etc. |
Description<br/>If you are a JavaScript developer or someone who has basic knowledge of JavaScript, and want to explore its optimum ability, this fast-paced book is definitely for you. Programming logic is the only thing you need to know to start having fun with algorithms.<br/>What you will learn<br/>Declare, initialize, add, and remove items from arrays, stacks, and queues<br/>Create and use the most complex data structure, graphs, along with DFS and BFS algorithms<br/>Grasp the power of linked lists, doubly linked lists, and circular linked lists<br/>Store unique elements with hash tables, dictionaries, and sets<br/>Explore the applications of binary trees and binary search trees<br/>Sort data structures using bubble sort, selection sort, insertion sort, merge sort, and quick sort<br/>Search elements in data structures using sequential sort and binary search<br/>Understand the importance of big O notation, dynamic programming, and greedy algorithms |
| 526 ## - NOTA DE INFORMACIÓN SOBRE EL PROGRAMA DE ESTUDIO |
|---|
| Program name |
Ingenieria en Gestion Empresarial |
| 650 #0 - PUNTO DE ACCESO ADICIONAL DE MATERIA--TÉRMINO DE MATERIA |
|---|
| Término de materia o nombre geográfico como elemento de entrada |
ALGORITHMS |
| 9 (RLIN) |
792 |
| 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 |
1RA |
| Parte de la signatura que corresponde a la clasificación (Parte de la clasificación) |
QA76.73 J39 |
| 945 ## - CATALOGADORES |
|---|
| Número del Creador del Registro |
1 |
| Nombre del Creador del Registro |
admin |
| Número de último modificador del registro |
1260 |
| Nombre del último modificador del registro |
Norma Gabriela Corona Arreguin |
