(Established under the Presidency University Act, 2013 of the Karnataka Act 41 of 2013)

[2024-25 EVEN SEMESTER]

COURSE PLAN [Revision 03–July 2023]

SCHOOL: PSCS DEPT: CSE DATE OF ISSUE: 09.01.2025

NAME OF THE PROGRAM : B.Tech. Computer Science and Engineering (CSE)

P.R.C. APPROVAL REF. : PU/AC-24.7/SOCSE04/CSE/2023-2027

SEMESTER/YEAR : IV SEMESTER / II YEAR

COURSE TITLE & CODE : DESIGN AND ANALYSIS OF ALGORITHMS & CSE2007

COURSE CREDIT STRUCTURE : 3-0-0-3

CONTACT HOURS : 45 Hours

COURSE IC : Dr. Murali Parameswaran, Dr. Madhusudhan M V, Ms. Sandhya

L, Mr. Yamanappa
COURSE INSTRUCTOR(S) : Dr. Murali Parameswaran, Dr. Madhusudhan M V, Ms. Sandhya
L, Mr. Yamanappa, Dr. Manjula H M, Dr. Sukruth Gowda,
Dr Prasad P S, Mr Mohammed Zia Ur Rahman, Dr Smitha Patil,
Dr. Ruhin Kouser R, Mr Mohamed Shakir, Dr. Pamela Vinitha
Eric, Dr. Aarif Ahamed, Ms. Akkamahadevi C, Dr Pajany. M,
Dr. Taranath N L

COURSEURL: https://presidencyuniversity.linways.com/

PROGRAM OUTCOMES :

PO 1: Engineering knowledge: Apply the knowledge of mathematics, science, engineering fundamentals, and
an engineering specialization to the solution of complex engineering problems.

PO 2: Problem analysis: Identify, formulate, review research literature, and analyze complex engineering
problems reaching substantiated conclusions using first principles of mathematics, natural sciences, and
engineering sciences.

PO3: Design/development of solutions: Design solutions for complex engineering problems and design system
components or processes that meet the specified needs with appropriate consideration for the public health and
safety, and the cultural, societal, and environmental considerations.
 PO4: Conduct investigations of complex problems: Use research-based knowledge and research methods
including design of experiments, analysis and interpretation of data, and synthesis of the information to provide
valid conclusions.

PO 5: Modern tool usage: Create, select, and apply appropriate techniques, resources, and modern engineering
and IT tools including prediction and modelling to complex engineering activities with an understanding of the
limitations.

PO6: The engineer and society: Apply reasoning in formed by the contextual knowledge to assess societal,
health, safety, legal and cultural issues and the consequent responsibilities relevant to the professional
engineering practice.

PO 7: Environment and sustainability: Understand the impact of the professional engineering solutions in
societal and environmental contexts, and demonstrate the knowledge of, and need for sustainable development.

PO 8: Ethics: Apply ethical principles and commit to professional ethics and responsibilities and norms of the
engineering practice.

PO9: Individual and team work: Function effectively as an individual, and as a member or leader in diverse
teams, and in multi-disciplinary settings.

PO 10: Communication: Communicate effectively on complex engineering activities with the engineering
community and with society at large, such as, being able to comprehend and write effective reports and design
documentation, make effective presentations, and give and receive clear instructions.
PO11: Project management and finance: Demonstrate knowledge and understanding of the engineering and
management principles and apply these to one’s own work, as a member and leader in a team, to manage
projects and in multi-disciplinary environments.

PO 12: Life-long learning: Recognize the need for, and have the preparation and ability to engage in
independent and life-long learning in the broadest context of technological change.

PROGRAM SPECIFIC OUTCOMES (PSO):

At the end of the B. Tech. Program in Computer Science and Engineering the students shall:

