Data Structures and Algorithms in C++ : : Pocket Primer / / Lee Wittenberg.
This book takes a minimalist approach to the traditional data structures course. It covers only those topics that are absolutely essential; the more esoteric structures and algorithms are left for later study. Suitable for an introductory data structures course or self-study, this book is written fr...
Saved in:
VerfasserIn: | |
---|---|
Place / Publishing House: | Dulles, VA : : Mercury Learning and Information, , [2017] ©2017 |
Year of Publication: | 2017 |
Language: | English |
Series: | Pocket Primer
|
Online Access: | |
Physical Description: | 1 online resource (200 p.) |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
id |
9781683922773 |
---|---|
ctrlnum |
(DE-B1597)653324 |
collection |
bib_alma |
record_format |
marc |
spelling |
Wittenberg, Lee, author. aut http://id.loc.gov/vocabulary/relators/aut Data Structures and Algorithms in C++ : Pocket Primer / Lee Wittenberg. Dulles, VA : Mercury Learning and Information, [2017] ©2017 1 online resource (200 p.) text txt rdacontent computer c rdamedia online resource cr rdacarrier text file PDF rda Pocket Primer Frontmatter -- Contents -- Preface -- Acknowledgments -- 1. Introduction to Data Structures -- 2. Introduction to the C++ Language -- 3. Arrays -- 4. Linked Lists -- 5. Queues -- 6. Searching and Sorting -- 7. Stacks -- 8. Trees -- 9. Multi-Way Search Trees -- 10. Hashing -- 11. Files -- 12. Graphs -- Appendix A. Answers to Selected Exercises -- Appendix B. References. Books. Webliography -- Index restricted access http://purl.org/coar/access_right/c_16ec online access with authorization star This book takes a minimalist approach to the traditional data structures course. It covers only those topics that are absolutely essential; the more esoteric structures and algorithms are left for later study. Suitable for an introductory data structures course or self-study, this book is written from the ground up in C++ (not translated from a Java-based text), and uses features of the C++ Standard Template Library to illustrate important concepts. A unique feature of the text is its use of literate programming techniques (originally developed by Donald Knuth) to present the sample code in a way that keeps the code from overwhelming the accompanying explanations. This book is suitable for an undergraduate data structures course using C++ or for developers needing review.Features• Takes a “minimalist” approach to the material that presents only essential concepts. This enables readers to focus on (and remember) just what they’ll need.• Uses select features of the C++11 standard to simplify the sample code and make it easier to understand.• Connects the concepts directly to the classes provided the Standard Template Library (STL), and shows how these classes can be implemented in C++. • Uses “literate programming” techniques that allow the presentation of the sample code to more clearly show the details of the code as well as how the pieces fit together. Issued also in print. Mode of access: Internet via World Wide Web. In English. Description based on online resource; title from PDF title page (publisher's Web site, viewed 08. Aug 2023) Programming. COMPUTERS / Programming Languages / C++. bisacsh EPUB 9781683920854 print 9781683920847 https://www.degruyter.com/isbn/9781683922773 Cover https://www.degruyter.com/document/cover/isbn/9781683922773/original |
language |
English |
format |
eBook |
author |
Wittenberg, Lee, Wittenberg, Lee, |
spellingShingle |
Wittenberg, Lee, Wittenberg, Lee, Data Structures and Algorithms in C++ : Pocket Primer / Pocket Primer Frontmatter -- Contents -- Preface -- Acknowledgments -- 1. Introduction to Data Structures -- 2. Introduction to the C++ Language -- 3. Arrays -- 4. Linked Lists -- 5. Queues -- 6. Searching and Sorting -- 7. Stacks -- 8. Trees -- 9. Multi-Way Search Trees -- 10. Hashing -- 11. Files -- 12. Graphs -- Appendix A. Answers to Selected Exercises -- Appendix B. References. Books. Webliography -- Index |
author_facet |
Wittenberg, Lee, Wittenberg, Lee, |
author_variant |
l w lw l w lw |
author_role |
VerfasserIn VerfasserIn |
author_sort |
Wittenberg, Lee, |
title |
Data Structures and Algorithms in C++ : Pocket Primer / |
title_sub |
Pocket Primer / |
title_full |
Data Structures and Algorithms in C++ : Pocket Primer / Lee Wittenberg. |
title_fullStr |
Data Structures and Algorithms in C++ : Pocket Primer / Lee Wittenberg. |
title_full_unstemmed |
Data Structures and Algorithms in C++ : Pocket Primer / Lee Wittenberg. |
title_auth |
Data Structures and Algorithms in C++ : Pocket Primer / |
title_alt |
Frontmatter -- Contents -- Preface -- Acknowledgments -- 1. Introduction to Data Structures -- 2. Introduction to the C++ Language -- 3. Arrays -- 4. Linked Lists -- 5. Queues -- 6. Searching and Sorting -- 7. Stacks -- 8. Trees -- 9. Multi-Way Search Trees -- 10. Hashing -- 11. Files -- 12. Graphs -- Appendix A. Answers to Selected Exercises -- Appendix B. References. Books. Webliography -- Index |
title_new |
Data Structures and Algorithms in C++ : |
title_sort |
data structures and algorithms in c++ : pocket primer / |
series |
Pocket Primer |
series2 |
Pocket Primer |
publisher |
Mercury Learning and Information, |
publishDate |
2017 |
physical |
1 online resource (200 p.) Issued also in print. |
contents |
Frontmatter -- Contents -- Preface -- Acknowledgments -- 1. Introduction to Data Structures -- 2. Introduction to the C++ Language -- 3. Arrays -- 4. Linked Lists -- 5. Queues -- 6. Searching and Sorting -- 7. Stacks -- 8. Trees -- 9. Multi-Way Search Trees -- 10. Hashing -- 11. Files -- 12. Graphs -- Appendix A. Answers to Selected Exercises -- Appendix B. References. Books. Webliography -- Index |
isbn |
9781683922773 9781683920854 9781683920847 |
url |
https://www.degruyter.com/isbn/9781683922773 https://www.degruyter.com/document/cover/isbn/9781683922773/original |
illustrated |
Illustrated |
work_keys_str_mv |
AT wittenberglee datastructuresandalgorithmsincpocketprimer |
status_str |
n |
ids_txt_mv |
(DE-B1597)653324 |
carrierType_str_mv |
cr |
is_hierarchy_title |
Data Structures and Algorithms in C++ : Pocket Primer / |
_version_ |
1775793046231711744 |
fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03863nam a22006135i 4500</leader><controlfield tag="001">9781683922773</controlfield><controlfield tag="003">DE-B1597</controlfield><controlfield tag="005">20230808014301.0</controlfield><controlfield tag="006">m|||||o||d||||||||</controlfield><controlfield tag="007">cr || ||||||||</controlfield><controlfield tag="008">230808t20172017 fo d z eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781683922773</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-B1597)653324</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-B1597</subfield><subfield code="b">eng</subfield><subfield code="c">DE-B1597</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">vau</subfield><subfield code="c">US-VA</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">COM051070</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Wittenberg, Lee, </subfield><subfield code="e">author.</subfield><subfield code="4">aut</subfield><subfield code="4">http://id.loc.gov/vocabulary/relators/aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Data Structures and Algorithms in C++ :</subfield><subfield code="b">Pocket Primer /</subfield><subfield code="c">Lee Wittenberg.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Dulles, VA : </subfield><subfield code="b">Mercury Learning and Information, </subfield><subfield code="c">[2017]</subfield></datafield><datafield tag="264" ind1=" " ind2="4"><subfield code="c">©2017</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource (200 p.)</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">text file</subfield><subfield code="b">PDF</subfield><subfield code="2">rda</subfield></datafield><datafield tag="490" ind1="0" ind2=" "><subfield code="a">Pocket Primer</subfield></datafield><datafield tag="505" ind1="0" ind2="0"><subfield code="t">Frontmatter -- </subfield><subfield code="t">Contents -- </subfield><subfield code="t">Preface -- </subfield><subfield code="t">Acknowledgments -- </subfield><subfield code="t">1. Introduction to Data Structures -- </subfield><subfield code="t">2. Introduction to the C++ Language -- </subfield><subfield code="t">3. Arrays -- </subfield><subfield code="t">4. Linked Lists -- </subfield><subfield code="t">5. Queues -- </subfield><subfield code="t">6. Searching and Sorting -- </subfield><subfield code="t">7. Stacks -- </subfield><subfield code="t">8. Trees -- </subfield><subfield code="t">9. Multi-Way Search Trees -- </subfield><subfield code="t">10. Hashing -- </subfield><subfield code="t">11. Files -- </subfield><subfield code="t">12. Graphs -- </subfield><subfield code="t">Appendix A. Answers to Selected Exercises -- </subfield><subfield code="t">Appendix B. References. Books. Webliography -- </subfield><subfield code="t">Index</subfield></datafield><datafield tag="506" ind1="0" ind2=" "><subfield code="a">restricted access</subfield><subfield code="u">http://purl.org/coar/access_right/c_16ec</subfield><subfield code="f">online access with authorization</subfield><subfield code="2">star</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">This book takes a minimalist approach to the traditional data structures course. It covers only those topics that are absolutely essential; the more esoteric structures and algorithms are left for later study. Suitable for an introductory data structures course or self-study, this book is written from the ground up in C++ (not translated from a Java-based text), and uses features of the C++ Standard Template Library to illustrate important concepts. A unique feature of the text is its use of literate programming techniques (originally developed by Donald Knuth) to present the sample code in a way that keeps the code from overwhelming the accompanying explanations. This book is suitable for an undergraduate data structures course using C++ or for developers needing review.Features• Takes a “minimalist” approach to the material that presents only essential concepts. This enables readers to focus on (and remember) just what they’ll need.• Uses select features of the C++11 standard to simplify the sample code and make it easier to understand.• Connects the concepts directly to the classes provided the Standard Template Library (STL), and shows how these classes can be implemented in C++. • Uses “literate programming” techniques that allow the presentation of the sample code to more clearly show the details of the code as well as how the pieces fit together.</subfield></datafield><datafield tag="530" ind1=" " ind2=" "><subfield code="a">Issued also in print.</subfield></datafield><datafield tag="538" ind1=" " ind2=" "><subfield code="a">Mode of access: Internet via World Wide Web.</subfield></datafield><datafield tag="546" ind1=" " ind2=" "><subfield code="a">In English.</subfield></datafield><datafield tag="588" ind1="0" ind2=" "><subfield code="a">Description based on online resource; title from PDF title page (publisher's Web site, viewed 08. Aug 2023)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Programming.</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">COMPUTERS / Programming Languages / C++.</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="776" ind1="0" ind2=" "><subfield code="c">EPUB</subfield><subfield code="z">9781683920854</subfield></datafield><datafield tag="776" ind1="0" ind2=" "><subfield code="c">print</subfield><subfield code="z">9781683920847</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://www.degruyter.com/isbn/9781683922773</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="3">Cover</subfield><subfield code="u">https://www.degruyter.com/document/cover/isbn/9781683922773/original</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_BACKALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_CL_CHCOMSGSEN</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_DGALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_EBACKALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_EBKALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_ECL_CHCOMSGSEN</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_EEBKALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_ESTMALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_STMALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV-deGruyter-alles</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">PDA12STME</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">PDA13ENGE</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">PDA18STMEE</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">PDA5EBK</subfield></datafield></record></collection> |