Vijayalakshmi P. A Textbook of Data Structures and Algorithms Vol 1. 2023

Textbook in PDF format

History of algorithms
Definition, structure and properties of algorithms
Definition
Structure and properties
Development of an algorithm
Data structures and algorithms
Data structures – definition and classification
Abstract data types
Classification
Algorithm design techniques
Organization of the book
Analysis of Algorithms
Efficiency of algorithms
Apriori analysis
Asymptotic notations
Time complexity of an algorithm using the O notation
Polynomial time versus exponential time algorithms
Average, best and worst case complexities
Analyzing recursive programs
Recursive procedures
Apriori analysis of recursive functions
Illustrative problems
Arrays
Array operations
Number of elements in an array
One-dimensional array
Two-dimensional array
Multidimensional array
Representation of arrays in memory
One-dimensional array
Two-dimensional arrays
Three-dimensional arrays
N-dimensional array
Applications
Sparse matrix
Ordered lists
Strings
Bit array
Illustrative problems
Stacks
Stack operations
Stack implementation
Implementation of push and pop operations
Applications
Recursive programming
Evaluation of expressions
Illustrative problems
Queues
Operations on queues
Queue implementation
Implementation of insert and delete operations on a queue
Limitations of linear queues
Circular queues
Operations on a circular queue
Implementation of insertion and deletion operations in circular queue
Other types of queues
Priority queues
Deques
Applications
Application of a linear queue
Application of priority queues
Illustrative problems
Linked Lists
Drawbacks of sequential data structures
Merits of linked data structures
Linked lists – structure and implementation
Singly linked lists
Representation of a singly linked list
Insertion and deletion in a singly linked list
Circularly linked lists
Representation
Advantages of circularly linked lists over singly linked lists
Disadvantages of circularly linked lists
Primitive operations on circularly linked lists
Other operations on circularly linked lists
Doubly linked lists
Representation of a doubly linked list
Advantages and disadvantages of a doubly linked list
Operations on doubly linked lists
Multiply linked lists
Unrolled linked lists
Retrieval of an element
Insert an element
Delete an element
Self-organizing lists
Applications
Addition of polynomials
Sparse matrix representation
Illustrative problems
Linked Stacks and Linked Queues
Linked stack
Linked queues
Operations on linked stacks and linked queues
Linked stack operations
Linked queue operations
Algorithms for Push/Pop operations on a linked stack
Algorithms for insert and delete operations in a linked queue
Dynamic memory management and linked stacks
Implementation of linked representations
Applications
Balancing symbols
Polynomial representation
Illustrative problems
Summaries of other volumes