PSO 01: [Problem Analysis]: Identify, formulate, research literature, and analyze complex engineering problems
related to Software Engineering principles and practices, Programming and Computing technologies reaching
substantiated conclusions using first principles of mathematics, natural sciences, and engineering sciences.
PSO 02: [Design/development of Solutions]: Design solutions for complex engineering problems related to
Software Engineering principles and practices, Programming and Computing technologies and design system
components or processes that meet the specified needs with appropriate consideration for the public health and
safety, and the cultural, societal, and environmental considerations.

PSO 03: [Modern Tool usage]: Create, select, and apply appropriate techniques, resources, and modern
engineering and IT tools including prediction and modeling to complex engineering activities related to Data
Science principles and practices, Programming and Computing technologies with an understanding of the
limitations.

COURSE PREREQUISITES: CSE2001- Data Structure and Algorithms

 COURSE DESCRIPTION:

This intermediate course enables students to design and analyze efficient algorithms to solve problems. This
course covers typical design methods such as divide-and-conquer, dynamic programming and greedy method
to solve problems. The students shall develop strong analytical skills as part of this course.

COURSE OBJECTIVES:
The objective of the course is to familiarize the learners with the concepts of Analysis of Algorithms
and attain Skill Development through Participative Learning techniques.

COURSE OUTCOMES: On successful completion of the course the students shall be able to

TABLE 1: COURSE OUTCOMES

CO CO Expected BLOOMS
Number LEVEL
CO1 Identify the efficiency of a given algorithm. Understand
CO2 Illustrate the Brute Force Technique used for solving a problem. Apply
CO3 Apply divide and conquer technique for searching and sorting Problems. Apply
CO4 Apply the Dynamic Programming and greedy technique for solving a Apply
Problem.
CO4 Demonstrate Back tracking technique and limitations of Algorithms. Apply

MAPPING OF C.O. WITH P.O. [Mark H/M/L Against each of the C.O. depending on the degree of
contribution of the C.O.to the P.O.]

[H-HIGH , M- MODERATE, L-LOW]

TABLE 2a: CO PO Mapping ARTICULATION MATRIX

CO.No. PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12

-
CO1 M M - - - - - - - - L
- - -
CO2 H H H L - - - - M
- - -
CO3 H H H L - - - - M
- -
CO4 H H H L - - - - - M
-
CO5 H H H M - - - - - - M
MAPPING OF C.O. WITH PSO: [Mark H/M/L Against each of the C.O. depending on the degree of
contribution of the C.O.to the PSO.]

TABLE 2b: CO PSO Mapping ARTICULATION MATRIX

CO. No. PSO-1 PSO-2 PSO-3
CO1 L L L
CO2 L L -
CO3 M L L
CO4 M L L
CO5 M L L

COURSE CONTENT (SYLLABUS):

Module1: Introduction to Algorithms [8L Hours] [Understand]

Important Problem types, Asymptotic Notations and its properties, Basic Efficiency classes, Mathematical analysis
for Recursive and Non-recursive algorithms.

Module 2: Algorithm design techniques-Brute force [9L Hours] [Apply]

Selection Sort, sequential search, Uniqueness of Array, Exhaustive search: Travelling Salesman, Knapsack Problem.

Module 3: Divide-and-conquer [9L Hours] [Apply]

The Master’s Theorem, Merge sort, Quick sort, Binary search.

Module 4: Dynamic programming and greedy technique [11L Hours] [Apply]

Introduction, Coin changing problem, Multi stage graph – Optimal Binary Search Trees, Warshall’s, Floyds,0/1
Knapsack, Prim’s, Kruskal's, Dijkstra's Algorithm.

Module 5: Complexity Classes [8L Hours] [Apply]

Complexity Classes- P,NP- NP Hard and NP Complete - Boolean Satisfiability Problem (SAT).

Hamiltonian Path Problem, M Coloring Problem. Backtracking, - Backtracking – n-Queens problem.

DELIVERY PROCEDURE (PEDAGOGY):

TABLE 3: SPECIAL DELIVERY METHOD/ PEDAGOGY PLANNED WITH TOPICS

