Lesson Plan

Name of the faculty: PREETI KATARIA

Discipline: Computer Engineering

Semester: 4TH

Subject: DATA STRUCTURE USING C

Lesson Plan Duration: 15 weeks (from January, 2018 to April, 2018)

Week Theory Practical

Lecture Topic (including assignment / test) Practical Topic
Day Day

1st 1 Unit -1 Introduction of data structure 1 Write programmes in C

Problem solving concept top down and
bottom up design ,

2 structured programming 2 Addition of two numbers

Concept of data types
3 variables and constants

2nd 4 Concept of pointer variables and 3 The addition of two matrices

constants using functions

5 Doubts and assignment 4

The addition of two matrices
using functions

6 test
3rd 7 Unit -2 Introduction of Arrays 5 The addition of two matrices
using functions

8 Concept of Arrays 6 Write programmes in C to

implement
Sorting an array

9 Storage representation of multi-

dimensional arrays.
4th 10 Operations on arrays with Algorithms 7 Write programme in two
searching dimensional array
 11 traversing, inserting, deleting . 8 Sorting an array

12 Doubt & Revision

5th 13 Unit -3 Introduction of Linked Lists 9 Insertion of elements in linked

list

14 Representation of linked lists in 10 deletion of elements in linked

Memory list

15 Operations on linked list Insertion

6th 16 deletion and traversals 11 Insertion of elements in doubly
linked list

17 Application of linked lists 12 The linear search procedures to

search an element in a given list

18 Doubly linked lists

7th 19 Operations on doubly linked lists 13 deletion of elements in doubly

Insertion linked list

20 deletion and traversals , doubt & 14 The binary search procedures to

assignment search an element in a given list

21 Class test

8th 22 Unit -4 Stacks, Queues and Recursion 15 Push operation in stack

Introduction to stacks

23 Representation of stacks 16 pop operation in stack

Implementation of stacks

24 Applications of stacks

9th 25 Introduction to queues 17 Inserting elements in queue

Implementation of queues

26 Circular Queues 18 deleting elements in queue

De-queues

27 Application of Queues
Recursion n doubt
10th 28 Class test 19 Inserting elements in circular
queue

29 Unit -5 Introduction of Trees 20 deleting elements in circular

queue

30 Concept of Trees

11th 31 Representation of Binary tree in 21 The Factorial of a given number

memory with recursion and without
Traversing Binary Trees Pre order recursion

32 Post order and In order 22 Fibonacii series with recursion

and without recursion

33 Searching, inserting binary search trees

12th 34 Deleting binary search trees 23 Program for binary search tree
operation

35 Introduction to Heap 24 Program for binary search tree

operation

36 Doubt and assignment

13th 37 Unit-6 Introduction of Sorting and 25 The selection sort technique

Searching
38 Introduction to sorting and searching 26 The bubble sort technique

39 Search algorithm Linear

14th 40 Search algorithm Binary 27 The quick sort technique

41 Doubts and assignments 28 The merge sort technique

42 Class test
15th 43 revision 29 The merge sort technique

44 Sample paper solve 30 The merge sort technique

45 revision