Data structures and algorithms with JavaScript: [bringing classic computing approaches to the Web]
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Beijing [u.a.]
O'Reilly
2014
|
| Ausgabe: | 1. ed. |
| Schlagworte: | |
| Online-Zugang: | Inhaltsverzeichnis |
| Beschreibung: | XIV, 229 S. graph. Darst. |
| ISBN: | 9781449364939 1449364934 |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV041805446 | ||
| 003 | DE-604 | ||
| 005 | 20140725 | ||
| 007 | t | ||
| 008 | 140416s2014 d||| |||| 00||| eng d | ||
| 015 | |a GBB3A1752 |2 dnb | ||
| 020 | |a 9781449364939 |9 978-1-449-36493-9 | ||
| 020 | |a 1449364934 |9 1-4493-6493-4 | ||
| 035 | |a (OCoLC)862760398 | ||
| 035 | |a (DE-599)BVBBV041805446 | ||
| 040 | |a DE-604 |b ger |e rakwb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-83 |a DE-1050 |a DE-Aug4 |a DE-573 | ||
| 082 | 0 | |a 005.73 |2 23 | |
| 084 | |a ST 250 |0 (DE-625)143626: |2 rvk | ||
| 100 | 1 | |a Macmillan, Michael |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Data structures and algorithms with JavaScript |b [bringing classic computing approaches to the Web] |c Michael McMillan |
| 250 | |a 1. ed. | ||
| 264 | 1 | |a Beijing [u.a.] |b O'Reilly |c 2014 | |
| 300 | |a XIV, 229 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 650 | 0 | 7 | |a JavaScript |0 (DE-588)4420180-1 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a JavaScript |0 (DE-588)4420180-1 |D s |
| 689 | 0 | |5 DE-604 | |
| 856 | 4 | 2 | |m HBZ Datenaustausch |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=027250925&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-027250925 | ||
Datensatz im Suchindex
| _version_ | 1804152128083591168 |
|---|---|
| adam_text | Titel: Data structures and algorithms with JavaScript
Autor: Macmillan, Michael
Jahr: 2014
Table of Contents Preface....................................................................... ix 1. The JavaScript Programming Environment and Model............................ 1 The JavaScript Environment 1 JavaScript Programming Practices 2 Declaring and Intializing Variables 3 Arithmetic and Math Library Functions in JavaScript 3 Decision Constructs 4 Repetition Constructs 6 Functions 7 Variable Scope 8 Recursion 10 Objects and Object-Oriented Programming 10 Summary 12 2. Arrays.................................................................... 13 JavaScript Arrays Defined 13 Using Arrays 13 Creating Arrays 14 Accessing and Writing Array Elements 15 Creating Arrays from Strings 15 Aggregate Array Operations 16 Accessor Functions 17 Searching for a Value 17 String Representations of Arrays 18 Creating New Arrays from Existing Arrays 18 Mutator Functions 19 Adding Elements to an Array 19 Removing Elements from an Array 20 iii
Adding and Removing Elements from the Middle of an Array 21 Putting Array Elements in Order 22 Iterator Functions 23 Non-Array-Generating Iterator Functions 23 Iterator Functions That Return a New Array 25 Two-Dimensional and Multidimensional Arrays 27 Creating Two-Dimensional Arrays 27 Processing Two-Dimensional Array Elements 28 Jagged Arrays 30 Arrays of Objects 30 Arrays in Objects 31 Exercises 33 3. Lists...................................................................... 35 A List ADT 35 A List Class Implementation 36 Append: Adding an Element to a List 37 Remove: Removing an Element from a List 37 Find: Finding an Element in a List 38 Length: Determining the Number of Elements in a List 38 toString: Retrieving a List’s Elements 38 Insert: Inserting an Element into a List 39 Clear: Removing All Elements from a List 39 Contains: Determining if a Given Value Is in a List 40 Traversing a List 40 Iterating Through a List 41 A List-Based Application 42 Reading Text Files 42 Using Lists to Manage a Kiosk 43 Exercises 47 4. Stacks.................................................................... 49 Stack Operations 49 A Stack Implementation 50 Using the Stack Class 53 Multiple Base Conversions 53 Palindromes 54 Demonstrating Recursion 56 Exercises 57 5. Queues................................................................... 59 Queue Operations 59 IV Table of Contents
An Array-Based Queue Class Implementation 60 Using the Queue Class: Assigning Partners at a Square Dance 63 Sorting Data with Queues 67 Priority Queues 70 Exercises 72 6. Linked Lists................................................................73 Shortcomings of Arrays 73 Linked Lists Defined 74 An Object-Based Linked List Design 75 The Node Class 75 The Linked List Class 76 Inserting New Nodes 76 Removing Nodes from a Linked List 78 Doubly Linked Lists 81 Circularly Linked Lists 85 Other Linked List Functions 86 Exercises 86 7. Dictionaries............................................................... 89 The Dictionary Class 89 Auxiliary Functions for the Dictionary Class 91 Adding Sorting to the Dictionary Class 93 Exercises 94 8. Hashing...................................................................97 An Overview of Hashing 97 A Hash Table Class 98 Choosing a Hash Function 98 A Better Hash Function 101 Hashing Integer Keys 103 Storing and Retrieving Data in a Hash Table 106 Handling Collisions 107 Separate Chaining 107 Linear Probing 109 Exercises 111 9. Sets..................................................................... 113 Fundamental Set Definitions, Operations, and Properties 113 Set Definitions 113 Set Operations 114 The Set Class Implementation 114 Table of Contents | v
More Set Operations Exercises 116 120 10. Binary Trees and Binary Search Trees......................................... 121 Trees Defined 121 Binary Trees and Binary Search Trees 123 Building a Binary Search Tree Implementation 124 Traversing a Binary Search Tree 126 BST Searches 129 Searching for the Minimum and Maximum Value 130 Searching for a Specific Value 131 Removing Nodes from a BST 132 Counting Occurrences 134 Exercises 137 11. Graphs and Graph Algorithms............................................... 139 Graph Definitions 139 Real-World Systems Modeled by Graphs 141 The Graph Class 141 Representing Vertices 141 Representing Edges 142 Building a Graph 143 Searching a Graph 145 Depth-First Search 145 Breadth-First Search 148 Finding the Shortest Path 149 Breadth-First Search Leads to Shortest Paths 149 Determining Paths 150 Topological Sorting 151 An Algorithm for Topological Sorting 152 Implementing the Topological Sorting Algorithm 152 Exercises 157 12. Sorting Algorithms........................................................ 159 An Array Test Bed 159 Generating Random Data 161 Basic Sorting Algorithms 161 Bubble Sort 162 Selection Sort 165 Insertion Sort 167 l iming Comparisons of the Basic Sorting Algorithms 168 Advanced Sorting Algorithms 170 vi 1 Table of Contents
The Shellsort Algorithm 171 The Mergesort Algorithm 176 The Quicksort Algorithm 181 Exercises 186 13. Searching Algorithms...................................................... 187 Sequential Search 187 Searching for Minimum and Maximum Values 190 Using Self-Organizing Data 193 Binary Search 196 Counting Occurrences 200 Searching Textual Data 202 Exercises 205 14. Advanced Algorithms.................................................... 207 Dynamic Programming 207 A Dynamic Programming Example: Computing Fibonacci Numbers 208 Finding the Longest Common Substring 211 The Knapsack Problem: A Recursive Solution 214 The Knapsack Problem: A Dynamic Programming Solution 215 Greedy Algorithms 217 A First Greedy Algorithm Example: The Coin-Changing Problem 217 A Greedy Algorithm Solution to the Knapsack Problem 218 Exercises 220 Index....................................................................... 221 Table of Contents I vli
|
| any_adam_object | 1 |
| author | Macmillan, Michael |
| author_facet | Macmillan, Michael |
| author_role | aut |
| author_sort | Macmillan, Michael |
| author_variant | m m mm |
| building | Verbundindex |
| bvnumber | BV041805446 |
| classification_rvk | ST 250 |
| ctrlnum | (OCoLC)862760398 (DE-599)BVBBV041805446 |
| dewey-full | 005.73 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 005 - Computer programming, programs, data, security |
| dewey-raw | 005.73 |
| dewey-search | 005.73 |
| dewey-sort | 15.73 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik |
| edition | 1. ed. |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01353nam a2200361 c 4500</leader><controlfield tag="001">BV041805446</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20140725 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">140416s2014 d||| |||| 00||| eng d</controlfield><datafield tag="015" ind1=" " ind2=" "><subfield code="a">GBB3A1752</subfield><subfield code="2">dnb</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781449364939</subfield><subfield code="9">978-1-449-36493-9</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1449364934</subfield><subfield code="9">1-4493-6493-4</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)862760398</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV041805446</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-83</subfield><subfield code="a">DE-1050</subfield><subfield code="a">DE-Aug4</subfield><subfield code="a">DE-573</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">005.73</subfield><subfield code="2">23</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 250</subfield><subfield code="0">(DE-625)143626:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Macmillan, Michael</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Data structures and algorithms with JavaScript</subfield><subfield code="b">[bringing classic computing approaches to the Web]</subfield><subfield code="c">Michael McMillan</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">1. ed.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Beijing [u.a.]</subfield><subfield code="b">O'Reilly</subfield><subfield code="c">2014</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XIV, 229 S.</subfield><subfield code="b">graph. Darst.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">JavaScript</subfield><subfield code="0">(DE-588)4420180-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">JavaScript</subfield><subfield code="0">(DE-588)4420180-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">HBZ Datenaustausch</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=027250925&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-027250925</subfield></datafield></record></collection> |
| id | DE-604.BV041805446 |
| illustrated | Illustrated |
| indexdate | 2024-07-10T01:05:47Z |
| institution | BVB |
| isbn | 9781449364939 1449364934 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-027250925 |
| oclc_num | 862760398 |
| open_access_boolean | |
| owner | DE-83 DE-1050 DE-Aug4 DE-573 |
| owner_facet | DE-83 DE-1050 DE-Aug4 DE-573 |
| physical | XIV, 229 S. graph. Darst. |
| publishDate | 2014 |
| publishDateSearch | 2014 |
| publishDateSort | 2014 |
| publisher | O'Reilly |
| record_format | marc |
| spelling | Macmillan, Michael Verfasser aut Data structures and algorithms with JavaScript [bringing classic computing approaches to the Web] Michael McMillan 1. ed. Beijing [u.a.] O'Reilly 2014 XIV, 229 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier JavaScript (DE-588)4420180-1 gnd rswk-swf JavaScript (DE-588)4420180-1 s DE-604 HBZ Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=027250925&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Macmillan, Michael Data structures and algorithms with JavaScript [bringing classic computing approaches to the Web] JavaScript (DE-588)4420180-1 gnd |
| subject_GND | (DE-588)4420180-1 |
| title | Data structures and algorithms with JavaScript [bringing classic computing approaches to the Web] |
| title_auth | Data structures and algorithms with JavaScript [bringing classic computing approaches to the Web] |
| title_exact_search | Data structures and algorithms with JavaScript [bringing classic computing approaches to the Web] |
| title_full | Data structures and algorithms with JavaScript [bringing classic computing approaches to the Web] Michael McMillan |
| title_fullStr | Data structures and algorithms with JavaScript [bringing classic computing approaches to the Web] Michael McMillan |
| title_full_unstemmed | Data structures and algorithms with JavaScript [bringing classic computing approaches to the Web] Michael McMillan |
| title_short | Data structures and algorithms with JavaScript |
| title_sort | data structures and algorithms with javascript bringing classic computing approaches to the web |
| title_sub | [bringing classic computing approaches to the Web] |
| topic | JavaScript (DE-588)4420180-1 gnd |
| topic_facet | JavaScript |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=027250925&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT macmillanmichael datastructuresandalgorithmswithjavascriptbringingclassiccomputingapproachestotheweb |