Data Structures, 2ed
ISBN: 9788126577149
312 pages
eBook also available for institutional users
For more information write to us at: acadmktg@wiley.com
Description
The book has been divided into six chapters. Chapter 1 deals with the preliminaries that are required to appreciate the need for studying data structures. Chapter 2 presents the linear class of data structures. Chapter 3 deals with the important non-linear structures. Advanced data structures such as balanced search trees, heaps etc. have been explained in detail in Chapter 4. Meticulous effort has been taken to provide algorithms for each operation to be performed on these data structures, which could be readily converted into working programs using any one of the modern programming languages.
1 Introduction to Algorithms and Data Structures
1.1 Introduction
1.2 Algorithms
1.3 Data Structures
2 Linear Data Structures
2.1 Introduction
2.2 Arrays
2.3 Lists
2.4 Arrays Versus Linked Lists
2.5 Stacks
2.6 Queues
3 Non-Linear Data Structures
3.1 Introduction
3.2 Trees
3.3 Graphs
4 Advanced Data Structures
4.1 Introduction
4.2 Hash Tables
4.3 Heaps
4.4 AVL Trees
4.5 Red–Black Trees
4.6 B Trees
4.7 Trie Structures
5 Sorting
5.1 Introduction
5.2 Types of Sorting Algorithms
5.3 Sorting Techniques
5.4 Time Complexity of Sorting Techniques
6 File Structures
6.1 Introduction
6.2 Definitions and Concepts
6.3 Physical Structure of Hard Disk
6.4 File Operations
6.5 File Organisation
6.6 External Sorting
Summary
Multiple Choice Questions
Short Answer Questions
Long Answer Questions
Review Questions
Answers to Multiple Choice Questions