Lesson
Plan
Name of Faculty: Raj Bala
Discipline: Computer Engg
Semester: 4TH
Subject: Data Structures Using C
Lesson Plan Duration: 15 Weeks (From January 2020 to May 2020 )
Week Theory Practial
Lecture Topic (including Pr Topic
Day assignment/test ) Da
y
1st 1st Problem solving concept, top down 1 Inserting elements in array
and bottom up design
structured programming Concept of
2nd data types, variables and constants
Concept of pointer variables and 2 Inserting elements in array
3rd constants, Introduction to data
Structure
2nd Array, Linked List, Stack, 3 deleting elements in array
4th
5th Queue, Trees, graphs 4 deleting elements in array
6th Revision
3rd 7th
Concept of Arrays, 5 The addition of two matrices
Single dimensional array using
8th functions
Two dimensional array 6 The addition of two
9th matrices using functions
4th 10th Representation of Two 7 Insertion of elements in
dimensional Array (Base linked list
Address, LB, UB)
searching,
11th
traversing, 8 Deletion of elements in
12th
linked list
5th 13th Inserting 9 Insertion of elements in
Inserting doubly linked list
14th
deleting 10 Deletion of elements in
15th doubly linked list
6th Revision 11 Viva-Voce/File Check
16th
Test 12 Push and pop operation in
17th
stack
18th Introduction to linked list and double
linked list Representation of linked
lists in Memory
7th 19th Comparison between Linked Listand 13 Conversion from in-
Array Traversing alinked list Fix to postfix notation
Searching linked list
Insertion, deletion into linked list (At 14 Conversion from in- fix to
20th first Node, Specified Position, Last ) postfix notation
21st Application of linked lists
8th Doubly linked lists 15 The factorial of a given
22nd
Traversing Doubly linked lists number using recursion
23rd
Insertion and deletion into doubly linked lists 16 Fibonacci Series using
24th
recursion
9th 25th Introduction to stacks, Representation of stacks 17 Insertion and
with array and Linked List Deletion of elements
in queue using
pointers
Implementation of stacks
26th 18 Insertion and
Application of stacks: Polish Notations Deletion of elements
27th
in queue using pointers
10th Converting Infix to Post Fix Notation 19 Insertion of elements
28th
Test in circular queue
29th using pointer
Evaluation of Post Fix Notation, Tower of 20 Deletion of elements
30th
Hanoi Recursion: Concept and Comparison in circular queue
between recursion and Iteration using pointers
11th Introduction to queues, Implementation of 21 File
31st queues Check/Revision/Viva
using array algorithm
Implementation of queues using Linked List with
32nd
algorithm
Circular Queues , De-queues 22 Traversing of tree
33rd
12th Concept of Binary Trees, Concept of 23
34th
representation of Binary Tree Heap Sort
Concept of balanced Binary Tree
35th
Traversing Binary Trees (Pre order, Post order 24 The linear search
36th and In procedures to search
order)
an element in given
list
13th Searching, 25
37th
The binary search
inserting in binary search trees, deleting in
38th procedures to search
binary search trees
an element in a given
list
Linear Search algorithm, Binary Search 26 The bubble sort
39th algorithm techniques
14th Concept of sorting , Bubble Sort, Insertion Sort 27
40th
Selection Sort The selection sort
41st techniques
Merge Sort, Radix Sort 28 The quick sort
42nd
technique
15th Heap Sort 29 The merge sort
43rd
Test technique
44th
Revision 30 File Check/Viva voce
45th