** At end of
Pedagogy title/ short
S. Lecture semester please
Subtopic as per lesson Plan explanation of adopted
No Number update whether
pedagogy
activity was done
Recursive algorithms
Problem Based
1 L7 examples
Learning/Self-learning

Review of Linear
Search and Binary Search Participative
2 L11
Learning
 Problems on Prim’s and Collaborative
3 L33
Kruskal’s Algorithm Learning
TEXT BOOKS:

T1: Anany Levitin, “Introduction to the Design and Analysis of Algorithms”, 3rd edition, Pearson Education, 2018.

T2: Thomas H.Cormen, Charles E.Leiserson, Ronald L. Rivest and Clifford Stein, “Introduction to Algorithms”, 4th
edition, MIT Press, 2022.

REFERENCE Book(s):
R1. J. Kleinberg and E. Tardos,“Algorithm Design”, Addison-Wesley, 2005.
R2. Tim Roughgarden, “Algorithms Illuminated” (books 1 through 3), “Operating Systems Design and
Implementation”, Soundlikeyourself Publishing, 2017-2019.
R3. AV Aho, J Hopcroft, JD Ullman, “The Design and Analysis of Algorithms”, Addison-Wesley, 1974.

ONLINE RESOURCES:
1. NPTEL: https://onlinecourses.nptel.ac.in/noc19_cs47/preview

2. Coursera: Analysis of Algorithms by Princeton University

3. Algorithms – YouTube play list
4. Design and Analysis of algorithms - YouTube
5. Algorithms Specialization in Coursera by Stanford University(Group of 4 courses).
6. Algorithms Coding Contest Links maintained by Prof Gerth Stølting Brodal of Aarhus University
SPECIFIC GUIDELINES TO STUDENTS:

1. Students are required to maintain minimum 75% of attendance

2. Technology enabled learning through NPTEL and online course may help in clear understanding the topics.
3. Follow the instructions of course instructor in both class and lab.
4. Avoid being absent in labs as it will affect the understanding of the experiments.
5. On time submission of assignments.

COURSE SCHEDULE:
TABLE 4: COURSE BROAD SCHEDULE

Sl. No. ACTIVITY PLANNED PLANNED TOTAL NUMBER OF

STARTING DATE CONCLUDING DATE PERIODS
01 Overview of the course 20/01/2025 20/01/2025 01
02 Module : 01 20/01/2025 06/02/2025 08
03 Surprise Test 1 -- -- --
04 Module: 02 07/02/2025 27/02/2025 09
05 Assignment 01 -- -- --
06 Module: 03 28/02/2025 27/03/2025 09
 07 Mid Term Examination 17/03/2025 21/03/2025 03
08 Surprise Test 2 -- -- --
09 Module:04 28/03/2025 18/04/2025 11
10 Surprise Test 3 -- -- --
11 Module: 05 21/04/2025 09/05/2025 08
12 Assignment 02 -- -- --
13 End Term Examination 26/05/2025 06/06/2025 --

TABLE 5 : DETAILED SCHEDULE OF INSTRUCTION

LOL HOL Teaching /

Topics& Learning Objectives Pedagogies
Sessio (Lower (Higher
Lesson Course Reference (Ch
S.No n No. Order Order
Title LO: Student shall be able to Outcome No., Pg:x-y)
Learnin Learnin
g) g)
Program Integration, Details of LOL 1, -- CO1 PPT/Interactive T1(Ch1, Pg: 29)
the course and LOL 2 Lecture
Learning Objectives- Notion of
Algorithm and Important
1 L1 Problem Types
LO1:Define an algorithm
LO2:Describe different types of
problems
Asymptotic Notations and its LOL 2, -- CO1 PPT/Interactive T1(Ch2,Pg:44-
types LOL 3 Lecture 48)
LO1: Explain different
2 L2 asymptotic notations
LO2: Calculate Time complexity
using asymptotic notations
MODU
LE-1: LOL1, -- CO1 PPT/Interactive T1(Ch1,Pg: 67-
Basic Efficiency Classes
Introdu LOL 2 Lecture 76)
LO1:Identify the different basic
ction to
3 L3 efficiency classes
Algorit T1(Ch1,Pg: 82-
LO2: Explain the analysis of
hms framework 84)

