Scribd
Upload
11 views3 pages

Csa - LP

The document outlines the Lesson Delivery Plan for the Data Structures and Algorithms course (CD3291) at Arasu Engineering College for the academic year 2025-2026. It details the topics to be covered across five units, including Abstract Data Types, Linear Structures, Sorting and Searching, Tree Structures, and Graph Structures, with a total of 45 allotted periods. The plan includes sections for tracking the actual number of periods taught and any deviations from the original plan.

Uploaded by

parvathy
Copyright
© All Rights Reserved
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
11 views3 pages

Csa - LP

The document outlines the Lesson Delivery Plan for the Data Structures and Algorithms course (CD3291) at Arasu Engineering College for the academic year 2025-2026. It details the topics to be covered across five units, including Abstract Data Types, Linear Structures, Sorting and Searching, Tree Structures, and Graph Structures, with a total of 45 allotted periods. The plan includes sections for tracking the actual number of periods taught and any deviations from the original plan.

Uploaded by

parvathy
Copyright
© All Rights Reserved
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

ARASU ENGINEERING COLLEGE, KUMBAKONAM – 612 501

DEPARTMENT OF INFORMATION TECHNOLOGY


LESSON DELIVERY PLAN

Subject Code & Name: CD3291 Data Structures and Algorithms Semester : II
Branch : AI & DS Academic Year : 2025-2026(ODD)

Actual HoD’s
Date Total No. Whether Reason for Signature
S. No. of Comment
of Periods Topics as per Deviation if Correction of the
No Periods with
From To Planned the Plan any. Staff
Taken Signature
Unit I: ABSTRACT DATA TYPES Allotted Periods : 9
Abstract Data Types (ADTs)
ADTs and classes
Introduction to OOP
Classes in Python
Inheritance
1
Namespaces

Shallow and deep copying,


Introduction to analysis of algorithms.
Asymptotic notations – recursion

Analyzing recursive algorithms

UNIT II: LINEAR STRUCTURES Allotted Periods:9


List ADT
Array-based implementations
2
Linked list implementations
singly linked lists
Circularly linked lists
doubly linked lists
Applications of lists
Stack ADT, Queue ADT

double-ended queues

UNIT III: SORTING AND SEARCHING Allotted Periods: 9


Bubble sort – selection sort efficiency
Insertion sort – merge sort
Quick sort
linear search
3 9 binary search
hashing – hash functions
Collision handling
load factors,
Rehashing and efficiency.
UNIT IV: TREE STRUCTURES Allotted Periods: 9
Tree ADT
Binary Tree ADT
Tree traversals
Binary search trees
4
AVL trees
Heaps
Multi-way search trees.
Unit V: GRAPH STRUCTURES Allotted Periods: 9
Graph ADT
Representations of graph
Graph traversals
DAG
Topological ordering
5
Greedy algorithms – dynamic programming
Shortest paths
Minimum spanning trees.
Introduction to complexity classes and
intractability

Prepared by: Staff _____________________________________

Approved by: HoD _____________________________________

You might also like