DP/ 31.

GODAVARI INSTITUTE OF ENGINEERING & TECHNOLOGY(AUTONOMOUS)

Approved by AICTE, NAAC ‘A+’ Grade, Recognized under 2(f) and 12(b) of UGC, Permanently Affiliated to JNTUK, Kakinada
***
LESSON PLAN
Name of the Subject: DATA STRUCTURES Subject Code:
Name of the Faculty Member:V NAGA SRINIVAS
Regulation: GRBT23 Academic Year: 2023-24
Designation:Asst.Professor Programme: B.Tech Year/Sem.: I/lI
Department: MCA Branch: CSC Section:
No. Hours
S.No. Unit Name of the Topic / Sub-topic Cumulative Reference
required
1 I Introduction to Linear Data Structures 1 1 T1/R3/W1
2 I Definition and importance of linear data structures 1 2 T1/R3/W1
3 I Abstract data types (ADTs) and their implementation 2 4 T1/R3/W1
Overview of time and space complexity analysis for T1/R3/W1
4 I 1 5
linear data structures
Searching Techniques: Linear & T1/R3/W1
5 I
Binary Search
1 6
Sorting Techniques: Bubble sort, Selection sort, T1/R3/W1
6 I 2 8
Insertion Sort
7 II Introduction to Linked Lists: Singly linked lists: 1 9 T2/R1/W1
8 II Linked List Representation and operations 2 11 T2/R1/W1
9 II doubly linked lists and circular linked lists 1 12 T2/R1/W1
10 II Comparing arrays and linked lists 2 14 T2/R1/W1
11 II Applications of linked lists 1 15 T2/R1/W1
12 III Introduction to stacks 2 17 T2/R1/W1
13 III Stack properties and operations 1 18 T2/R1/W1
14 III implementing stacks using arrays 1 19 T1/T2/W1
15 III implementing stacks using linked lists 1 20 T1/T2/W1
16 III Applications of stacks in expression evaluation 2 22 T1/T2/W1
17 III Backtracking 1 23 T1/T2/W1
18 III Reversing list Operations 2 25 T1/T2/W1
19 IV Introduction to Queues 1 26 T1/T2/W1
20 IV properties and operations of Queue 2 28 T1/T2/W1
21 IV implementing queues using arrays 1 29 T1/T2/W1
22 IV implementing queues using linked lists 2 31 T1/T2/W1
23 IV Applications of queues in breadth-first search 1 32 T1/T2/W1
24 IV Queue scheduling 1 33 T1/T2/W1
IV Deques: Introduction to deques (double-ended
2 35
25 queues)
26 IV Operations on deques and their applications 1 36 T1/R3/W1
27 V Introduction to Trees 1 37 T1/R3/W1
28 V Binary Search Tree 1 38 T1/R3/W1
29 V Insertion, Deletion & Traversal Operations 2 40 T1/R3/W1
30 V Brief introduction to hashing and hash functions 1 41 T1/R3/W1
31 V Collision resolution techniques 2 43 T1/R3/W1
32 V chaining and open addressing 1 44 T1/R3/W1
V Hash tables: basic implementation and operations,
Applications of hashing in unique identifier 2 46 T1/R3/W1
33 generation
34 V caching 1 47 T1/R3/W1

Chaitanya Knowledge City, NH-16, Rajahmundry 533 296, AP, India - www.giet.ac.in
Ver: March 2022
 DP/ 31.1

35 V caching 1 48 T1/R3/W1
S

Text Books Code Title

Textbooks:
1. Data Structures and algorithm analysis in C, Mark Allen Weiss, Pearson, 2nd
1 T1 Edition.

2. Fundamentals of data structures in C, Ellis Horowitz, Sartaj Sahni, Susan

Anderson- Freed, Silicon Press,
2 T2
2008

References Code Title

1 R1 1. Algorithms and Data Structures: The Basic Toolbox by Kurt Mehlhorn
and Peter Sanders

2 R2 2. C Data Structures and Algorithms by Alfred V. Aho, Jeffrey D. Ullman,

and John E. Hopcroft

3 R3 3. Problem Solving with Algorithms and Data Structures" by Brad Miller

and David Ranum
Web
References
Code URL
1 W1 1.https://www.coursera.org/specializations/data-structures-algorithms

Prepared and Submitted by Verified and Approved by Accepted by

Sign. of the faculty with date Sign. of the HoD Principal /

Vice-Principal(Acad.)

Chaitanya Knowledge City, NH-16, Rajahmundry 533 296, AP, India - www.giet.ac.in
Ver: March 2022