LOL 1, -- CO1 PPT/Interactive T1(Ch1,Pg: 67-

Analysis of framework
LOL 2 Lecture 76)
LO1:Define efficiency of an
4 L4 algorithm
T1(Ch1,Pg: 82-
LO2: Explain the counting
method 84)

Mathematical analysis of non- LOL 2, -- CO1 PPT/Interactive T1(Ch2,Pg:87-

recursive algorithms LOL 3 Lecture 95)
LO1: Estimate the time
5 L5 complexity of counting n numbers.
LO2: Calculate the time
complexity of a non-recursive
algorithm.
 Mathematical analysis of non- LOL 2, -- CO1 PPT/Interactive T1(Ch1,Pg:96-
recursive algorithms LOL 3 Lecture 102)
LO1: Estimate the time
6 L6 complexity of factorial
LO2: Calculate the time
complexity of a recursive
algorithm.
Recursive algorithms: Examples LOL 2, -- CO1 Problem based T1(Ch1,Pg:96-
LO1: Explain steps to calculate LOL 3 learning/Self- 102)
time complexity of sum(n) learning
7 L7 algorithm
LO2: Calculate the time
complexity from a recurrence
equation
Continuous Assessment -1
7 L8

Introduction to Module 2 LOL 1, -- CO2 PPT/Interactive T1(Ch2,Pg:123-

LO1: List techniques for LOL 2 Lecture 124)
8 L9 designing algorithms
LO2: Discuss an example of brute
force method.
Introduction to brute force LOL 2, -- CO2 PPT/Interactive T1(Ch2,Pg:123-
technique. Bubble sort LOL 3 Lecture 124)
LO1: Describe brute force
10 L10 technique
LO2: Demonstrate bubble sort

Selection Sort LOL 3, -- CO2 PPT/Interactive T1(Ch2,Pg:124-

LO1: Demonstrate Selection sort LOL 4 Lecture 126)
11 L11 LO2: Analyze selection sort
algorithm
Linear Search and Array LOL 3, -- CO2 Participative T1(Ch3,Pg:123-
Module Uniqueness problem LOL 4 Learning 131 )
12 L12 LO1: Demonstrate Linear Search
2:
LO2: Analyze uniqueness Problem
Algorit
Exhaustive Search LOL 2 -- CO2 PPT/Interactive T1(Ch3,Pg:141-
hm LO1: Explain exhaustive search LOL 3 Lecture 142 )
design working principle
13 L13 techniq LO2: Apply Exhaustive
ues- searching technique to solve the
Brute problem
force Knapsack Problem LOL 1, -- CO2 PPT/Interactive T1(Ch3,Pg:
LO1: Define knapsack problem LOL 2 Lecture 142-143 )
14 L14 LO2: Explain an exhaustive
search algorithm for solving
knapsack problem
Knapsack Problem LOL 3, -- CO2 PPT/Interactive T1(Ch3,Pg:
LO1: Apply exhaustive LOL 4 Lecture 142-143 )
search to solve knapsack
15 L15 problem
LO2: Analyze exhaustive
search to solve knapsack problem
Brute Force String Matching LOL 2, -- CO2 PPT/Interactive T1(Ch3,Pg:131-
Problem LOL 3 Lecture 132 )
LO1: Apply exhaustive search to
16 L16 solve String Matching problem
LO2: Analyze exhaustive search
to solve String Matching Problem
 Module 2 Conclusion, and LOL 2, -- CO2 PPT/Interactive T1(Ch3,Pg:123-
Course Integration. LOL 3 Lecture 132)
Continuous Assessment – 2
(Assignment -1 discussion)
17 L17 LO1: Define Brute Force
Technique.
LO2: Determine the steps needed
to construct a brute force
algorithm
Introduction to Module 3; LOL 1, -- CO3 PPT/Interactive T1(Ch5,Pg:195-
General method, Master Theorem LOL 2 Lecture 197)
LO1: Describe the general
18 L18 method of Divide & Conquer
technique
Module LO2:Explain Masters Theorem
3: LOL 2, -- CO3 PPT/Interactive T1(Ch5,Pg:198-
Merge Sort
Divide- LOL 3
19 L19 LO1:Explain the algorithm Lecture 200)
and- LO2:Demonstrate merge sort
Conquer LOL 3, -- CO3 PPT/Interactive T1(Ch5,Pg:198-
Merge Sort: Analysis
LO1: Apply merge sort technique to LOL 4 Lecture 200)
20 L20 sort the given elements
LO2:Analyze the merge sort
algorithm
L21 MID TERM
21

