LESSON PLAN

Regulation: RM21

Class : I B.Tech -II SEM Course : DATA STRUCTURS

Name of the Faculty: B.RAJU Academic Year : 2024-2025

Branch: CSE-AI-A
S.No Topic Mode of Proposed Conducted Remarks
teaching date date
UNIT-I

1 Introduction to Linear DS BB 27/01/25

28/01/25
2 Definition and importance of linear ds BB 29/01/25

3 Abstract data types(ADT’s) BB 30/01/25

31/01/25
4 ADT implementation BB 01/02/25
03/02/25
5 Overview of time and space complexity BB 04/02/25
05/02/25
6 Analysis for linear DS BB 06/02/25
07/0225
7 Searching Techniques introductions PPT 08/02/25
10/02/25
8 Linear search BB 11/02/25

9 Binary search BB 12/02/25

13/02/25
10 Sorting techniques Bubble sort BB 14/02/25

11 Selection sort PPT 18/02/25

19/02/25
12 Insertion sort BB 20/02/25
21/02/25
UNIT II

13 Introduction to Linked Lists BB 22/02/25

24/02/25
14 Singly linked lists BB 28/02/25

15 Representation and operations BB 03/03/25

04/03/25
16 Doubly linked lists BB 05/03/25
06/03/25
17 Doubly linked lists PPT 07/03/25
08/03/25
18 Circular linked list PPT 10/03/25
11/03/25
19 Circular linked list BB 12/03/25

20 Comparing arrays and linked lists BB 13/03/25

15/03/25
21 Applications of linked lists BB 17/03/25
18/03/25
UNIT – III

22 Introduction to Stacks BB 19/03/25

20/03/25
23 Properties and operations BB 21/03/25
22/03/25
24 Implementing stacks using arrays PPT 31/03/25

25 Implementing stacks using linked lists BB 01/04/25

02/04/25
26 Applications of stacks BB 03/04/25
04/04/25
27 Expression evaluation PPT 05/04/25
07/04/25
28 Backtracking BB 08/04/25

29 Reversing list PPT 09/04/25

30 Introduction to stacks BB 10/04/25

31 Properties and operations BB 11/04/25

12/04/25
32 Implementing queues using arrays BB 14/04/25
15/04/25
33 Implementing queues using liked lists PPT 16/04/25
17/04/25
34 Applications of queues in BFS BB 19/04/25

35 Scheduling BB 21/04/25

36 Introduction to deques (Double ended queues) PPT 22/04/25

37 Operations on deques and their applications BB 23/04/25

24/04/25
UNIT-V

38 Introduction to Trees BB 25/04/25

26/04/25
39 Binary Search Tree PPT 28/04/25
29/04/25
Insertion BB 30/04/25
40 02/05/25
41 Deletion PPT 03/05/25
05/05/25
 42 Traversal BB 06/05/25
07/05/25
43 Introduction to Hashing BB 13/05/25
14/05/25
44 Hash Functions BB 15/05/25
16/05/25
45 Collisionresolution techniques Chaining BB 19/05/25
20/05/25
46 Open Addressing BB 21/05/25
22/05/25
47 Hash Tables BB 23/05/25
26/05/25
48 Basic Implementation BB 27/05/25
28/05/25
49 Operations BB 29/05/25
30/05/25
50 Applications of hashing in unique identifier BB 31/05/25
generation 02/06/25

51 Caching BB 03/06/25
04/06/25

COS Unit no CO
Explain the role of linear Data structures in organizing and accessing data efficiently in
CO 1 1
algorithms
Design implement and apply linked lists for dynamic data storage demonstrating
CO 2 2
understanding of memory allocation.
Develop programs using stacks to handle recursive algorithms manage program states
CO 3 3
and solve related problems
Apply queues based algorithms for efficient task scheduling and breadth first traversal
CO 4 4 in graphs and distinguish between d-ques and priority queues and apply them
appropriately to solve data management challenges
CO 5 5 Devise novel solutions to small scale programing challenges involving data structures

FACULTY HOD PRINCIPAL