Advertisement

Data Structures and Algorithms: A First Course

  • Iain T. Adamson

Table of contents

  1. Front Matter
    Pages i-xi
  2. Data Structures

    1. Front Matter
      Pages 1-4
    2. Iain T. Adamson
      Pages 5-25
    3. Iain T. Adamson
      Pages 27-56
    4. Iain T. Adamson
      Pages 57-73
    5. Iain T. Adamson
      Pages 75-86
    6. Iain T. Adamson
      Pages 87-109
  3. Algorithms

    1. Front Matter
      Pages 111-111
    2. Iain T. Adamson
      Pages 113-125
    3. Iain T. Adamson
      Pages 127-170
    4. Iain T. Adamson
      Pages 171-213
    5. Iain T. Adamson
      Pages 215-234
  4. Storing and Searching

    1. Front Matter
      Pages 235-237
    2. Iain T. Adamson
      Pages 239-255
    3. Iain T. Adamson
      Pages 257-278
    4. Iain T. Adamson
      Pages 279-307
  5. Solutions

    1. Front Matter
      Pages 309-309
    2. Iain T. Adamson
      Pages 311-320
    3. Iain T. Adamson
      Pages 321-327
    4. Iain T. Adamson
      Pages 329-336
    5. Iain T. Adamson
      Pages 337-340
    6. Iain T. Adamson
      Pages 341-345
    7. Iain T. Adamson
      Pages 347-348
    8. Iain T. Adamson
      Pages 349-361
    9. Iain T. Adamson
      Pages 363-373
    10. Iain T. Adamson
      Pages 375-379
    11. Iain T. Adamson
      Pages 381-386
    12. Iain T. Adamson
      Pages 387-396
    13. Iain T. Adamson
      Pages 397-415
  6. Back Matter
    Pages 417-419

About this book

Introduction

All young computer scientists who aspire to write programs must learn something about algorithms and data structures. This book does exactly that. Based on lecture courses developed by the author over a number of years the book is written in an informal and friendly way specifically to appeal to students.
The book is divided into four parts: the first on Data Structures introduces a variety of structures and the fundamental operations associated with them, together with descriptions of how they are implemented in Pascal; the second discusses algorithms and the notion of complexity; Part III is concerned with the description of successively more elaborate structures for the storage of records and algorithms for retrieving a record from such a structure by means of its key; and finally, Part IV consists of very full solutions to nearly all the exercises in the book.

Keywords

Hashing algorithms complexity data structures sorting

Authors and affiliations

  • Iain T. Adamson
    • 1
  1. 1.Department of MathematicsUniversity of DundeeDundeeUK

Bibliographic information