L22 MID TERM

22

L23 MID TERM

23

Module 3: LOL 2, -- CO3 PPT/Interactive T1(Ch5,Pg:202-

Quick Sort
Divide- LOL 3 Lecture 207)
21 L21 LO1:Explain the algorithm
and-
LO2:Demonstrate quick sort
Conquer
Quick Sort: partitioning LOL 3, -- CO3 PPT/Interactive T1(Ch5,Pg:202-
LO1: Apply quick sort technique LOL 4 Lecture 207)
to sort the given elements
22 L22 LO2:Analyze the quicksort
algorithm

Binary Search LOL 2, -- CO3 PPT/Interactive T1(Ch4,Pg:150-

LO1:Describe the design of binary LOL 4 Lecture 152)
23 L23 search algorithm
LO2: Analyze binary search
algorithm
Decrease & Conquer Technique LOL 1, -- CO3 PPT/Interactive T1(Ch4,Pg:157-
General Method LOL 2 Lecture 160)
LO1:Define the general method of
24 L24 Decrease & Conquer technique
LO2: Describe the general
method of Decrease & Conquer
technique
Insertion Sort LOL 3, -- CO3 PPT/Interactive T1(Ch4,Pg:160-
LO1: Apply the insertion sort LOL 3 Lecture 162)
25 L25 LO2: Demonstrate the working of
the insertion sort algorithm
Continuous Assessment – 3
26 L26
 LOL 1, -- CO4 PPT/Interactive T1(Ch8,Pg:309-
Dynamic Programming.
Introduction, Warshall’s LOL 3 Lecture 310)
Algorithm
T1(Ch8,Pg:330-
27 L27 LO1:Describe the dynamic
programming technique 333)
LO2:Demonstrat Warshall’s
Algorithm.

Warshall’s Algorithm LOL 3, -- CO4 PPT/Interactive T1(Ch8,Pg:330-

LOL 4 Lecture 333)
LO1:Apply Warshall’s algorithm
28 L28 for the given problem
LO2:Analyze the Warshall’s
algorithm
Flyod’s algorithm LOL 2, -- CO4 PPT/Interactive T1(Ch8,Pg:334-
LOL 4 Lecture 337)
29 L29 LO1: Explain Floyd’s Algorithm
LO2: Analyze Floyd Algorithm
0/1 Knapsack: Analysis LOL 3, -- CO4 PPT/Interactive T1(Ch8,Pg:318-
LO1: knapsack to solve the given LOL 4 Lecture 322)
30 L30 problem
LO2:Analyze 0/1 knapsack
Greedy Technique, Prim’s LOL 2, -- CO4 PPT/Interactive T1(Ch9,Pg:341-
Module 4: algorithm LOL 3 Lecture 343)
Dynamic LO1: Explain the greedy technique
31 L31 program Methodology
ming and LO2: Demonstrate Prims
greedy algorithm
technique
Prims algorithm LOL 3, -- CO4 PPT/Interactive T1(Ch9,Pg:344-
LO1: Apply Prim’s algorithm to LOL 4 Lecture 348)
32 L32 construct MST
LO2:Analyze Prim’s algorithm.
Kruskal’s algorithm LOL 3, -- CO4 Collaborative T1(Ch9,Pg:351-
LO1: Apply Kruskal’s algorithm LOL 4 Learning 357)
33 L33 to construct MST
LO2:Analyze Kruskal’s algorithm
Dijkstra’s algorithm LOL 3, -- CO4 PPT/Interactive T1(Ch10,Pg:35
LO1: Apply Dijkstra’s algorithm LOL 4 Lecture 9-363)
34 L34 to construct MST
LO2:Analyze Dijkstra’s algorithm
LOL 1, -- CO4 PPT/Interactive T2(CH5,
Bellman-Ford algorithm, Huffman
LOL 2 Lecture Pg:643-655)
Coding
L35
35 LO1:Demonstarte Bellman-Ford
T1(Ch9,Pg:364-
algorithm
LO2: Apply Huffman coding 370)

