A Textbook of Data Structures and Algorithms, Volume 1

A Textbook of Data Structures and Algorithms, Volume 1

by G. A. Vijayalakshmi Pai
Released January 2023
Publisher(s): Wiley-ISTE
ISBN: 9781786308696

Read it now on the O’Reilly learning platform with a 10-day free trial.

O’Reilly members get unlimited access to books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.

Start your free trial

Book description

Data structures and algorithms is a fundamental course in Computer Science, which enables learners across any discipline to develop the much-needed foundation of efficient programming, leading to better problem solving in their respective disciplines.

A Textbook of Data Structures and Algorithms is a textbook that can be used as course material in classrooms, or as self-learning material. The book targets novice learners aspiring to acquire advanced knowledge of the topic. Therefore, the content of the book has been pragmatically structured across three volumes and kept comprehensive enough to help them in their progression from novice to expert.

With this in mind, the book details concepts, techniques and applications pertaining to data structures and algorithms, independent of any programming language. It includes 181 illustrative problems and 276 review questions to reinforce a theoretical understanding and presents a suggestive list of 108 programming assignments to aid in the implementation of the methods covered.

Table of contents

  1. Cover
  2. Series Page
  3. Title Page
  4. Copyright Page
  5. Preface
    1. About this edition
    2. Organization of the book
    3. Salient features of the book
    4. Target audience
  6. Acknowledgments
  7. 1 Introduction
    1. 1.1. History of algorithms
    2. 1.2. Definition, structure and properties of algorithms
    3. 1.3. Development of an algorithm
    4. 1.4. Data structures and algorithms
    5. 1.5. Data structures – definition and classification
    6. 1.6. Algorithm design techniques
    7. 1.7. Organization of the book
  8. 2 Analysis of Algorithms
    1. 2.1. Efficiency of algorithms
    2. 2.2. Apriori analysis
    3. 2.3. Asymptotic notations
    4. 2.4. Time complexity of an algorithm using the O notation
    5. 2.5. Polynomial time versus exponential time algorithms
    6. 2.6. Average, best and worst case complexities
    7. 2.7. Analyzing recursive programs
    8. 2.8. Illustrative problems
  9. 3 Arrays
    1. 3.1. Introduction
    2. 3.2. Array operations
    3. 3.3. Number of elements in an array
    4. 3.4. Representation of arrays in memory
    5. 3.5. Applications
    6. 3.6. Illustrative problems
  10. 4 Stacks
    1. 4.1. Introduction
    2. 4.2. Stack operations
    3. 4.3. Applications
    4. 4.4. Illustrative problems
  11. 5 Queues
    1. 5.1. Introduction
    2. 5.2. Operations on queues
    3. 5.3. Circular queues
    4. 5.4. Other types of queues
    5. 5.5. Applications
    6. 5.6. Illustrative problems
  12. 6 Linked Lists
    1. 6.1. Introduction
    2. 6.2. Singly linked lists
    3. 6.3. Circularly linked lists
    4. 6.4. Doubly linked lists
    5. 6.5. Multiply linked lists
    6. 6.6. Unrolled linked lists
    7. 6.7. Self-organizing lists
    8. 6.8. Applications
    9. 6.9. Illustrative problems
  13. 7 Linked Stacks and Linked Queues
    1. 7.1. Introduction
    2. 7.2. Operations on linked stacks and linked queues
    3. 7.3. Dynamic memory management and linked stacks
    4. 7.4. Implementation of linked representations
    5. 7.5. Applications
    6. 7.6. Illustrative problems
  14. References
  15. Index
  16. Summary of Volume 2
  17. Summary of Volume 3
  18. Other titles frominComputer Engineering
  19. End User License Agreement

Product information

  • Title: A Textbook of Data Structures and Algorithms, Volume 1
  • Author(s): G. A. Vijayalakshmi Pai
  • Release date: January 2023
  • Publisher(s): Wiley-ISTE
  • ISBN: 9781786308696