|
|
|
|
| LEADER |
00000cam a2200000 a 4500 |
| 001 |
ocn894171181 |
| 003 |
OCoLC |
| 005 |
20240909213021.0 |
| 006 |
m o d |
| 007 |
cr |n||||||||| |
| 008 |
141101s2014 enk o 000 0 eng d |
| 040 |
|
|
|a EBLCP
|b eng
|e pn
|c EBLCP
|d IDEBK
|d E7B
|d DEBSZ
|d CHVBK
|d YDXCP
|d OCLCQ
|d COO
|d OCLCO
|d N$T
|d OCLCA
|d UMI
|d DEBBG
|d TEFOD
|d OCLCF
|d OCLCQ
|d OCLCO
|d TEFOD
|d OCLCQ
|d AGLDB
|d ICA
|d K6U
|d CCO
|d PIFAG
|d FVL
|d ZCU
|d MERUC
|d OCLCQ
|d U3W
|d D6H
|d STF
|d OCLCQ
|d VTS
|d CEF
|d ICG
|d NLE
|d INT
|d VT2
|d UKMGB
|d OCLCQ
|d G3B
|d TKN
|d OCLCQ
|d UAB
|d DKC
|d AU@
|d OCLCQ
|d M8D
|d HS0
|d OCLCQ
|d OCLCO
|d QGK
|d OCLCQ
|d OCLCO
|d OCLCL
|d UEJ
|d OCLCO
|d OCLCQ
|
| 016 |
7 |
|
|a 018006739
|2 Uk
|
| 019 |
|
|
|a 895288515
|a 1100905951
|a 1259053415
|
| 020 |
|
|
|a 9781783554881
|q (electronic bk.)
|
| 020 |
|
|
|a 1783554886
|q (electronic bk.)
|
| 020 |
|
|
|z 9781783554874
|
| 020 |
|
|
|z 1783554878
|
| 035 |
|
|
|a (OCoLC)894171181
|z (OCoLC)895288515
|z (OCoLC)1100905951
|z (OCoLC)1259053415
|
| 037 |
|
|
|a CL0500000502
|b Safari Books Online
|
| 037 |
|
|
|a 0C3D3CBD-8CA6-405D-B52F-0CFD8306CC35
|b OverDrive, Inc.
|n http://www.overdrive.com
|
| 050 |
|
4 |
|a QA76.73.J39
|
| 072 |
|
7 |
|a COM
|x 051390
|2 bisacsh
|
| 072 |
|
7 |
|a COM
|x 051230
|2 bisacsh
|
| 072 |
|
7 |
|a COM
|x 051440
|2 bisacsh
|
| 049 |
|
|
|a HCDD
|
| 100 |
1 |
|
|a Groner, Loiane.
|1 https://id.oclc.org/worldcat/entity/E39PCjwYWrb7H9dDfmfpdcyXtX
|
| 245 |
1 |
0 |
|a Learning JavaScript data structures and algorithms :
|b understand and implement classic data structures and algorithms using JavaScript /
|c Loiane Groner.
|
| 260 |
|
|
|a Birmingham [England] :
|b Packt Publishing,
|c ©2014.
|
| 300 |
|
|
|a 1 online resource (218 pages)
|
| 336 |
|
|
|a text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a computer
|b c
|2 rdamedia
|
| 338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
| 347 |
|
|
|a data file
|
| 490 |
1 |
|
|a Open source. Community experience distilled
|
| 588 |
0 |
|
|a Print version record.
|
| 520 |
|
|
|a 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.
|
| 505 |
0 |
|
|a Cover; Copyright; Credits; About the Author; Acknowledgments; About the Reviewers; www.PacktPub.com; Table of Contents; Preface; Chapter 1: JavaScript -- A Quick Overview; Setting up the environment; The browser is enough; Using web servers (XAMPP); It's all about JavaScript (Node.js); JavaScript basics; Variables; Variable scope; Operators; Truthy and falsy; The equals operators (== and ===); Control structures; Conditional statements; Loops; Functions; Object-oriented programming; Debugging and tools; Summary; Chapter 2: Arrays; Why should we use arrays?; Creating and initializing arrays
|
| 505 |
8 |
|
|a Adding and removing elementsTwo-dimensional and multi-dimensional arrays; Reference for JavaScript array methods; Joining multiple arrays; Iterator functions; Searching and sorting; Custom sorting; Sorting strings; Searching; Outputting the array into a string; Summary; Chapter 3: Stacks; Creating a stack; The complete Stack class; Using the Stack class; Decimal to binary; Summary; Chapter 4: Queues; Creating a queue; The complete Queue class; Using the Queue class; Priority queue; Circular queue -- Hot Potato; Summary; Chapter 5: Linked Lists; Creating a linked list
|
| 505 |
8 |
|
|a Appending elements to the end of the linked listRemoving elements from the linked list; Inserting an element at any position; Implementing other methods; The toString method; The indexOf method; The isEmpty, size, and getHead methods; Doubly linked lists; Inserting a new element at any position; Removing elements from any position; Circular linked lists; Summary; Chapter 6: Sets; Creating a set; The has (value) method; The add method; The remove and clear methods; The size method; The values method; Using the Set class; Set operations; Set union; Set intersection; Set difference; Subset
|
| 505 |
8 |
|
|a In-order traversalPre-order traversal; Post-order traversal; Searching for values in a tree; Searching for minimum and maximum values; Searching for a specific value; Removing a node; Removing a leaf node; Removing a node with a left or right child; Removing a node with two children; More about binary trees; Summary; Chapter 9: Graphs; Graph terminology; Directed and undirected graphs; Representing a graph; Adjacency matrix; Adjacency list; Incidence matrix; Creating the Graph class; Graph traversals; Breadth-first search (BFS); Finding the shortest paths using BFS
|
| 546 |
|
|
|a English.
|
| 650 |
|
0 |
|a JavaScript (Computer program language)
|
| 650 |
|
7 |
|a COMPUTERS
|x Programming
|x Open Source.
|2 bisacsh
|
| 650 |
|
7 |
|a COMPUTERS
|x Software Development & Engineering
|x General.
|2 bisacsh
|
| 650 |
|
7 |
|a COMPUTERS
|x Software Development & Engineering
|x Tools.
|2 bisacsh
|
| 650 |
|
7 |
|a JavaScript (Computer program language)
|2 fast
|
| 758 |
|
|
|i has work:
|a Learning JavaScript data structures and algorithms (Text)
|1 https://id.oclc.org/worldcat/entity/E39PCFtqDXYrMcTX9qhCkqh6YX
|4 https://id.oclc.org/worldcat/ontology/hasWork
|
| 776 |
0 |
8 |
|i Print version:
|a Groner, Loiane.
|t Learning JavaScript Data Structures and Algorithms.
|d Birmingham : Packt Publishing, ©2014
|z 9781783554874
|
| 830 |
|
0 |
|a Community experience distilled.
|
| 856 |
4 |
0 |
|u https://ebookcentral.proquest.com/lib/holycrosscollege-ebooks/detail.action?docID=1825962
|y Click for online access
|
| 903 |
|
|
|a EBC-AC
|
| 994 |
|
|
|a 92
|b HCD
|