Data structure and algorithms are two of the most important aspects of Computer science. Data structure and algorithms help in understanding the nature of the problem at a deeper level and thereby a better understanding of the world. Learning data structure and algorithms will help you become a better programmer. This book provides a comprehensive introduction to the modern study of computer algorithms. It presents many algorithms and covers them in considerable depth, which makes their design and analysis accessible to all levels of readers. This book provides with an enjoyable introduction to the field of algorithms.
This book provides a comprehensive introduction to the modern study of computer algorithms. It presents many algorithms and covers them in considerable depth, which makes their design and analysis accessible to all levels of readers. We have tried to keep explanations elementary without sacrificing depth of coverage or accuracy. Each chapter presents an algorithm, a design technique, an application area, or a related topic. Algorithms are described in English and in a “pseudocode” designed to be readable by anyone who has done a little programming. The book contains over 300 pages with facts and figures illustrating how the algorithms work. Since we emphasize efficiency as a design criterion, we include careful analyzes of the running times of all our algorithms. Since we emphasize efficiency as a design criterion, we include careful analyzes of the running times of all our algorithms.
The text is intended primarily for use in undergraduate or graduate courses in algorithms or data structures. Because it discusses engineering issues in algorithm design, as well as mathematical aspects, it is equally well suited for self-study by technical professionals.
Author(s): Nikhat Raza Khan, Manmohan Singh, Piyush Kumar
Publisher: Arcler Press
Year: 2023
Language: English
Pages: 342
Cover
Title Page
Copyright
ABOUT THE AUTHORS
TABLE OF CONTENTS
List of Figures
List of Tables
List of Abbreviations
Preface
Chapter 1 Prerequisite
1.1. Introduction
1.2. Concept of Data Representation
1.3. Data Structures
1.4. Structural Programming
1.5. Top-Down Design
1.6. Abstract Data Type
1.7. Array
1.8. Structure
1.9. Character Strings
1.10. Pointers
1.11. Dynamic Memory Management
1.12. Pointer to Structure
Chapter 2 Stack, Queues, and List
2.1. Introduction
2.2. A Mazing Problem
2.3. Static and Dynamic
2.4. Queue Introduction
2.5. List
Chapter 3 Trees
3.1. Introduction
3.2. Basic Concepts
3.3. Tree
3.4. Binary Tree
3.5. Traversals Operation of a Binary Tree
3.6. Threaded Binary Tree
3.7. Binary Expression Tree
3.8. Conversion of General Tree to Binary Tree
3.9. Applications of Tree
3.10. Sequential or Linear Search
3.11. Binary Search
3.12. Height Balanced Tree
3.13. Weight Balanced Tree
3.14. Multiway Search Trees
3.15. Digital Search Trees
3.16. Hashing
Chapter 4 Sorting Algorithms
4.1. Introduction
4.2. Sorting
4.3. Complexity of the Algorithm
Chapter 5 Graphs
5.1. Introduction
5.2. Graph
5.3. Adjacent Vertices
5.4. Paths
5.5. Cycles
5.6. Various Types of Graphs
5.7. Trees
5.8. Graph Representations
5.9. Minimum Path Problem
5.10. Traversal Schemes of a Graph
5.11. Spanning Trees
5.12. Applications of Graph
Chapter 6 Algorithm and Its Analysis
6.1. Analysis of Algorithm
Chapter 7 Data Structure Laboratory
7.1. Algorithm for Insertion in One Dimensional Array
7.2. Algorithm for Deletion in One Dimensional Array
Chapter 8 Viva Questions
Bibliography
Index
Back Cover
