Data structures the fun way: an amusing adventure with coffee-filled examples
Information in memory -- Binary search -- Dynamic data structures -- Stacks and queues -- Binary search trees -- Trees and adapting data structures -- Priority queues and heaps -- Grids -- Spatial trees -- Hash tables -- Caches -- B-trees -- Bloom filters -- Skip lists -- Graphs.
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
San Francisco
No Starch Press
[2022]
|
| Schlagworte: | |
| Zusammenfassung: | Information in memory -- Binary search -- Dynamic data structures -- Stacks and queues -- Binary search trees -- Trees and adapting data structures -- Priority queues and heaps -- Grids -- Spatial trees -- Hash tables -- Caches -- B-trees -- Bloom filters -- Skip lists -- Graphs. "This accessible and entertaining book provides an in-depth introduction to computational thinking through the lens of data structures, a critical component in any programming endeavor. It will give you a strong background in implementing and working with more than 15 key data structures, from arrays, stacks, and queues to caches, bloom filters, skip lists, and graphs"-- |
| Beschreibung: | xxiii, 276 Seiten Illustrationen |
| ISBN: | 9781718502604 |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV049026400 | ||
| 003 | DE-604 | ||
| 007 | t | ||
| 008 | 230629s2022 xxua||| |||| 00||| eng d | ||
| 020 | |a 9781718502604 |9 978-1-7185-0260-4 | ||
| 035 | |a (OCoLC)1350409438 | ||
| 035 | |a (DE-599)BVBBV049026400 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 044 | |a xxu |c XD-US | ||
| 049 | |a DE-523 |a DE-11 |a DE-1043 | ||
| 082 | 0 | |a 005.7/3 |2 23 | |
| 084 | |a ST 265 |0 (DE-625)143634: |2 rvk | ||
| 084 | |a 54.62 |2 bkl | ||
| 100 | 1 | |a Kubica, Jeremy |e Verfasser |0 (DE-588)1078125643 |4 aut | |
| 245 | 1 | 0 | |a Data structures the fun way |b an amusing adventure with coffee-filled examples |c Jeremy Kubica |
| 264 | 1 | |a San Francisco |b No Starch Press |c [2022] | |
| 300 | |a xxiii, 276 Seiten |b Illustrationen | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 520 | 3 | |a Information in memory -- Binary search -- Dynamic data structures -- Stacks and queues -- Binary search trees -- Trees and adapting data structures -- Priority queues and heaps -- Grids -- Spatial trees -- Hash tables -- Caches -- B-trees -- Bloom filters -- Skip lists -- Graphs. | |
| 520 | 3 | |a "This accessible and entertaining book provides an in-depth introduction to computational thinking through the lens of data structures, a critical component in any programming endeavor. It will give you a strong background in implementing and working with more than 15 key data structures, from arrays, stacks, and queues to caches, bloom filters, skip lists, and graphs"-- | |
| 653 | 0 | |a Data structures (Computer science) | |
| 653 | 0 | |a Computer programming | |
| 776 | 0 | 8 | |i Erscheint auch als |n Online-Ausgabe |z 978-1-7185-0261-1 |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-034289199 | |
Datensatz im Suchindex
| _version_ | 1809312646842810368 |
|---|---|
| adam_text | |
| adam_txt | |
| any_adam_object | |
| any_adam_object_boolean | |
| author | Kubica, Jeremy |
| author_GND | (DE-588)1078125643 |
| author_facet | Kubica, Jeremy |
| author_role | aut |
| author_sort | Kubica, Jeremy |
| author_variant | j k jk |
| building | Verbundindex |
| bvnumber | BV049026400 |
| classification_rvk | ST 265 |
| ctrlnum | (OCoLC)1350409438 (DE-599)BVBBV049026400 |
| dewey-full | 005.7/3 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 005 - Computer programming, programs, data, security |
| dewey-raw | 005.7/3 |
| dewey-search | 005.7/3 |
| dewey-sort | 15.7 13 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik |
| discipline_str_mv | Informatik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000 c 4500</leader><controlfield tag="001">BV049026400</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">230629s2022 xxua||| |||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781718502604</subfield><subfield code="9">978-1-7185-0260-4</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1350409438</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV049026400</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="044" ind1=" " ind2=" "><subfield code="a">xxu</subfield><subfield code="c">XD-US</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-523</subfield><subfield code="a">DE-11</subfield><subfield code="a">DE-1043</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">005.7/3</subfield><subfield code="2">23</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 265</subfield><subfield code="0">(DE-625)143634:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">54.62</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Kubica, Jeremy</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)1078125643</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Data structures the fun way</subfield><subfield code="b">an amusing adventure with coffee-filled examples</subfield><subfield code="c">Jeremy Kubica</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">San Francisco</subfield><subfield code="b">No Starch Press</subfield><subfield code="c">[2022]</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">xxiii, 276 Seiten</subfield><subfield code="b">Illustrationen</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="520" ind1="3" ind2=" "><subfield code="a">Information in memory -- Binary search -- Dynamic data structures -- Stacks and queues -- Binary search trees -- Trees and adapting data structures -- Priority queues and heaps -- Grids -- Spatial trees -- Hash tables -- Caches -- B-trees -- Bloom filters -- Skip lists -- Graphs.</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">"This accessible and entertaining book provides an in-depth introduction to computational thinking through the lens of data structures, a critical component in any programming endeavor. It will give you a strong background in implementing and working with more than 15 key data structures, from arrays, stacks, and queues to caches, bloom filters, skip lists, and graphs"--</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">Data structures (Computer science)</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">Computer programming</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Online-Ausgabe</subfield><subfield code="z">978-1-7185-0261-1</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-034289199</subfield></datafield></record></collection> |
| id | DE-604.BV049026400 |
| illustrated | Illustrated |
| index_date | 2024-07-03T22:15:14Z |
| indexdate | 2024-09-05T00:10:01Z |
| institution | BVB |
| isbn | 9781718502604 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-034289199 |
| oclc_num | 1350409438 |
| open_access_boolean | |
| owner | DE-523 DE-11 DE-1043 |
| owner_facet | DE-523 DE-11 DE-1043 |
| physical | xxiii, 276 Seiten Illustrationen |
| publishDate | 2022 |
| publishDateSearch | 2022 |
| publishDateSort | 2022 |
| publisher | No Starch Press |
| record_format | marc |
| spelling | Kubica, Jeremy Verfasser (DE-588)1078125643 aut Data structures the fun way an amusing adventure with coffee-filled examples Jeremy Kubica San Francisco No Starch Press [2022] xxiii, 276 Seiten Illustrationen txt rdacontent n rdamedia nc rdacarrier Information in memory -- Binary search -- Dynamic data structures -- Stacks and queues -- Binary search trees -- Trees and adapting data structures -- Priority queues and heaps -- Grids -- Spatial trees -- Hash tables -- Caches -- B-trees -- Bloom filters -- Skip lists -- Graphs. "This accessible and entertaining book provides an in-depth introduction to computational thinking through the lens of data structures, a critical component in any programming endeavor. It will give you a strong background in implementing and working with more than 15 key data structures, from arrays, stacks, and queues to caches, bloom filters, skip lists, and graphs"-- Data structures (Computer science) Computer programming Erscheint auch als Online-Ausgabe 978-1-7185-0261-1 |
| spellingShingle | Kubica, Jeremy Data structures the fun way an amusing adventure with coffee-filled examples |
| title | Data structures the fun way an amusing adventure with coffee-filled examples |
| title_auth | Data structures the fun way an amusing adventure with coffee-filled examples |
| title_exact_search | Data structures the fun way an amusing adventure with coffee-filled examples |
| title_exact_search_txtP | Data structures the fun way an amusing adventure with coffee-filled examples |
| title_full | Data structures the fun way an amusing adventure with coffee-filled examples Jeremy Kubica |
| title_fullStr | Data structures the fun way an amusing adventure with coffee-filled examples Jeremy Kubica |
| title_full_unstemmed | Data structures the fun way an amusing adventure with coffee-filled examples Jeremy Kubica |
| title_short | Data structures the fun way |
| title_sort | data structures the fun way an amusing adventure with coffee filled examples |
| title_sub | an amusing adventure with coffee-filled examples |
| work_keys_str_mv | AT kubicajeremy datastructuresthefunwayanamusingadventurewithcoffeefilledexamples |