Seesion Plan Ds

Session Plan & Execution

Faculty: Akshat Agrawal Course Code:- CSE-201-E

Semester:- III

Class:-ECE-B Course Title:- Data structures and algorithm

Plan S. No. Week & Month 1 I Aug

2

II Aug

Lecture Unit Topic I

I

Introduction,data structures ,classifications,data types,operations,abstract data types,static ,dynamic,examples applications

II

Arrays ,dimension,subscript,defining and declaring arrays,accessing elements,single dimensional arrays

III

Two dimensional arrays and multidimensional arrays,addressing mechanisms and programs

IV

Concept of structures and unions concepts in C language

5

V

Stacks ,operations,static or array based implementation of stacks and related algorithms

6

VI

Mathematical expressions,notations and conversions

3 4

7

IIIAug

IV Aug

8

9

V Aug

I

II

Introduction to queues,array implementation of linear queue,basic operation

II

Static & dynamic data structures,their comparisons,advantages,concept of a node as a structure,usage in c language

III

Introduction to linked lists ,header pointers ,nodes ,traversals , memory storage and address manipulations

Status

Execution Date Period

Sign

10

I Sep

IV

Operations on linked lists , getnode , freenode, insertnode, removenode , empty list

V

Linked implementation of stacks

VI

Linked implementation of queues, Circular linked lists and operations.

13

VII

Doubly linked lists and operations

14

VIII

Dequeues and priority queues,applications

IX

Revision and clarifications

11 12

15

II Sep

III Sep

16

I

17

II

Tree traversal algorithms ,preorder traversal using stacks

18

III

Binary search trees ,constructions , applications

IV

Balanced trees ,threaded trees, AVL trees

20

V

Applications of trees, mathematical expressions, recursion trees, concept of recursion and iteration.

21

I

19

22

IV Sep

V Sep

III

IV

Trees , basic terminology and definitions, Binary trees, representations , binary tree traversals

Graphs basic terminology, classifications and definitions, Representation of graphs, matrix, list ,path matrix ,transitive closure, BFS algorithm, DFS algorithm

II

Minimum spanning trees , kruskals algorithm

23

III

Shortest path algorithm

24

IV

Tables, hashing ,applications and concept

25

IOct

I

26

II Oct

II

27 28

I

Concept of algorithm analysis space and time complexity, Big oh notation and running times, Time complexity considerations. Best average and worst case analysis, divide and conquer methodology

VI

Concept of searching and sorting methods Linear and binary search

II

Sorting algorithms, selection sort, insertion sort

29

III

Bubble sort and analysis, Shell sort and analysis

30

IV

Merge sort and analysis, Quicksort and analysis

V

Heapsort and analysis

31

III Oct

V

I Nov