Skip to content Skip to footer
-15%

Data Structure and Basics of Algorithms

by: Chandan Jyoti KumarMayuri SharmaSangita BaruahSupriya Borah

Original price was: ₹999.00.Current price is: ₹850.00.

Additional information

Weight 500 g
Dimensions 25 × 18 cm
Format

Paper Book

Genre

Science

ISBN

9789348642400

Number of pages

480

Publisher

Academic Enclave

Year of Publishing

2025

Description

About the Book

Data structure and Basics of Algorithms is a book designed to equip students, educators and aspiring individuals with a comprehensive understanding of the core principles that drive efficient problem-solving in the field of computer science. This book presents well-structured contents that bridges theoretical concepts of data structures and algorithms with practical applications in C++ programming language. Equipped with easy-to-understand lessons, illustrative examples, and hands – on exercises, this book aims to develop both conceptual clarity and practical coding skills. Structured to support learners from beginner to advanced levels, the book covers a wide spectrum of topics, including arrays, linked lists, stacks, queues, trees, graphs, searching and sorting algorithms, as well as complexity analysis. In addition to building coding proficiency, this book places a strong emphasis on developing algorithmic thinking—helping learners cultivate the ability to break down problems, recognize patterns, and design optimized, logical solutions. Whether used as a textbook for coursework or as a self-study guide for technical interviews and competitive programming, this book is a reliable and enriching resource for mastering the fundamentals of data structures and algorithms.

About the Author

Dr. Chandan Jyoti Kumar received his Ph.D. in Computer Science from Gauhati University, Assam. He holds an M.Tech from NIT Jalandhar and a B.Tech from NIT Silchar. Dr. Kumar is currently an Assistant Professor in the Department of Computer Science and IT at Cotton University, Guwahati.

Dr. Sangita Baruah is the founding Head and Assistant Professor of the Department of Computer Science and Information Technology at Cotton University. Her areas of interest span across Cyber Security, Machine Learning, Computer Vision, and the application of Artificial Intelligence in healthcare systems.

Dr. Mayuri Sharma is currently serving as a Lecturer at NIELIT Guwahati, Assam. Her research interests lie at the intersection of Machine Learning, Image Processing and Deep Learning, with a particular focus on ML-based agricultural applications and Generative AI domains.

Supriya Borah is currently serving as a faculty member in Artificial Intelligence, Machine Learning and Data Science at Pragjyotishpur University, Assam. In her teaching role, she is passionate about guiding students in core areas of computer science, including Data Structures, Design and Analysis of Algorithms, Theory of Computation, Graph Theory, and Machine Learning.

Contents

Preface
1. Introduction and Overview
1.1 Introduction
1.2 Elementary Data Organization
1.3 Data Structures and Operations
1.4 Algorithm
1.5 Algorithm Analysis
1.6 Asymptotic Notations
1.7 Let Us Sum Up
1.8 Check Your Progress
2. Array
2.1 Introduction
2.2 Linear Array and Memory Representation
2.3 Operations on One-Dimensional Array
2.4 Multidimensional Arrays
2.5 Operations on Two-Dimensional Array
2.6 Passing Arrays to Functions in C++ Language
2.7 Pointers and Arrays
2.8 Applications of Array
2.9 Let Us Sum Up
2.10 Check Your Progress
2.11 Exercises
3. Linked List
3.1 Introduction
3.2 Memory Representation of Linked List
3.3 Declaration of Linked List
3.4 Types of Linked List
3.5 Basic Operations of Linked List
3.6 Circular Linked List1
3.7 Doubly Linked Lists1
3.8 Let Us Sum Up
3.9 Check Your Progress
3.10 Exercises
4. Stack and Queue
4.1 Introduction
4.2 Basic Stack Operations
4.3 Implementation of Stack
4.4 Applications of Stack
4.5 Queue
4.6 Basic Operations of Queue
4.7 Representation of Queue
4.8 Disadvantages of Linear Queue
4.9 Types of Queues
4.10 Let Us Sum Up
4.11 Check Your Progress
4.12 Exercises
5. Tree
5.1 Introduction
5.2 Binary Trees
5.3 Representation of Binary Tree in Memory
5.4 Traversing  Binary Trees
5.5 Binary Search Trees
5.6 Avl Search Trees
5.7 B Tree
5.8  Heap Tree
5.9 Red-Black Trees
5.10 Let Us Sum Up
5.11 Check Your Progress
6. Graph
6.1 Introduction
6.2 Basic Terminologies
6.3 Applications of Graph
6.4 Representation of Graph
6.5 Traversal of a Graph
6.6. Minimum Spanning Tree
6.7 All-Pairs Shortest Paths
6.8 Dijkstra’s Algorithm
6.9 Bellman Ford Algorithm
6.10 Let Us Sum Up
6.11 Check Your Progress
7. Design and Analysis of Algorithms 
7.1 Introduction to Algorithm
7.2 Complexity of Algorithm
7.3 Asymptotic Notations
7.4 Analysis of Algorithm by Solving Recurrences
7.5 P, Np, Np – Hard and Np-Complete Problem
7.6 Let Us Sum Up
7.7 Check Your Progress
7.8 Exercises
8. Sorting and Searching Algorithms
8.1 Introduction
8.2 Sorting Algorithms
8.3 Searching Algorithm
8.4 Hashing
8.5 Let Us Sum Up
8.6 Check Your Progress
Bibliography

Reviews

There are no reviews yet.

Only logged in customers who have purchased this product may leave a review.