X
feed icon rss

Ihre E-Mail wurde erfolgreich gesendet. Bitte prüfen Sie Ihren Maileingang.

Leider ist ein Fehler beim E-Mail-Versand aufgetreten. Bitte versuchen Sie es erneut.

Vorgang fortführen?

Exportieren
Filter
Medientyp
Sprache
Region
Bibliothek
Erscheinungszeitraum
Person/Organisation
Schlagwörter
Zugriff
  • 1
    Online-Ressource
    Online-Ressource
    Basic concepts in data structures / (2016)
    Cambridge :Cambridge University Press,
    Details
    UID:
    almahu_9948233432202882
    Umfang: 1 online resource (xii, 215 pages) : , digital, PDF file(s).
    ISBN: 9781316676226 (ebook)
    Inhalt: Data structures are the fundamental building blocks of any computer program, used for storing, representing and manipulating data in a computer. This text presents the basic concepts of data structures as part of the art of writing computer programs. The author concentrates on the fundamentals of what should be done to solve a problem efficiently rather than technical implementation details. The text includes pseudocode and covers all the most common data structures, such as queues, stacks, trees, heaps, and hash tables, along with the basics of searching, sorting, and coding. This book can supplement any undergraduate algorithms or discrete math course and will also be accessible to students and researchers in other quantitative disciplines. No prerequisites beyond introductory programming and basic mathematics are required, and the accessible, conceptual presentation will appeal to undergraduates in many quantitative fields. Carefully designed problem sets with selected solutions will allow students to test their understanding.
    Anmerkung: Title from publisher's bibliographic system (viewed on 02 Dec 2016).
    Weitere Ausg.: Print version: ISBN 9781107161276
    Sprache: Englisch
    URL: https://doi.org/10.1017/CBO9781316676226
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    Online-Ressource
    HU Berlin
    FU Berlin
  • 2
    Online-Ressource
    Online-Ressource
    Basic concepts in data structures (2016)
    Cambridge, United Kingdom : Cambridge University Press
    Details
    UID:
    gbv_878050469
    Umfang: 1 Online-Ressource
    ISBN: 9781316676226
    Inhalt: Data structures are the fundamental building blocks of any computer program, used for storing, representing and manipulating data in a computer. This text presents the basic concepts of data structures as part of the art of writing computer programs. The author concentrates on the fundamentals of what should be done to solve a problem efficiently rather than technical implementation details. The text includes pseudocode and covers all the most common data structures, such as queues, stacks, trees, heaps, and hash tables, along with the basics of searching, sorting, and coding. This book can supplement any undergraduate algorithms or discrete math course and will also be accessible to students and researchers in other quantitative disciplines. No prerequisites beyond introductory programming and basic mathematics are required, and the accessible, conceptual presentation will appeal to undergraduates in many quantitative fields. Carefully designed problem sets with selected solutions will allow students to test their understanding
    Weitere Ausg.: ISBN 9781316613849
    Weitere Ausg.: ISBN 9781107161278
    Weitere Ausg.: Erscheint auch als Druck-Ausgabe Klein, Shmuel Tomi Basic concepts in data structures Cambridge, United Kingdom : Cambridge University Press, 2016 ISBN 9781316613849
    Weitere Ausg.: ISBN 9781316613849
    Weitere Ausg.: ISBN 9781107161276
    Weitere Ausg.: ISBN 1107161274
    Sprache: Englisch
    Schlagwort(e): Datenstruktur
    DOI: 10.1017/CBO9781316676226
    URL: Volltext
    URL: Inhaltstext
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    Online-Ressource
    Online Zugang
    Open Access Wunsch
    UB Potsdam
  • 3
    Online-Ressource
    Online-Ressource
    Basic Concepts in Data Structures / (2016)
    Cambridge, England :Cambridge University Press,
    Details
    UID:
    almafu_9960119067602883
    Umfang: 1 online resource (xii, 215 pages) : , digital, PDF file(s).
    Ausgabe: First edition.
    ISBN: 1-316-88294-2 , 1-316-88371-X , 1-316-67622-6
    Inhalt: Data structures are the fundamental building blocks of any computer program, used for storing, representing and manipulating data in a computer. This text presents the basic concepts of data structures as part of the art of writing computer programs. The author concentrates on the fundamentals of what should be done to solve a problem efficiently rather than technical implementation details. The text includes pseudocode and covers all the most common data structures, such as queues, stacks, trees, heaps, and hash tables, along with the basics of searching, sorting, and coding. This book can supplement any undergraduate algorithms or discrete math course and will also be accessible to students and researchers in other quantitative disciplines. No prerequisites beyond introductory programming and basic mathematics are required, and the accessible, conceptual presentation will appeal to undergraduates in many quantitative fields. Carefully designed problem sets with selected solutions will allow students to test their understanding.
    Anmerkung: Includes index. , Cover -- Half title -- Dedication -- Title -- Copyright -- Contents -- List of Background Concepts -- Preface -- 1 Why Data Structures? A Motivating Example -- 1.1 Boyer and Moore's Algorithm -- 1.2 The Bad-Character Heuristic -- 1.3 The Good-Suffix Heuristic -- Exercises -- 2 Linear Lists -- 2.1 Managing Data Storage -- 2.2 Queues -- 2.3 Stacks -- 2.4 Other Linear Lists -- Exercises -- 3 Graphs -- 3.1 Extending the Relationships between Records -- 3.2 Graph Representations -- 3.3 Graph Exploration -- 3.4 The Usefulness of Graphs -- Exercises -- 4 Trees -- 4.1 Allowing Multiple Successors -- 4.2 General versus Binary Trees -- 4.3 Binary Trees: Properties and Examples -- 4.4 Binary Search Trees -- Exercises -- 5 AVL Trees -- 5.1 Bounding the Depth of Trees -- 5.2 Depth of AVL Trees -- 5.3 Insertions into AVL Trees -- 5.4 Deletions from AVL Trees -- 5.5 Alternatives -- Exercises -- 6 B-Trees -- 6.1 Higher-Order Search Trees -- 6.2 Definition of B-Trees -- 6.3 Insertion into B-Trees -- 6.4 Deletions from B-Trees -- 6.5 Variants -- Exercises -- 7 Heaps -- 7.1 Priority Queues -- 7.2 Definition and Updates -- 7.3 Array Implementation of Heaps -- 7.4 Construction of Heaps -- 7.5 Heapsort -- Exercises -- 8 Sets -- 8.1 Representing a Set by a Bitmap -- 8.2 Union-Find -- Exercises -- 9 Hash Tables -- 9.1 Calculating instead of Comparing -- 9.2 Hash Functions -- 9.3 Handling Collisions -- 9.4 Analysis of Uniform Hashing -- 9.5 Deletions from Hash Tables -- 9.6 Concluding Remarks -- Exercises -- 10 Sorting -- 10.1 A Sequence of Sorting Algorithms -- 10.2 Lower Bound on the Worst Case -- 10.3 Lower Bound on the Average -- 10.4 Quicksort -- 10.5 Finding the kth Largest Element -- Exercises -- 11 Codes -- 11.1 Representing the Data -- 11.2 Compression Codes -- 11.3 Universal Codes -- 11.4 Error Correcting Codes -- 11.5 Cryptographic Codes -- Exercises. , Appendix Solutions to Selected Exercises -- Index.
    Weitere Ausg.: ISBN 1-316-61384-4
    Weitere Ausg.: ISBN 1-107-16127-4
    Sprache: Englisch
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    Online-Ressource
    FU Berlin
Nichts oder nicht das Richtige gefunden? Bitte überprüfen Sie Ihre Suchanfrage oder benutzen Sie den Fernleihindex.
Meinten Sie 9781107161276?
Meinten Sie 9781107161368?
Meinten Sie 9781107112728?
Schließen ⊗
Diese Webseite nutzt Cookies und das Analyse-Tool Matomo. Weitere Informationen finden Sie auf den KOBV Seiten zum Datenschutz