Learning JavaScript data structures and algorithms :: understand and implement classic data structures and algorithms using JavaScript /
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.
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Birmingham [England] :
Packt Publishing,
©2014.
|
| Schriftenreihe: | Community experience distilled.
|
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Zusammenfassung: | 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. |
| Beschreibung: | 1 online resource (218 pages) |
| ISBN: | 9781783554881 1783554886 |
Internformat
MARC
| LEADER | 00000cam a2200000 a 4500 | ||
|---|---|---|---|
| 001 | ZDB-4-EBA-ocn894171181 | ||
| 003 | OCoLC | ||
| 005 | 20240705115654.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 | |
| 082 | 7 | |a 005.2/762 |2 23 | |
| 049 | |a MAIN | ||
| 100 | 1 | |a Groner, Loiane. |1 https://id.oclc.org/worldcat/entity/E39PCjwYWrb7H9dDfmfpdcyXtX |0 http://id.loc.gov/authorities/names/ns2013003583 | |
| 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) |0 http://id.loc.gov/authorities/subjects/sh96004880 | |
| 650 | 6 | |a JavaScript (Langage de programmation) | |
| 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. |0 http://id.loc.gov/authorities/names/no2011030603 | |
| 856 | 1 | |l FWS01 |p ZDB-4-EBA |q FWS_PDA_EBA |u https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=879512 |3 Volltext | |
| 856 | 1 | |l CBO01 |p ZDB-4-EBA |q FWS_PDA_EBA |u https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=879512 |3 Volltext | |
| 938 | |a EBL - Ebook Library |b EBLB |n EBL1825962 | ||
| 938 | |a ebrary |b EBRY |n ebr10962326 | ||
| 938 | |a EBSCOhost |b EBSC |n 879512 | ||
| 938 | |a ProQuest MyiLibrary Digital eBook Collection |b IDEB |n cis30008055 | ||
| 938 | |a YBP Library Services |b YANK |n 12139179 | ||
| 994 | |a 92 |b GEBAY | ||
| 912 | |a ZDB-4-EBA | ||
Datensatz im Suchindex
| DE-BY-FWS_katkey | ZDB-4-EBA-ocn894171181 |
|---|---|
| _version_ | 1813903666333089793 |
| adam_text | |
| any_adam_object | |
| author | Groner, Loiane |
| author_GND | http://id.loc.gov/authorities/names/ns2013003583 |
| author_facet | Groner, Loiane |
| author_role | |
| author_sort | Groner, Loiane |
| author_variant | l g lg |
| building | Verbundindex |
| bvnumber | localFWS |
| callnumber-first | Q - Science |
| callnumber-label | QA76 |
| callnumber-raw | QA76.73.J39 |
| callnumber-search | QA76.73.J39 |
| callnumber-sort | QA 276.73 J39 |
| callnumber-subject | QA - Mathematics |
| collection | ZDB-4-EBA |
| contents | 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 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 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 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 |
| ctrlnum | (OCoLC)894171181 |
| dewey-full | 005.2/762 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 005 - Computer programming, programs, data, security |
| dewey-raw | 005.2/762 |
| dewey-search | 005.2/762 |
| dewey-sort | 15.2 3762 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>05909cam a2200673 a 4500</leader><controlfield tag="001">ZDB-4-EBA-ocn894171181</controlfield><controlfield tag="003">OCoLC</controlfield><controlfield tag="005">20240705115654.0</controlfield><controlfield tag="006">m o d </controlfield><controlfield tag="007">cr |n|||||||||</controlfield><controlfield tag="008">141101s2014 enk o 000 0 eng d</controlfield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">EBLCP</subfield><subfield code="b">eng</subfield><subfield code="e">pn</subfield><subfield code="c">EBLCP</subfield><subfield code="d">IDEBK</subfield><subfield code="d">E7B</subfield><subfield code="d">DEBSZ</subfield><subfield code="d">CHVBK</subfield><subfield code="d">YDXCP</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">COO</subfield><subfield code="d">OCLCO</subfield><subfield code="d">N$T</subfield><subfield code="d">OCLCA</subfield><subfield code="d">UMI</subfield><subfield code="d">DEBBG</subfield><subfield code="d">TEFOD</subfield><subfield code="d">OCLCF</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">OCLCO</subfield><subfield code="d">TEFOD</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">AGLDB</subfield><subfield code="d">ICA</subfield><subfield code="d">K6U</subfield><subfield code="d">CCO</subfield><subfield code="d">PIFAG</subfield><subfield code="d">FVL</subfield><subfield code="d">ZCU</subfield><subfield code="d">MERUC</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">U3W</subfield><subfield code="d">D6H</subfield><subfield code="d">STF</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">VTS</subfield><subfield code="d">CEF</subfield><subfield code="d">ICG</subfield><subfield code="d">NLE</subfield><subfield code="d">INT</subfield><subfield code="d">VT2</subfield><subfield code="d">UKMGB</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">G3B</subfield><subfield code="d">TKN</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">UAB</subfield><subfield code="d">DKC</subfield><subfield code="d">AU@</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">M8D</subfield><subfield code="d">HS0</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">OCLCO</subfield><subfield code="d">QGK</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">OCLCO</subfield><subfield code="d">OCLCL</subfield><subfield code="d">UEJ</subfield><subfield code="d">OCLCO</subfield><subfield code="d">OCLCQ</subfield></datafield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">018006739</subfield><subfield code="2">Uk</subfield></datafield><datafield tag="019" ind1=" " ind2=" "><subfield code="a">895288515</subfield><subfield code="a">1100905951</subfield><subfield code="a">1259053415</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781783554881</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1783554886</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="z">9781783554874</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="z">1783554878</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)894171181</subfield><subfield code="z">(OCoLC)895288515</subfield><subfield code="z">(OCoLC)1100905951</subfield><subfield code="z">(OCoLC)1259053415</subfield></datafield><datafield tag="037" ind1=" " ind2=" "><subfield code="a">CL0500000502</subfield><subfield code="b">Safari Books Online</subfield></datafield><datafield tag="037" ind1=" " ind2=" "><subfield code="a">0C3D3CBD-8CA6-405D-B52F-0CFD8306CC35</subfield><subfield code="b">OverDrive, Inc.</subfield><subfield code="n">http://www.overdrive.com</subfield></datafield><datafield tag="050" ind1=" " ind2="4"><subfield code="a">QA76.73.J39</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">COM</subfield><subfield code="x">051390</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">COM</subfield><subfield code="x">051230</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">COM</subfield><subfield code="x">051440</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="082" ind1="7" ind2=" "><subfield code="a">005.2/762</subfield><subfield code="2">23</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">MAIN</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Groner, Loiane.</subfield><subfield code="1">https://id.oclc.org/worldcat/entity/E39PCjwYWrb7H9dDfmfpdcyXtX</subfield><subfield code="0">http://id.loc.gov/authorities/names/ns2013003583</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Learning JavaScript data structures and algorithms :</subfield><subfield code="b">understand and implement classic data structures and algorithms using JavaScript /</subfield><subfield code="c">Loiane Groner.</subfield></datafield><datafield tag="260" ind1=" " ind2=" "><subfield code="a">Birmingham [England] :</subfield><subfield code="b">Packt Publishing,</subfield><subfield code="c">©2014.</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource (218 pages)</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">computer</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">online resource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="347" ind1=" " ind2=" "><subfield code="a">data file</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Open source. Community experience distilled</subfield></datafield><datafield tag="588" ind1="0" ind2=" "><subfield code="a">Print version record.</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="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.</subfield></datafield><datafield tag="505" ind1="0" ind2=" "><subfield code="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</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="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</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="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</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="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</subfield></datafield><datafield tag="546" ind1=" " ind2=" "><subfield code="a">English.</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">JavaScript (Computer program language)</subfield><subfield code="0">http://id.loc.gov/authorities/subjects/sh96004880</subfield></datafield><datafield tag="650" ind1=" " ind2="6"><subfield code="a">JavaScript (Langage de programmation)</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">COMPUTERS</subfield><subfield code="x">Programming</subfield><subfield code="x">Open Source.</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">COMPUTERS</subfield><subfield code="x">Software Development & Engineering</subfield><subfield code="x">General.</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">COMPUTERS</subfield><subfield code="x">Software Development & Engineering</subfield><subfield code="x">Tools.</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">JavaScript (Computer program language)</subfield><subfield code="2">fast</subfield></datafield><datafield tag="758" ind1=" " ind2=" "><subfield code="i">has work:</subfield><subfield code="a">Learning JavaScript data structures and algorithms (Text)</subfield><subfield code="1">https://id.oclc.org/worldcat/entity/E39PCFtqDXYrMcTX9qhCkqh6YX</subfield><subfield code="4">https://id.oclc.org/worldcat/ontology/hasWork</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Print version:</subfield><subfield code="a">Groner, Loiane.</subfield><subfield code="t">Learning JavaScript Data Structures and Algorithms.</subfield><subfield code="d">Birmingham : Packt Publishing, ©2014</subfield><subfield code="z">9781783554874</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Community experience distilled.</subfield><subfield code="0">http://id.loc.gov/authorities/names/no2011030603</subfield></datafield><datafield tag="856" ind1="1" ind2=" "><subfield code="l">FWS01</subfield><subfield code="p">ZDB-4-EBA</subfield><subfield code="q">FWS_PDA_EBA</subfield><subfield code="u">https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=879512</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="856" ind1="1" ind2=" "><subfield code="l">CBO01</subfield><subfield code="p">ZDB-4-EBA</subfield><subfield code="q">FWS_PDA_EBA</subfield><subfield code="u">https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=879512</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">EBL - Ebook Library</subfield><subfield code="b">EBLB</subfield><subfield code="n">EBL1825962</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">ebrary</subfield><subfield code="b">EBRY</subfield><subfield code="n">ebr10962326</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">EBSCOhost</subfield><subfield code="b">EBSC</subfield><subfield code="n">879512</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">ProQuest MyiLibrary Digital eBook Collection</subfield><subfield code="b">IDEB</subfield><subfield code="n">cis30008055</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">YBP Library Services</subfield><subfield code="b">YANK</subfield><subfield code="n">12139179</subfield></datafield><datafield tag="994" ind1=" " ind2=" "><subfield code="a">92</subfield><subfield code="b">GEBAY</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-4-EBA</subfield></datafield></record></collection> |
| id | ZDB-4-EBA-ocn894171181 |
| illustrated | Not Illustrated |
| indexdate | 2024-10-25T16:22:18Z |
| institution | BVB |
| isbn | 9781783554881 1783554886 |
| language | English |
| oclc_num | 894171181 |
| open_access_boolean | |
| owner | MAIN |
| owner_facet | MAIN |
| physical | 1 online resource (218 pages) |
| psigel | ZDB-4-EBA |
| publishDate | 2014 |
| publishDateSearch | 2014 |
| publishDateSort | 2014 |
| publisher | Packt Publishing, |
| record_format | marc |
| series | Community experience distilled. |
| series2 | Open source. Community experience distilled |
| spelling | Groner, Loiane. https://id.oclc.org/worldcat/entity/E39PCjwYWrb7H9dDfmfpdcyXtX http://id.loc.gov/authorities/names/ns2013003583 Learning JavaScript data structures and algorithms : understand and implement classic data structures and algorithms using JavaScript / Loiane Groner. Birmingham [England] : Packt Publishing, ©2014. 1 online resource (218 pages) text txt rdacontent computer c rdamedia online resource cr rdacarrier data file Open source. Community experience distilled Print version record. 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. 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 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 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 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 English. JavaScript (Computer program language) http://id.loc.gov/authorities/subjects/sh96004880 JavaScript (Langage de programmation) COMPUTERS Programming Open Source. bisacsh COMPUTERS Software Development & Engineering General. bisacsh COMPUTERS Software Development & Engineering Tools. bisacsh JavaScript (Computer program language) fast has work: Learning JavaScript data structures and algorithms (Text) https://id.oclc.org/worldcat/entity/E39PCFtqDXYrMcTX9qhCkqh6YX https://id.oclc.org/worldcat/ontology/hasWork Print version: Groner, Loiane. Learning JavaScript Data Structures and Algorithms. Birmingham : Packt Publishing, ©2014 9781783554874 Community experience distilled. http://id.loc.gov/authorities/names/no2011030603 FWS01 ZDB-4-EBA FWS_PDA_EBA https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=879512 Volltext CBO01 ZDB-4-EBA FWS_PDA_EBA https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=879512 Volltext |
| spellingShingle | Groner, Loiane Learning JavaScript data structures and algorithms : understand and implement classic data structures and algorithms using JavaScript / Community experience distilled. 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 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 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 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 JavaScript (Computer program language) http://id.loc.gov/authorities/subjects/sh96004880 JavaScript (Langage de programmation) COMPUTERS Programming Open Source. bisacsh COMPUTERS Software Development & Engineering General. bisacsh COMPUTERS Software Development & Engineering Tools. bisacsh JavaScript (Computer program language) fast |
| subject_GND | http://id.loc.gov/authorities/subjects/sh96004880 |
| title | Learning JavaScript data structures and algorithms : understand and implement classic data structures and algorithms using JavaScript / |
| title_auth | Learning JavaScript data structures and algorithms : understand and implement classic data structures and algorithms using JavaScript / |
| title_exact_search | Learning JavaScript data structures and algorithms : understand and implement classic data structures and algorithms using JavaScript / |
| title_full | Learning JavaScript data structures and algorithms : understand and implement classic data structures and algorithms using JavaScript / Loiane Groner. |
| title_fullStr | Learning JavaScript data structures and algorithms : understand and implement classic data structures and algorithms using JavaScript / Loiane Groner. |
| title_full_unstemmed | Learning JavaScript data structures and algorithms : understand and implement classic data structures and algorithms using JavaScript / Loiane Groner. |
| title_short | Learning JavaScript data structures and algorithms : |
| title_sort | learning javascript data structures and algorithms understand and implement classic data structures and algorithms using javascript |
| title_sub | understand and implement classic data structures and algorithms using JavaScript / |
| topic | JavaScript (Computer program language) http://id.loc.gov/authorities/subjects/sh96004880 JavaScript (Langage de programmation) COMPUTERS Programming Open Source. bisacsh COMPUTERS Software Development & Engineering General. bisacsh COMPUTERS Software Development & Engineering Tools. bisacsh JavaScript (Computer program language) fast |
| topic_facet | JavaScript (Computer program language) JavaScript (Langage de programmation) COMPUTERS Programming Open Source. COMPUTERS Software Development & Engineering General. COMPUTERS Software Development & Engineering Tools. |
| url | https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=879512 |
| work_keys_str_mv | AT gronerloiane learningjavascriptdatastructuresandalgorithmsunderstandandimplementclassicdatastructuresandalgorithmsusingjavascript |