PAGE \* MERGEFORMAT 10

THE NEOTIA UNIVERSITY

Lesson Plan (LP) Odd Semester 2025-26
Programme Name: [Link]. in CSE (Data Science/Cyber)

Document TNU- Dean Academics/ LP/ Even 2024/ F-Ac 002

Number:
Name of Document: Data Structure and Algorithm- Lesson Plan
Applicability:
Policy Owner
Policy Status:
Date of approval:
Date last amended:
Date last reviewed:
Date of next review:

Course Name Database Management System

Course Code
Course Duration 6 months
Year Level 2nd year (3rd Semester)
Course Coordinator (if
more than one teaching
staff responsible)
Teaching Staff/s Nazrul Islam
Core/Elective Core
Pre/Co-requisites Basic Programming and Elementary mathematics
Credit Points 2

Off Campus
Mode of Delivery
Full-time

Weekly Delivery/
4
Contact Hours
Resource
Whiteboard / Projector
Requirements

Mr. Nazrul Islam

Contact Name:

Position: Assistant Professor

Telephone & Email: [Link]@[Link]
Class conducted at
Sb 3
Building/ Room No.

Page PAGE 10 of NUMPAGES 7

 PAGE \* MERGEFORMAT 10

It is advisable that all classes should be smart enough to engage and involve the students
of the class to the fullest. Components like Video clips, Animations, Expert opinions,
Simulation games, case based study, Synchronous or asynchronous global knowledge and
blend of any of these have a delivery option to match the needs and preferences.
Personalized handouts after each class should be considered as a mark of dedication
towards achieving the goal.
These course delivery formats enable you to balance your schedule while gaining real-
world, relevant skills in a stimulating environment.

Course Objectives:
1. To learn the basics of abstract data types.
2. To learn the principles of linear and nonlinear data structures.
3. To build an application using sorting and searching.
4. To be able to implement various data structures in more than one manner with the advantages
and disadvantages of the different implementations for energy efficient by using efficient
representation of problems.

Course Outcomes (COs):

On completion of the course, the students will be able to

COURSE
OUTCOM ATTRIBUTES Level (As per Bloom’s
ES (CO)
Taxonomy)
Differentiate how the choices of data structure & L2
CO1 algorithm methods impacts the performance of the
program.
Solve problems based upon different data structure & L3
CO2
also write programs.
Identify appropriate data structure and algorithmic L4
CO3
methods in solving problem.
CO4 Learn the use of Tree and Graph. L2
Know the computational efficiency of the principal L3
CO5
algorithms for sorting, searching and hashing.
Compare and contrast the benefits of dynamic and L4
CO6
static data structures implementations.

References:
Text Books:
[1] “Data Structures And Program Design In C”, 2/E by Robert L. Kruse, Bruce P. Leung.
[2] “Fundamentals of Data Structures of C” by Ellis Horowitz, Sartaj Sahni, Susan Anderson-
freed.
Reference Books:
[1] “Data Structures in C” by Aaron M. Tenenbaum.
[2] “Data Structures” by S. Lipschutz.
[3] “Data Structures Using C” by ReemaThareja.
[4] “Data Structure Using C”, 2/e by A.K. Rath, A. K. Jagadev.
[5] “Introduction to Algorithms” by Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest,
Clifford Stein

Page PAGE 10 of NUMPAGES 7

 PAGE \* MERGEFORMAT 10

Web references:
1. [Link]
2. [Link]
and-algorithms/

Video Link (preferably):

Student Assessment
Weightage
Assessment Type (% of total Learning Outcomes (LOs)
course marks)
Minor test - I 10

 Apply various data structures such as arrays,

Minor test II 10
stacks, queues, linked lists, trees, and graphs in
Theory End term 50
Examination solving computational problems.
Practical Examination  Analyze time and space complexity of algorithms
and data structure operations.
Viva 10  Compare and contrast different sorting, searching,
and hashing algorithms based on their
performance.
Record 5  Design efficient algorithms using divide and
conquer, greedy, and dynamic programming
paradigms.
 Develop real-world problem solutions using
appropriate data structures and algorithmic
Workout 5
strategies.

Assignment 5
Attendance 5
Total 100

Other Assessment Information (if any):

Page PAGE 10 of NUMPAGES 7

 PAGE \* MERGEFORMAT 10

Clas Type CO COGNITIVE Reference Resource Materials

LEVELS OF
s For ERP: (L/T/P/ ATTAINME and Chapter
No. Q/A/ S/C/ NT AS PER number
BLOOM’S Upload Video Link
V/W/O) TAXONOMY file (preferably)

1 Array and its application P CO1, BL1, BL2

CO3
Understanding Sparse P CO1, BL2, BL3
2 Matrix and its application CO3

Use of Structure and P CO1 BL3

3 Pointer

Implementation of Single P CO2, BL2, BL3

4 Linked List CO3

Extending the concept of P CO2, BL2, BL3

Single Linked List to CO3
implement Double
5 Linked List

Implementation of Stack P CO2, BL3, BL4

operations for dynamic CO6
data storage management
6 in one direction

Application of Stack to P CO2, BL3, BL4

convert expression from CO6
7 one form to another

Implementation of Queue P CO2, BL3, BL4

operations for dynamic CO3
8 data storage management
in two directions
Extending concept of P CO2, BL3, BL4
Queue to implement CO6
Circular Queue for better
9 data storage management

Use of Sorting P CO2, BL3, BL4

Algorithms to sort a CO6
given set of data either in
ascending order or in
10 descending order

Use of Searching P CO2 BL3, BL4

Algorithms to search a
11 run-time data within a set
of data.
Implementation of Binary P CO1, BL1,
12 Tree CO2 BL2, BL3

Page PAGE 10 of NUMPAGES 7

 PAGE \* MERGEFORMAT 10

Implementation of Binary P CO1, BL3

13 Search Tree CO2

14 Case Study Analysis P CO1, BL3

CO2

Key: L=Lecture; T=Tutorial;P= Practical;

Discussion related to review on Q= Quiz; A= Assignment;S= Simulation; C= Case

Study; V=Video; W= Workshop;O=Others (need to specify)

Attainment of Program Outcomes (POs) and Program Specific Outcomes (PSOs)

through Course Outcomes (COs)

Any Other Remarks

The entire course outline and its’ design enabling skill sets will be taught and/or assessed to varying
degrees in the following areas of POs and PSOs:
PROGRAMME
COURS
PROGRAMME OUTCOME SPECIFIC
E
(PO) OUTCOME
OUTC
(PSO)
OME
P P P P P P P P P PO PO PO PSO PS PS
(CO)
O1 O2 O3 O4 O5 O6 O7 O8 O9 10 11 12 1 O2 O3
CO1 3 3 3 3 2 1 1 1 1 1 2 2 2 2 2
CO2 3 3 3 3 - 1 1 1 1 1 2 2 2 2 2
CO3 3 3 3 3 - - - - 1 1 - 2 2 2 2
CO4 3 3 3 3 - - - - 1 1 - 2 2 2 1
CO5 3 3 3 3 - - - - 1 1 - 2 2 3 1
CO6 3 3 3 3 - - - - 1 1 - 2 2 3 2
Avg. 3 3 3 3 2 1 1 1 1 1 2 2 2 2.3 1.7
Strong contribution: 3, Average contribution: 2, Low contribution: 1

Page PAGE 10 of NUMPAGES 7