This book, Data Structures with Practicals, provides a clear and practical introduction to one of the core areas of computer science. It focuses on the fundamental concepts of organizing and managing data efficiently, which form the backbone of programming and software development.
The book covers essential topics such as arrays, stacks, queues, linked lists, trees, and graphs in a simple and systematic manner. Each concept is explained with the help of algorithms, diagrams, and step-by-step examples, making it easy for students to understand both theory and application.
A unique feature of this book is its strong emphasis on practical learning. Each unit includes hands-on exercises and programming tasks that help learners apply concepts in real-world scenarios, thereby strengthening their problem-solving and logical thinking abilities.
Designed in a student-friendly style, this book serves as a useful resource for beginners as well as learners aiming to build a strong foundation in data structures. It is an ideal guide for developing essential programming skills required for academic success and professional growth in the field of computer science.
CA 211 : Data Structures
1. Introduction to Data Structure
1.1 Meaning of Data
1.2 Data item
1.3 Elementary and Group Data items
1.4 Meaning of Data Structure
1.5 Linear and Non- Linear Data Structure
1.6 Meaning of Algorithm
1.7 Algorithmic notations
1.8 Algorithm analysis (Time and space complexity using Bio O notations)
2. Introduction to Array
2.1 Introduction to Arrays & Definition
2.2 One Dimensional Array and Multidimensional Arrays
2.3 Representation of linear array in memory
2.4 Traversing linear array
2.5 Inserting and Deleting
2.6 Sorting (Bubble Sort, Selection Sort, Insertion Sort, Merge Sort)
2.7 Searching (Linear Search, Binary Search)
3. Introduction to Stack and Queue
3.1 Introduction to Stack & Definition
3.2 Stack Implementation
3.3 Operations on Stack (PUSH, POP, CHANGE, PEEP)
3.4 Applications of Stack, Arithmetic expression, Polish notation, Recursion.
3.5 Introduction to Queue & Definition
3.6 Queue Implementation
3.7 Operations on Queue (Insert, Delete)
3.8 Circular Queue
3.9 Introduction to De-queue and Priority Queue
3.10 Queue Applications
4. Linked List, Tree and Graph
4.1 Introduction
4.2 Representation and Operations on Singly Linked List and Doubly Linked List (Traversing, Searching, Insert and Delete)
4.3 Introduction to Circular Linked List and Circular Doubly Linked List.
4.4 Introduction to Tree
4.4.1 Binary tree
4.4.2 Representing binary trees in memory
4.4.3 Traversing binary trees
4.4.4 Threaded Binary Tree
4.4.5 Self-balancing tree (AVL and Red Black Tree)
4.5 Introduction to Graph- Types, representation in memory.
CA-213 : Practical based on Data Structures.
1. Write a program to demonstrate single dimensional array.
2. Write a program to demonstrate multidimensional array.
3. Write a program to implement Bubble sort.
4. Write a program to implement Quick sort
5. Write a program to implement Selection sort.
6. Write a program to implement Insertion sort.
7. Write a program to implement Linear search.
8. Write a program to implement Binary search. 193
9. Write a program to implement Stack operations: Push, Pop, Display.
10. Write a program to implement Linear Queue operations: Insert, Delete, Display.
11. Write a program to implement singly linked list with operations.
i) create ii) insert iii) delete
12. Write a program to implement doubly linked list.
BCA (Honors/Research)
Second Year, Semester – III, CA 211-213
This textbook is aligned with the revised syllabus as outlined by the National Education Policy 2020 (NEP 2020) for the Faculty of Science and Technology Faculty at K.B.C. North Maharashtra University, Jalgaon, effective from June 2025.
