Welcome to Prashant Publications

Rs. 100.00
Availability: 10 left in stock

Data Structure – I is a Simple version for S.Y.B.SC students of our Prashant
Publication.
This text is in accordance with the new syllabus NEP-2025-26 recommended
by the Kavayitri Bahainabai Chaudhari North Maharashtra...

Guaranteed safe checkout:

apple paygoogle paymasterpaypalshopify payvisa

Orders ship within 5 to 10 business days.

Hoorey ! This item ships free to the US

Coputer Science Data Structure-I
- +

Data Structure – I is a Simple version for S.Y.B.SC students of our Prashant
Publication.
This text is in accordance with the new syllabus NEP-2025-26 recommended
by the Kavayitri Bahainabai Chaudhari North Maharashtra University, Jalgaon,
which has been serving the need of S.Y.B.SC. Information Technology, Data
science students from various colleges. This text is also useful for the student of
Engineering.
We are extremely grateful to Prof. Dr. S.R.Kolhe, Chairman, Board
of Studies, and all BOS members of Kavayitri Bahinabai Chaudhari North
Maharashtra University, Jalgaon for his valuable guidance.
We are obligated to Principals and Librarians and staff of respective colleges
for their encouragement.
We are very much thankful to Shri. Rangrao Patil of Prashant Publications,
who has shown extreme co-operation during the preparation of this book, for
getting the book published in time and providing an opportunity to be a part of
this book.
We shall be glad to receive any suggestions for improving the contents of
this book.

UNIT 1……………………………………………………………………………………… 7
Introduction to Data Structure, Algorithm Notations and Analysis of Algorithm
1.1 Introduction to Data Structure
1.2 Types of data structure – 1. Primitive 2. Non Primitive 3. Linear
4. Non linear
1.3 Need of data structure
1.4 Algorithm Notations – a. Format Convention b. Name of Algorithm
c. Introductory Comment d. Steps e. Comments
1.5 Time analysis of an algorithm
1.6 Space analysis of an algorithm
UNIT 2……………………………………………………………………………………. 16
Stacks
2.1 Definition and concept
2.2 Representations – static
2.3 Operations – push, pop, peep, change
2.4 Applications – infix to postfix, postfix evaluation, Recursion using
stack
UNIT 3……………………………………………………………………………………. 33
Queues
3.1 Definition and Concept of Queue
3.2 Representation – static
3.3 Operations- Insert, Delete
3.4 Circular queue : Concept, Operations – insert, delete
3.5 DeQue : Concept
3.6 Priority queues : Concept UNIT 4……………………………………………………………………………………. 45
Link List
4.1 Introduction to Linked list
4.2 Implementation of List – Dynamic representation.
4.3 Types of Linked List – a. Singly Linked list : Operations- Insert,
delete b. Circular linked list : Operations- Insert, delete c. Doubly
linked linear list : Operations- Insert, delete
4.4 Applications of linked list – polynomial manipulation
Practicals…………………………………………………………………………………. 63