LOL 1, -- CO4 PPT/Interactive T2(CH5,

Bellman-Ford algorithm, Huffman LOL 2
Coding Lecture Pg:643-655)
36 L36 LO1:Demonstarte Bellman-Ford
T1(Ch9,Pg:364-
algorithm
LO2: Apply Huffman coding 370)

37 L37 Continuous Assessment – 4

Backtracking, N-Queens problem LOL 2, -- CO5 PPT/Interactive T1(Ch11,Pg:44

LO1:Explain backtracking LOL 3 Lecture 9-452)
38 L38 technique
LO2:Demonstrate N-Queens
problem
 Subset sum problem LOL 3, -- CO5 PPT/Interactive T1(Ch11,Pg:45
LO1: Demonstrate subset sum LOL 4 Lecture 3-454)
39 L39 problem
LO2: Apply backtracking to solve
subset sum problem
Branch and Bound technique LOL 2, -- CO5 PPT/Interactive T1(Ch11,Pg:45
40 L40 LO1: Explain the concept of LOL 3 Lecture 8-459)
branch & bound technique
Travelling Salesperson Problem LOL 3, -- CO5 PPT/Interactive T1(Ch11,Pg:43
LO1: Demonstrate TSP LOL 4 Lecture 8-440)
41 L41 LO2: Apply branch & bound
technique to solve TSP
Knapsack Problem LOL 3, -- CO5 PPT/Interactive T1(Ch11,Pg:43
LO1: Demonstrate branch and LOL 4 Lecture 6-438)
bound technique to solve knapsack
42 L42 problem
LO2: Analyze branch & bound
technique to solve knapsack
Limitations of algorithmic power LOL 1, -- CO5 PPT/Interactive T1(Ch11,Pg:41
Continuous Assessment – 3 LOL 2 Lecture 3-414)
(Assignment -2 discussion)
43 L43 LO1: List the limitations of
algorithmic power
LO2: Explain the limitations of
algorithmic power
Class P and NP problems LOL 1, -- CO5 PPT/Interactive T1(Ch11,Pg:43
NP hard problems & NP complete LOL 2 Lecture 2-435)
LO1: Define class P & NP
44 L44 problems and Define NP hard
problems
LO2: Explain the NP hard
problems
Revision and Conclusion of the Course
CO1, CO2, CO3, CO4, CO5
45 L45

Topics relevant to “SKILL DEVELOPMENT”: Understanding System Calls, Process scheduling

algorithms, Process synchronization, Deadlock handling and Memory management.

ASSESSMENT SCHEDULE:

TABLE 6 ASSESSMENT SCHEDULE

Sl. Assessment type Contents Course Duration marks Weighta Venue, DATE
no outcome In Hours ge &TIME
Number
Surprise Test-1 Module 1 CO1 30 mins 10 5% 01/02/25 to
1
07/02/25
Assignment 1 Module 1, CO2 1 week 10 5% 10/02/25 to
2
Module 2 28/02/25
Mid-Term(CAT) Module 1, CO1, CO2, 1 hour 50 25% 17/3/25 to
3 Module2 CO3 21/3/25
Surprise test-2 Module 3 CO3 30 mins 10 5% 28/3/25 to
4
2/04/25
4 Surprise test-3 Module 4 CO4 30 mins 10 5% 11/4/25 to
 18/04/25
