Scribd
Upload
42 views

Seesion Plan Ds

The document outlines a semester plan for a Data Structures and Algorithms course. It includes 30 lectures spread over 15 weeks covering various topics like arrays, stacks, queues, linked lists, trees, graphs, sorting, and algorithm analysis. For each lecture, it lists the unit number, topic, status (planned or executed), date, time period, and faculty signature. The plan aims to introduce fundamental data structures and their implementation while also explaining common algorithms and analytical concepts.

Uploaded by

api-3747330
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
42 views

Seesion Plan Ds

The document outlines a semester plan for a Data Structures and Algorithms course. It includes 30 lectures spread over 15 weeks covering various topics like arrays, stacks, queues, linked lists, trees, graphs, sorting, and algorithm analysis. For each lecture, it lists the unit number, topic, status (planned or executed), date, time period, and faculty signature. The plan aims to introduce fundamental data structures and their implementation while also explaining common algorithms and analytical concepts.

Uploaded by

api-3747330
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 3

Session Plan & Execution

Faculty: Akshat Agrawal Semester:- III Class:-ECE-B


Course Code:- CSE-201-E Course Title:- Data structures and algorithm

Plan Execution
S. No. Week & Lecture Unit Topic Status Date Period Sign
Month
1 I Aug I I Introduction,data structures ,classifications,data
types,operations,abstract data types,static ,dynamic,examples
applications

2 II Aug II Arrays ,dimension,subscript,defining and declaring


arrays,accessing elements,single dimensional arrays

3 III Two dimensional arrays and multidimensional


arrays,addressing mechanisms and programs

4 IIIAug 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

7 IV Aug I II Introduction to queues,array implementation of linear


queue,basic operation

8 II Static & dynamic data structures,their


comparisons,advantages,concept of a node as a structure,usage
in c language

9 V Aug III Introduction to linked lists ,header pointers ,nodes ,traversals ,


memory storage and address manipulations
10 I Sep IV Operations on linked lists , getnode , freenode, insertnode,
removenode , empty list

11 V Linked implementation of stacks

12 II Sep VI Linked implementation of queues, Circular linked lists and


operations.

13 VII Doubly linked lists and operations

14 VIII Dequeues and priority queues,applications

15 III Sep IX Revision and clarifications

16 I III Trees , basic terminology and definitions, Binary trees,


representations , binary tree traversals

17 II Tree traversal algorithms ,preorder traversal using stacks

18 III Binary search trees ,constructions , applications

19 IV Sep IV Balanced trees ,threaded trees, AVL trees

20 V Applications of trees, mathematical expressions, recursion


trees, concept of recursion and iteration.

21 I IV Graphs basic terminology, classifications and definitions,


Representation of graphs, matrix, list ,path matrix ,transitive
closure, BFS algorithm, DFS algorithm

22 V Sep II Minimum spanning trees , kruskals algorithm

23 III Shortest path algorithm

24 IV Tables, hashing ,applications and concept


25 IOct I V Concept of algorithm analysis space and time complexity,
Big oh notation and running times, Time complexity
considerations.
26 II Oct II Best average and worst case analysis, divide and conquer
methodology

27 I VI Concept of searching and sorting methods


Linear and binary search

28 III Oct 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

31 I Nov V Heapsort and analysis

You might also like