LESSON PLAN FOR C AND DATA STRUCTURE

Class No 1

Topic to be covered Introduction to c programming, data type, constant, variables, operator, type casting. Conditional statement: - If, if else, switch. Looping: - While, do while, for, statement (with break and continue statement). (Discus short questions on it)

Array: - 1d array, 2d array, memory representation of 2d array, array operation. Problem solving for array. String different operation on string, table of string. Structure & union:- Fundamental concept of structure & union.

Pointer: - Fundamental concept of pointer. Structure with pointer, array with pointer, pointer arithmetic.

Function: - Fundamental concept of function, and recursion. Give suitable example for recursion like ->factorial of a number using recursion. ->Sum of array element using recursion. ->Sum of digits of a number using recursion. ->Fibonacci series using recursion. ->GCD of two number using recursion.

Function with array: How to pass 1d and 2d array as function argument, problem solving. Function with structure:-How to pass structure as function argument, problem solving. Function with pointer:-How to pass reference as function argument, problem solving.

Scope of variable: Public, static, resister, global. File pointer, how to create file, different mode of file.

Some file program:Read an array of elements from user and sort it and store it in a file. Copy the contents of one file to another file,

Introduction to data structure:- Data structure definition, classification of data structure. Analysis of algorithm:- Time and space complexity. Sparse matrix: Its representation and program for sparse matrix.

10

Single linked list:- Dynamic memory allocation, single linked list, and its operation.

11

Representation of polynomial equation using linked list. Double linked list and its operation. Circular linked list and its operation.

12 13

Stack:- Array and linked list representation and its operation. Infix, post-fix, and pre-fix representation of polynomial equation. Conversion of infix equation to its post-fix and pre-fix equivalent. Evaluation of post-fix and pre-fix.

14

Queue:- Array and linked list representation and its operation. Circular queue:- Its array and linked list representation.

15

Searching:- linear and binary search. Sorting: - Bubble sort, insertion sort, selection sort.

16 17

Sorting: Quick sort, merge sort. Tree:- Terminology, types of tree. Array and linked list representation of binary tree. Insertion, deletion, and traversing of binary search tree.

18

Graph: Graph terminology, representation of graph. Bfs and dfs traversal