Skip to main content
SpringerLink
Log in

Data Structures and Algorithms: A First Course

  • Textbook
  • © 1996

Overview

Authors:
  1. Iain T. Adamson

    1. Department of Mathematics, University of Dundee, Dundee, UK

    View author publications

    You can also search for this author in PubMed   Google Scholar

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (24 chapters)

  1. Front Matter

    Pages i-xi
    Download chapter PDF

  2. Data Structures

    1. Front Matter

      Pages 1-4
      Download chapter PDF

    2. Arrays, Records and Linked Lists

      • Iain T. Adamson
      Pages 5-25

    3. Stacks and Queues

      • Iain T. Adamson
      Pages 27-56

    4. Binary Trees

      • Iain T. Adamson
      Pages 57-73

    5. Heaps

      • Iain T. Adamson
      Pages 75-86

    6. Graphs

      • Iain T. Adamson
      Pages 87-109

  3. Algorithms

    1. Front Matter

      Pages 111-111
      Download chapter PDF

    2. Algorithms and Complexity

      • Iain T. Adamson
      Pages 113-125

    3. Sorting Algorithms

      • Iain T. Adamson
      Pages 127-170

    4. Graph Algorithms

      • Iain T. Adamson
      Pages 171-213

    5. Some Miscellaneous Algorithms

      • Iain T. Adamson
      Pages 215-234

  4. Storing and Searching

    1. Front Matter

      Pages 235-237
      Download chapter PDF

    2. Storing in Arrays and Lists

      • Iain T. Adamson
      Pages 239-255

    3. Storing in Binary Trees

      • Iain T. Adamson
      Pages 257-278

    4. Storing in Multiway Trees

      • Iain T. Adamson
      Pages 279-307

  5. Solutions

    1. Front Matter

      Pages 309-309
      Download chapter PDF

    2. Solutions to Exercises 1

      • Iain T. Adamson
      Pages 311-320

    3. Solutions to Exercises 2

      • Iain T. Adamson
      Pages 321-327

    4. Solutions to Exercises 3

      • Iain T. Adamson
      Pages 329-336
Back to top

Keywords

About this book

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.

Authors and Affiliations

  • Department of Mathematics, University of Dundee, Dundee, UK

    Iain T. Adamson

Bibliographic Information

  • Book Title: Data Structures and Algorithms: A First Course

  • Authors: Iain T. Adamson

  • DOI: https://doi.org/10.1007/978-1-4471-1023-1

  • Publisher: Springer London

  • eBook Packages: Springer Book Archive

  • Copyright Information: Springer-Verlag London Limited 1996

  • Softcover ISBN: 978-3-540-76047-4Published: 06 August 1996

  • eBook ISBN: 978-1-4471-1023-1Published: 06 December 2012

  • Edition Number: 1

  • Number of Pages: XI, 419

  • Topics: Data Structures, Algorithm Analysis and Problem Complexity

Publish with us

Policies and ethics

Back to top

Search

Navigation