SJCIT Lesson Plan

Estd: 1986

Department of Computer Science and Engineering

LESSON PLAN
SUBJECT TITLE Analysis & Design of Algorithms Lab
SUBJECT TYPE CORE
SUBJECT CODE BCSL404
ACADEMIC YEAR 2024-25 (EVEN SEMESTER) BATCH 2022-2026
SCHEME CBCS scheme (Effective from the academic year 2022 -2023)
SEMESTER & SECTION IV / A, B, C
IA MARKS 50 EXAM MARKS 50
NUMBER OF LECTURE TOTAL NUMBER OF
2(P)=2 24
HOURs/WEEK LECTURE HOURS
Mrs. Bhavya R A NO. OF TIMES
FACULTY NAME 03
HANDLED
COURSE LEARNING OBJECTIVES: This course (BCSL404) will enable students to:
1. To design and implement various algorithms in C/C++ programming using suitable development tools to
address different computational challenges.
2. To apply diverse design strategies for effective problem-solving
3. To Measure and compare the performance of different algorithms to determine their efficiency and
suitability for specific tasks.

Course Outcomes: At the end of this course, students are able to:
CO1 Develop programs to solve computational problems using suitable algorithm design strategy.
Compare algorithm design strategies by developing equivalent programs and observing running
CO2
times for analysis (Empirical).
CO3 Make use of suitable integrated development tools to develop programs
Choose appropriate algorithm design techniques to develop solution to the computational and
CO4
complex problems
Demonstrate and present the development of program, its execution and running time(s) and
CO5
record the results/inferences
CO-PO MATRIX
COURSE
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
OUTCOMES
CO1 3 2 2 2 2 - - - 1 2 - 1 2 2
CO2 3 2 2 2 2 - - - 2 2 - 2 2 2

CO3 3 2 2 2 2 - - - 2 2 - 2 2 2

CO4 3 2 2 2 2 - - - 2 2 - 2 2 2

CO5 3 2 3 2 2 - - - 2 2 - 2 3 -
1: Slightly 2: Moderately 3: Substantially

Note: Justification of CO-PO mapping

C0-PO MAPPED
REASON
MAP VALUE

CO1-PO1 3
Mathematical knowledge is required for analyzing complexity of the algorithms
Use different methods, skills necessary for algorithms design needs a strong
CO1-PO2 2
knowledge of problem analysis.

CO1-PO3 2 Students will be able to design new algorithms using divide and conquer
technique.
CO1-PO4 2 Students will be able to choose the appropriate algorithms in design of
applications to solve complex problems.
CO1-PO5 2 Students will be able use tools such as eclipse, netbeans to design and develop
applications.
CO1-PO9 1 Students can able to analyze and compute the complexity of algorithm

CO1-P12 1 Analyzing and computing complexity of real time problems

CO1-PSO Acquiring the knowledge different techniques which helps in solving complexity
2 of the algorithms
1/2

Students will be able to gain the knowledge of general plan of recursive and
CO2-PO1 3 non-recursive algorithms and theory of backward substitution in divide and
conquer technique.
CO2-PO2 2 Strongly mapped as students will be able to analyze the time and space complexity
of recursive and non-recursive algorithms.

CO2-PO3 2 Students will be able to design new algorithms using divide and conquer
technique.
CO2-PO4 2 Students will be able to choose the appropriate algorithms in design of
applications to solve complex problems.
CO2-PO5 2 Students will be able use tools such as eclipse, netbeans to design and develop
applications.
 Students will able to communicate each other for solving different problem
CO2-P09 2
statements using these algorithm design methods.

Students will able to communicate each other for solving different problem
CO2-P10 2
statements using these algorithm design methods.

Students will be able to analyze the efficiency of any new algorithm designed by
CO2-P12 2
divide and conquer for real world problems.

CO2-PSO Knowledge of designing different algorithm for sorting, searching and graph
2 related problems by using different methods like Brute force, Divide and Conquer,
1/2 Greedy Technique etc.

Students will be able to gain the knowledge of general plan of recursive and
CO3-PO1 3
non-recursive algorithms and theory of backward substitution in divide and
conquer technique.
CO3-PO2 2 Strongly mapped as students will be able to analyze the time and space complexity
of recursive and non-recursive algorithms.
CO3-PO3 2 Students will be able to design new algorithms using greedy method, transform
and conquer approaches
CO3-PO4 2 Students will be able to choose the appropriate algorithms in design of
applications to solve complex problems.
CO3-PO5 2 Students will be able use tools such as eclipse, netbeans to design and develop
applications.
Students will able to communicate each other for solving different problem
CO3-P09 2
statements using these algorithm design methods.

Students will be able to present seminar for the different problems using these algorithm
CO3-P10 2
designs techniques.

Students will be able to analyze the efficiency of any new algorithm designed
CO3-P12 2
greedy method, transform and conquer approaches

CO3- Knowledge of designing different algorithm for problems by greedy method,

2
PSO1 transform and conquer approaches

CO3- Knowledge of designing different algorithm for problems by greedy method,

2
PSO2 transform and conquer approaches

