VI SEMESTER

1. Course
Descriptive
Semester: VI Course Title: DESIGN AND ANALYSIS
OF ALGORITHM
Course Code: 21BCA2T463 Course Type: DSC
Course Credits: 04 Intended Level : Degree
Total hours 60
Cross cutting issue(s) addressed Professional Ethics

Need(s) catered by the course: Local / National / Regional / Global

Course offered to Bachelor of Computer Applications

2. Course Objectives
● To develop the analytical skills and to design the algorithm for various techniques
● To analyse the algorithm for its efficiency
3. Course Outcomes
After the successful completion of the course, the student will be able to:
CO1: understand the fundamental concepts of algorithm design and compute the
efficiency CO2: analyse time complexity for searching and sorting algorithms
CO3: apply algorithm design techniques to various problems
CO4: evaluate optimization problems and construct dynamic programming
techniques CO5: apply the fundamental concepts of lower bound theory and apply
backtracking
4. Course Articulation Matrix: Mapping of Course Outcomes (COs) with Programme
Specific Outcomes (PSOs)
Course Mapping
Outcome PO1 PO2 PO3 PO4 PO5
s CO1 ✓ ✓ ✓
CO2 ✓ ✓ ✓ ✓
CO3 ✓ ✓
CO4 ✓ ✓ ✓
CO5 ✓ ✓ ✓
5. Course Content:

Contents Hours
Unit 1: Introduction
Definition of algorithm, Fundamentals of algorithmic problem solving,
11
Notion of an algorithm, Characteristics, Asymptotic Notations -O, Ω, ʘ;
Analysis of algorithm -Best, Worst and Average case efficiency.
Unit 2: Divide and Conquer Method
Binary search, Finding maximum and minimum; Merge sort; Quick sort;
13
Selection sort; Heap Sort - Max and Min; Closest-Pair and Convex
Hullproblem; Strassen’s Matrix Multiplication
Unit 3: Greedy Method
12
Knapsack problem✅; Prim’s algorithm✅; Dijkstra’s algorithm✅; Kruskal’s

algorithm✅; Minimum Cost Spanning tree✅; Huffman coding. ✅

Unit 4: Dynamic Programming

Computing Binomial Coefficient; ✅ 0/1 Knapsack problem✅; Travelling

12

Salesman problem; Tree traversal and Optimal Binary Search Tree.

 Unit 5: Lower Bound Theory and Graphs
Lower Bound Theory - Introduction to P, NP, NP hard and NP-completeness.
Backtracking - n-Queens problem; Sum of subset problem; Hamiltonian
12
problem.
Graphs - Introduction to graphs, Terminologies related to graph, Graph traversal.
6. Resourses
a) Reference Books:
Anany Levitin, (2021), Introduction to the Design and Analysis of Algorithms,
Pearson Education, Second Edition.
M. Padma Reddy (2012), Design and Analysis of Algorithms, Revised Edition: Sri
Nandi Publications.
Ellis Horowitz;Sartaj Sahni and Sanguthevar Rajasekaran (2018), Fundamentals of
Computer Algorithms, Universities Press Private Limited; 2nd Edition.
Antti Laaksonen.(2018), Guide to Competitive Programming: Learning and
Improving Algorithms Through Contests, Springer, 4th Edition.
V.V.Muniswamy. (2009). Design and Analysis of Algorithms. I. K. International Pvt Ltd.

b) Online Resources ( Websites, Blogs, online videos, etc.)

● Nptel
● Swayam
● MOOC
● www.tutorialspoint.com, etc
c) In-house Electronic Resources and Databases ( KJLMS / J-RISE / Storage Devices )
● KJLMS
● J-RISE
7. Pedagogy
● Lecture
● Hands on /Debugging
● Tracing the program
● Implementing concepts in Micro level projects
● Simulation of Sorting and searching algorithms

8. Skill set Identification Matrix

Assessment (Formative
COs Level of Bloom’s Taxonomy Expected Skill Outcome(s) and Summative)

CO1 Remembering, Conceptual and Both Formative and Summative

Understanding and Analyzing Analytical skills
Remembering, Conceptual and
CO2 Understanding, Applying Evaluating skills Both Formative and Summative
and Evaluating
(L1,L2,L3,L5) and
CO3 Understanding Implement the programming Both Formative and Summative
Creating (L2,L6) skills
CO4 Understanding, Implement the programming Both Formative and Summative
Appling, evaluating skills
Understanding, Applying, Analyze and Evaluating
CO5 Analyzing and the programming skills Both Formative and Summative
Evaluating (

9. Course Assessment Plan

a) Weightage of Marks in Formative and Summative Assessments
COs Formative Assessment - FA Summative Assessment - SA
CO1 15 17
 CO2 18 24
CO3 11 19
CO4 2 17
CO5 2 24
b) Question Paper Pattern

Midterm Examination I
Maximum Marks: 30 marks scaled down to 15 marks
Section A: 5 Questions out of 7 – 02 marks each = 10 Marks
Section B: 4 Questions out of 6 – 05 marks each = 20 Marks
Online MCQ : 10 questions – 01 mark each = 10
Marks End Semester Examination:
Maximum Marks: 60
Duration: 2½ Hours
Section A : 5 Questions out of 8, each carrying 2 marks (5 x 2 = 10 Marks)
Section B : 4 Questions out of 7, each carrying 5 marks (4 x 5 = 20 Marks)
Section C : 3 Questions out of 5, each carrying 10 marks (3 x 10 = 30 Marks)

c) Blue print for ESE

Hours COs No. of Questions & Marks Distribution

Allotte Address Sectio Total Total Total
Unit d in the ed nA Mar Section B Mar Section C Mar
Syllabu ks ks ks
s
I 11 CO1 1 2 1 5 1 10
II 13 CO2 2 4 2 10 1 10
III 12 CO3 2 4 1 5 1 10
IV 12 CO4 1 2 1 5 1 10
V 12 CO5 2 4 2 10 1 10
Remembering Applying, Applying,
Bloom’s Taxonomy , Analyzing Analyzing,
Level(s) Used Understandin Evaluating and Evaluating and
g Levels Creating Creating

d) Mapping COs using Rubrics

Que Mapping
s MTE I MTE II ESE
tion CO1 C CO C C CO CO C C C C CO C C CO
num O 3 O4 O5 1 2 O O4 O5 O1 2 O3 O 5
2 3 4
Q1 ✓ ✓ ✓
Q2 ✓ ✓ ✓
Q3 ✓ ✓ ✓
Q4 ✓ ✓ ✓
Q5 ✓ ✓ ✓
Q6 ✓ ✓ ✓
Q7 ✓ ✓ ✓
Q8 ✓ ✓ ✓ ✓
Q9 ✓ ✓ ✓
 Q10 ✓ ✓
Q11 ✓ ✓
Q12 ✓ ✓
Q13 ✓ ✓
Q14 ✓
Q15 ✓
Q16 ✓
Q17 ✓
Q18 ✓
Q19 ✓
Q20 ✓
e) Mapping CIA Components using Rubrics
CIA Component Mapping
CO1 CO2 CO3 CO4 CO5
Assignment ✓ ✓ ✓
Class Participation ✓ ✓ ✓ ✓ ✓
MTE I ✓ ✓ ✓
MTE II (Online) ✓ ✓ ✓ ✓ ✓

Prepared by Course Checked &Verified by Signature of the Dean

Coordinator HoD

Dr.Thenmozhi K Mr. Sevuga Pandian A Dr. Calistus Jude A L