Lesson Plan

Department: Computer Science & Engineering Academic Semester: 2023-24 (Odd)

Semester: III Section: A Course Code: BCSL305 Contact Hrs /week:0.0:2
Course name: Data Structure Laboratory No. of Credits: 1
Teacher’s Name: Prof. Bindiya S P Designation: Assistant Professor
CIE: 50 SEE: 50 Exam Hours: 03

Prerequisites if any:

Course code Course Name Description Semester

NIL NIL NIL NIL

Course Syllabus (as prescribed by VTU)

COURSE OUTCOMES: At the end of the Course, the students will be able to
CO Course outcomes PO/PSO Course
No Mapping Target
(%)
CO
1
CO
2
CO
3
CO
4
CO
5

Mapping of COs v/s Pos and PSOs:

CO
COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3
Target

CO1
CO2
CO3
CO4
CO5
PO
Target

Correlation levels: 1-Slight (Low), 2-Moderate (Medium), 3-Substantial (High)

Gap(s) in the syllabus, if any 1.

LESSON PLAN: ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING – BCSL305

Course
Lecture RBT Outcom Planned Actual Remarks*
Lab
# Levels e dates Date
Mapping
Introduction to Data
1.
structure programming
Develop a Program
in C for the
following:
a) Declare a
calendar as an array
of 7 elements (A
dynamically Created
array) to represent
7 days of a week.
Each Element of the
array is a structure
having three fields.
The first
field is the name of
the Day (A
dynamically
allocated String),
The second field is
2. the
date of the Day (A
integer), the third
field is the
description of the
activity for a
particular day (A
dynamically
allocated String).

b) Write functions
create(), read() and
display(); to create
the calendar, to read
the data
from the keyboard
and to print weeks
activity details
report on screen.
3. Develop a Program
in C for the following
operations on
Strings.
a. Read a main
 String (STR), a
Pattern String (PAT)
and a Replace String
(REP)

b. Perform Pattern
Matching Operation:
Find and Replace all
occurrences of PAT
in
STR with REP if PAT
exists in STR. Report
suitable messages in
case PAT does not
exist in STR
Support the program
with functions for
each of the above
operations. Don't
use Built-in
functions..
Develop a menu
driven Program in C
for the following
operations on STACK
of Integers
(Array
Implementation of
Stack with maximum
size MAX)
a. Push an Element
on to Stack
b. Pop an Element
from Stack
4. c. Demonstrate how
Stack can be used to
check Palindrome
d. Demonstrate
Overflow and
Underflow situations
on Stack
e. Display the status
of Stack
f. Exit
Support the program
with appropriate
functions for each of
the above operations
5. Develop a Program
in C for converting
an Infix Expression
to Postfix
Expression. Program
should support for
both parenthesized
and free
 parenthesized
expressions with the
operators: +, -, *, /,
% (Remainder), ^
(Power) and
alphanumeric
operands.
Develop a Program
in C for the following
Stack Applications
a. Evaluation of
Suffix expression
with single digit
6. operands and
operators: +, -, *, /,
%,
^
b. Solving Tower of
Hanoi problem with
n disks
Characters (Array
Implementation of
Queue with
maximum size MAX)
a. Insert an Element
on to Circular QUEUE
b. Delete an Element
from Circular QUEUE
c. Demonstrate
7. Overflow and
Underflow situations
on Circular QUEUE
d. Display the status
of Circular QUEUE
e. Exit
Support the program
with appropriate
functions for each of
the above operations
8. Develop a menu
driven Program in C
for the following
operations on Singly
Linked List
(SLL) of Student
Data with the fields:
USN, Name,
Programme, Sem,
PhNo
a. Create a SLL of N
Students Data by
using front insertion.
b. Display the status
of SLL and count the
number of nodes in
it
 c. Perform Insertion /
Deletion at End of
SLL
d. Perform Insertion /
Deletion at Front of
SLL(Demonstration
of stack)
e. Exit
Develop a menu
driven Program in C
for the following
operations on
Doubly Linked List
(DLL) of Employee
Data with the fields:
SSN, Name, Dept,
Designation,
Sal, PhNo
a. Create a DLL of N
Employees Data by
using end insertion.
b. Display the status
9. of DLL and count the
number of nodes in
it
c. Perform Insertion
and Deletion at End
of DLL
d. Perform Insertion
and Deletion at Front
of DLL
e. Demonstrate how
this DLL can be used
as Double Ended
Queue.
f. Exit
10. Develop a Program
in C for the following
operationson Singly
Circular Linked List
(SCLL)
with header nodes
a. Represent and
Evaluate a
Polynomial P(x,y,z) =
6x2y2z-
4yz5+3x3yz+2xy5z-
2xyz3
b. Find the sum of
two polynomials
POLY1(x,y,z) and
POLY2(x,y,z) and
store the
result in
POLYSUM(x,y,z)
Support the program
 with appropriate
functions for each of
the above operations
Develop a menu
driven Program in C
for the following
operations on Binary
Search Tree
(BST) of Integers .
a. Create a BST of N
Integers: 6, 9, 5, 2,
8, 15, 24, 14, 7, 8, 5,
11. 2
b. Traverse the BST
in Inorder, Preorder
and Post Order
c. Search the BST for
a given element
(KEY) and report the
appropriate message
d. Exit
Develop a Program
in C for the following
operations on
Graph(G) of Cities
a. Create a Graph of
N cities using
12. Adjacency Matrix.
b. Print all the nodes
reachable from a
given starting node
in a digraph using
DFS/BFS
method
Develop a Program
in C for the following
operations on
Graph(G) of Cities

13. b. Print all the nodes

reachable from a
given starting node
in a digraph using
DFS/BFS
method
14. Given a File of N
employee records
with a set K of Keys
(4-digit) which
uniquely determine
the records in file F.
Assume that file F is
maintained in
memory by a Hash
Table (HT) of m
memory locations
 with L as the set of
memory addresses
(2-digit) of locations
in HT. Let the
keys in K and
addresses in L are
Integers. Develop a
Program in C that
uses Hash function
H:
K →L as H(K)=K mod
m (remainder
method), and
implement hashing
technique to map a
given key K to the
address space L.
Resolve the collision
(if any) using
linear probing.

Internal Evaluation Tests Dates Remarks

1 Lab Internals 19-02-2024 & 20-02-2024
2
3
RBT: L1 – Remembering; L2 – Understanding; L3 – Applying; L4 – Analysing; L5 – Evaluating; L6 – Creating.

*Remarks: This column includes space for noting reasons for deviations in date of class conduction and
HOD’s sign

Laboratory Outcomes : The student should be able to:

● Analyze various linear and non-linear data structures

● Demonstrate the working nature of different types of data structures and their
applications
● Use appropriate searching and sorting algorithms for the give scenario.
● Apply the appropriate data structure for solving real world problems

Assessment rubrics: (under direct assessment)

CIE- Continuous Internal Evaluation: Theory (50 Marks)

 Assignments/ Activity based
Tests
Bloom’s Category Seminars ()
()
()
Marks (out of 50)
Remember
Understand
Apply
Analyze
Evaluate
Create

Faculty HOD