Assignment 2 Module 5 CO5 1 week 10 5% 02/05/25 to
5
9/05/25
End Term (FAT) All CO1, CO2, 3 hours 100 50% --
6 Modules CO3, CO4,
CO5

COURSE CLEARANCE CRITERIA:

“AS PER ACADEMIC REGULATIONS OF THE UNIVERSITY”

MAKEUP EXAM POLICY:

“AS PER ACADEMIC REGULATIONS OF THE UNIVERSITY”

CONTACT TIMINGS FOR ANY DISCUSSIONS:

Students are encouraged to come for any discussions on this course during your Library Hrs
SAMPLE THOUGHT PROVOKING QUESTIONS:

TABLE 7: SAMPLE THOUGHT PROVOKING QUESTIONS

SL QUESTION MARKS COURSE BLOOM’S
NO OUTCOME LEVEL
NO.

1 Given an algorithm that recursively calls itself, 2 CO1 Remember

discuss one method to determine its time
complexity.
2 In a candy store there are N different types of 2 CO4 Remember
candies available, the prices of all the N
different types of candies are provided to you.
What is the minimum amount of money
you have to spend to buy all the N
different candies.
what is the maximum amount of money you
have to spend to buy all the N different
candies for the amount given to you.
3 Given a sorted array A, size N, of 5 CO2 Understand
integers;
every element appears twice except for one.
Demonstrate an algorithm to find that element
in linear time complexity and
 without using extra memory.

4 The problem is to find shortest distances 5 CO3 Apply

between every pair of vertices in a given edge
weighted directed Graph. The Graph is
represented as Adjacency Matrix, and the
Matrix denotes the weight of the edges (if
it
exists) else INF. Solve this problem.

A 1 B
0
9 8
1 1
2 1

D 7 C
5 5 CO4 Apply
Given a number of friends who have to give
or take some amount of money from one
another. Design an algorithm by which the
total cash flow among all the friends is
minimized.

6 Construct an algorithm that will ensure that 5 CO5 Apply

given N tree saplings, they are not planted in

same row, same column or same diagonal.

TARGET SET FOR COURSE OUTCOME ATTAINMENT:

 TABLE 8: TARGET SET FOR ATTAINMENT OF EACH CO and ATTAINMENT ANALYSIS AFTER
RESULTS

Sl.no C.O. Course Outcomes Threshold Target set Actual C.O. Remarks on
No. Set for the for Attainment attainment
CO attainment in In &Measures
percentage Percentage to enhance
the
attainment

* *
01 CO1 Identify the efficiency of a given 70 60
algorithm
02 CO2 Illustrate the Brute Force 70 60
Technique used for solving a
problem.
03 CO3 Apply divide and conquer 65 60
technique for searching and
sorting problems
04 CO4 Apply the Dynamic 65 60
programming and greedy
technique for solving a
problem
5 CO5 Demonstrate Back tracking 65 60
technique and limitations of
Algorithms

* LAST TWO COLUMNS ARE TO BE FILLED AFTER END TERM EXAM WITH ACTUAL
ATTAINMENT VALUES

Signature of the course Instructor In-Charge (s)

APPROVAL:
This course has been duly verified Approved by the D.A.C.

Signature of the Chairperson D.A.C.

Course Plan Verified by:

Master IC Name, Signature & Date:

Name and signature of the Instructor In-Charge (s) AFTER completing entries in Table number 3 and 8 at end of
semester:
Name and signature of the DAC Chairperson AFTER completing entries in Table number 3 and 8 at end of semester:

BLOOM'S TAXONOMYSAMPLE VERBS

Learning Outcomes Verbs at Each Bloom Taxonomy Level to be used for writing the course Outcomes.