Students will be able to gain the knowledge of general plan of recursive and
CO4-PO1 3 non-recursive algorithms and theory of backward substitution in divide and
conquer technique.
CO4-PO2 2 Strongly mapped as students will be able to analyze the time and space complexity
of recursive and non-recursive algorithms.
CO4-PO3 2 Students will be able to design new algorithms using dynamic programming
technique.
CO4-PO4 2 Students will be able to choose the appropriate algorithms in design of
applications to solve complex problems.
CO4-PO5 2 Students will be able use tools such as eclipse, netbeans to design and develop
applications.
CO4-P09 2 Students will able to communicate each other for solving different problem
statements using these algorithm design methods.
Students will able to communicate each other for solving different problem
CO4-P10 2
statements using these algorithm design methods.

Students will be able to analyze the efficiency of any new algorithm designed by
CO4-P12 2
dynamic programming

Knowledge of designing different algorithm for sorting, searching and graph

CO4-
2 related problems by using different methods like Brute force, Divide and Conquer,
PSO1
Greedy Technique , dynamic programming etc.

CO4- Knowledge of designing different algorithm for problems by greedy method,

2
PSO2 transform, dynamic programming and conquer approaches

Students will be able to gain the knowledge of general plan of recursive and
CO5-PO1 3 non-recursive algorithms and theory of backward substitution in divide and
conquer technique.
CO5-PO2 2 Strongly mapped as students will be able to analyze the time and space complexity
of recursive and non-recursive algorithms.
CO5-PO3 2 Students will be able to design new algorithms using backtracking, branch and
bound methods
CO5-PO4 2 Students will be able to choose the appropriate algorithms in design of
applications to solve complex problems.
CO5-PO5 2 Students will be able use tools such as eclipse, netbeans to design and develop
applications.
CO5-P09 2 Students will able to communicate each other for solving different problem
statements using these algorithm design methods.
Students will able to communicate each other for solving different problem
CO5-P10 2
statements using these algorithm design methods.

Students will be able to analyze the efficiency of any new algorithm designed by
CO5-P12 2
backtracking, branch and bound methods.

Knowledge of designing different algorithm for sorting, searching and graph

CO5-
3 related problems by using different methods like Brute force, Divide and Conquer,
PSO1
Greedy Technique, branch and bound methods etc.
DELIVERY PLAN WITH DETAILS
Mode of
Date of COs
Experiments Delivery
Delivery Covered
Topic (PlsTick )
#
1 2 3 4
1 Design and implement C/C++ Program to find Minimum
Cost Spanning Tree of a given connected undirected
graph using Kruskal's algorithm.
2 Design and implement C/C++ Program to find
Minimum Cost Spanning Tree of a given connected
undirected graph using Prim's algorithm.
3 a. Design and implement C/C++ Program to solve All-
Pairs Shortest Paths problem using Floyd's algorithm.
b. Design and implement C/C++ Program to find the
transitive closure using Warshal's algorithm
4 Design and implement C/C++ Program to find shortest
paths from a given vertex in a weighted
connected graph to other vertices using Dijkstra's
algorithm.
5 Design and implement C/C++ Program to obtain the
Topological ordering of vertices in a given digraph.
6 Design and implement C/C++ Program to solve 0/1
Knapsack problem using Dynamic
Programming method.
7 Design and implement C/C++ Program to solve discrete
Knapsack and continuous Knapsack problems using
greedy approximation method.
8 Design and implement C/C++ Program to find a subset of
a given set S = {sl , s2,.....,sn} of n positive integers
whose sum is equal to a given positive integer d.
9 Design and implement C/C++ Program to sort a given set
of n integer elements using Selection Sort method and
compute its time complexity. Run the program for varied
values of n> 5000 and record the time taken to sort. Plot a
graph of the time taken versus n. The elements can be
read from a file or can be generated using the random
number generator.
10 Design and implement C/C++ Program to sort a given set
of n integer elements using Quick Sort method and
compute its time complexity. Run the program for varied
values of n> 5000 and record the time taken to sort. Plot a
graph of the time taken versus n. The elements can be
read from a file or can be generated using the random
number generator.
11 Design and implement C/C++ Program to sort a given set
of n integer elements using Merge Sort method and
compute its time complexity. Run the program for varied
values of n> 5000, and record the time taken to sort. Plot
a graph of the time taken versus n. The elements can be
read from a file or can be generated using the random
 number generator
12 Design and implement C/C++ Program for N Queen's
problem using Backtracking.
Faculty:
Signatures
HOD:

Remarks

(Note: Mode of Delivery: 1: Black Board 2: PPT 3: Video 4: Demo/Hands-on)

INTERNAL
TEST COs and Portions Covered
Test# and Quiz# DATE CO

T1
T2

T3

SUMMARY

Faculty:
Allotted Taken
Signatures Total
With Date HOD: #HOURS

Remarks

ENCLOSURES

1. Syllabus
2. CO Attainment
3. Gap Analysis
4. Special lectures/talks arranged if any
 Feedback by PAC

Faculty Course coordinator PAC HOD