Data Structure Using C | NEP-2020 Book of B.Sc

University:	SRTMUN (Swami Ramanand Teerth Marathwada University Nanded)
Course:	B.Sc.
Year/Semester:	Second Year - Third Semester
Duration:	14 Months
Book Pages:	96

E-Book Price:	₹ 27 ~~₹ 39~~ (31% Off)
Physical Book Price:	₹ 120 ~~₹ 150~~ (20% Off)

(0 Reviews)

E-Book Buy Date:	--
E-Book Expiry Date:	--
Audio Buy Date:	--
Audio Expiry Date:	--

The book “Data Structure using C” is specially designed for undergraduate students pursuing Computer Science under the Faculty of Science & Technology. As per the National Education Policy (NEP) 2020, Data Structure has been introduced as a major subject in the B.Sc. Second Year curriculum from the academic year 2025-2026. This book provides a clear, practical, and structured approach to learning one of the most important foundations of computer science.

Data structures form the backbone of programming, enabling efficient storage, organization, and manipulation of data. This book begins with the basics—definitions of data and data structures—and gradually explains core concepts like Arrays, Linked Lists, Stacks, Queues, Trees, and Graphs. Each topic is supported with algorithms and examples to help learners understand implementation in the C programming language.

Apart from theory, this book emphasizes practical knowledge so that students can develop and implement algorithms for solving real-world problems. Important questions at the end of each unit help in exam preparation and self-assessment. Written by experienced authors combining both academic and industry insights, “Data Structure using C” is a complete resource for one-semester university courses and a strong foundation for further studies in computer science.

Index

Unit 1: Introduction To Data Structure

1.1 Definition
1.2 Classification of Data Structure Primitive And Non Primitive Data Structures
1.3 Operations on Data Structures
1.4 Introduction To Arrays
1.5 Representation of Array in Computer Memory
1.6 Array Operations
- Traversing
- Insertion
- Deletion
- Searching And Sorting
Summary

Unit 2: Linked List

2.1 Definition
Components of Linked List 2.2
2.3 Representation of Linked List In Computer Memory
2.4 Advantages and Disadvantages of Linked List
2.5 Operations on Linked List
- Traversing
- Insertion
- Deletion
- Searching
Summary

Units 3: Stack And Queue

Stack:
3.1 Introduction to Stack
3.2 Array Representation of Stack
3.3 Operations on Stack
- PUSH
- POP

Queue:
3.4 Introduction To Queue
3.5 Operations On Queue
- Insertion
- Deletion
Summary

Units 4: Tree And Graph

Tree :
4.1 Definition
4.2 Binary Tree
4.3 Complete Binary Tree
4.4 Binary Search Tree

Graph :
4.5 Terminology
4.6 Repesentation of Graph
Summary

Prabhakar - Prabhakar Publication

Data Structure Using C | NEP-2020 Book of B.Sc

Index

Unit 1: Introduction To Data Structure

1.1 Definition 1.2 Classification of Data Structure Primitive And Non Primitive Data Structures 1.3 Operations on Data Structures 1.4 Introduction To Arrays 1.5 Representation of Array in Computer Memory 1.6 Array Operations - Traversing - Insertion - Deletion - Searching And Sorting Summary

Unit 2: Linked List

2.1 Definition Components of Linked List 2.2 2.3 Representation of Linked List In Computer Memory 2.4 Advantages and Disadvantages of Linked List 2.5 Operations on Linked List - Traversing - Insertion - Deletion - Searching Summary

Units 3: Stack And Queue

Stack: 3.1 Introduction to Stack 3.2 Array Representation of Stack 3.3 Operations on Stack - PUSH - POP

Queue: 3.4 Introduction To Queue 3.5 Operations On Queue - Insertion - Deletion Summary

Units 4: Tree And Graph

Tree : 4.1 Definition 4.2 Binary Tree 4.3 Complete Binary Tree 4.4 Binary Search Tree

Graph : 4.5 Terminology 4.6 Repesentation of Graph Summary

: Author :

1. Dr. Bhasker Gangadhar Koshidgewar

(M.Sc, M.Phil, Ph.D)

Associate Professor and Head Department of Computer Science.

Vai. Dhunda Maharaj Deglurkar College, Degloor. Nanded (MS)

2. Dr. Ravindra Devidas Kene

(M.Sc., NET, SET, Ph.D., B.Ed.)

Assistant Professor, and Head Department of Computer Science Adarsh education society's Arts, Commerce and Science College, Hingoli. (MS)

Book Name : Data Structure Using 'C'

: Author : 1. Dr. Bhasker Gangadhar Koshidgewar, 2. Dr. Ravindra Devidas Kene

ISBN 978-93-6342-866-9

Copyright© Author 2025

First Editon: August 2025

0

Submit Your Review

More Related Books

Mobile App

Read Book fastly and easily more with our app. Download Prabhakar App Now Get a link to download the app on your phone. Download from Play Store

1.1 Definition
1.2 Classification of Data Structure Primitive And Non Primitive Data Structures
1.3 Operations on Data Structures
1.4 Introduction To Arrays
1.5 Representation of Array in Computer Memory
1.6 Array Operations
- Traversing
- Insertion
- Deletion
- Searching And Sorting
Summary

2.1 Definition
Components of Linked List 2.2
2.3 Representation of Linked List In Computer Memory
2.4 Advantages and Disadvantages of Linked List
2.5 Operations on Linked List
- Traversing
- Insertion
- Deletion
- Searching
Summary

Stack:
3.1 Introduction to Stack
3.2 Array Representation of Stack
3.3 Operations on Stack
- PUSH
- POP

Queue:
3.4 Introduction To Queue
3.5 Operations On Queue
- Insertion
- Deletion
Summary

Tree :
4.1 Definition
4.2 Binary Tree
4.3 Complete Binary Tree
4.4 Binary Search Tree

Graph :
4.5 Terminology
4.6 Repesentation of Graph
Summary

: Author :
1. Dr. Bhasker Gangadhar Koshidgewar,
2. Dr. Ravindra Devidas Kene