You are on page 1of 2

MADANAPALLE INSTITUTE OF TECHNOLOGY & SCIENCE

(UGC-AUTONOMOUS INSTITUTION)
Affiliated to JNTUA, Ananthapuramu & Approved by AICTE, New Delhi
NBA Accredited - B.Tech. (CIVIL, CSE, ECE, EEE, MECH), MBA & MCA

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING


LESSON PLAN

Class: II CSE No. of Periods/week : 3 Hours


Branch: CSE Academic Period : 2021-22 & 1st Sem
Course: Data Structures Laboratory Name of the Staff : Dr S. Mohapatra

Text/
Teaching Aid Refer
Lect.No TOPIC COVERED Date
ence
Book
Write a program to implement Singly Linked Chalk & Talk 22.11.21
List and its operations. LCD
Projector
1-3  Insert R1 & R2
 Delete
 Traversal
Write a program to implement Circular Chalk & Talk 29.11.21
Doubly Linked List and its operations. LCD
Projector
4-6  Insert R1 & R2
 Delete
 Traversal
Write a program to add two polynomials using Chalk & Talk 06.12.21
7-9 Singly Linked List LCD R1 & R2
Projector
 Write a program to implement stack Chalk & Talk 13.12.21
LCD
operations by using array Projector
10-12  Write a program to implement stack R1 & R2
operations by using linked list

 Write a program that uses stack Chalk & Talk 20.12.21


LCD
operations to convert a given infix Projector
expression to postfix
13-15  Write a program that uses stack R1 & R2
operations to evaluate given postfix
expression

 Write a program to implement the 27.12.21


operations of Queue using array. Chalk & Talk
16-18  Write a program to implement the LCD R1 & R2
Projector
operations of Queue using linked list.
Write a C program to implement Circular Chalk & Talk 03.01.21
19-21 Queue using Array LCD
R1 & R2
Projector
Write a program to implement the binary Chalk & Talk 10.01.21
22-24 search tree operations LCD R1 & R2
Projector
Write a program to perform the tree traversal Chalk & Talk 17.01.21
25-27 techniques by using recursion LCD R1 & R2
Projector
Write a program to perform the tree traversal Chalk & Talk 24.01.21
28-30 techniques without recursion LCD R1 & R2
Projector
Write a program to sort the set of elements by Chalk & Talk 31.01.21
31-33 using bubble, selection and quick sort LCD R1 & R2
Projector
Write a program to sort the set of elements by Chalk & Talk 07.02.21
34-36 using insertion, merge and heap sort LCD R1 & R2
Projector
Write a program to implement all functions a Chalk & Talk 14.02.21
37-39 dictionary by using hashing LCD R1 & R2
Projector
Write a program to implement insertion and Chalk & Talk 21.02.21
40-42 deletion operation on AVL trees LCD R1 & R2
Projector
Write a program for implementing the 28.02.21
Chalk & Talk
43-45 following graph traversal algorithms LCD R1 & R2
 DFS and BFS Projector

REFERENCE BOOKS:
R1: Data Structures Through C by Kanetkar Yashavant, BPB publications, 3rd Edition
R2. Data Structures using C and C++, YedidyahLangsam.MosheJ.Augenstein Aaron
M.Tenenbaum, 2nd Edition, PHI.

Faculty In-Charge Programme Co-ordinator Head of the Department

You might also like