Analysis and Design of Algorithms
[As per Choice Based Credit System (CBCS) Scheme]
(Effective from the Academic Year 2021-22)
As Per NEP 2020
SEMESTER – IV
Course Code 21BCA42 CIE Marks 50
Number of Lecture
03 SEE Marks 50
Hours/Week
Total Number of Lecture
42 Exam Hours 03
Hours
CREDITS – 03
Course Objectives:
• Explain various computational problem solving techniques.
• Apply appropriate method to solve a given problem.
• Describe various methods of algorithm analysis.
Revised Bloom’s Taxonomy Levels: L1 – Remembering, L2 –Understanding, L3 – Applying, L4 –
Analyzing, L5 – Evaluating, and L6 – Creating
Teaching RBT
Module 1 Hours Levels
Introduction: What is an Algorithm?, Notion of an Algorithm, Fundamentals of
Algorithm problem solving
L1,L2,
Important Problem Types, Fundamental Data Structures
10 L3,L4,
Analysis Framework, Asymptotic Notations
Mathematical analysis of Non-Recursive Algorithms with Examples. L5
Module 2
Divide and Conquer: General method, Merge sort, Quick sort, Binary search,
Strassen’s Matrix Multiplication, Advantages and Disadvantages of divide and L1,L2,
08 L3,L4,
conquer. L5
Decrease and Conquer Approach: Topological Sort.
Module 3
Brute Force and Exhaustive Search: Travelling Salesman problem, Assignment
Problem. L1,L2,
Transform and Conquer Approach: Heaps and Heap Sort. L3,L4,
08
Minimum cost spanning trees: Prim’s Algorithm, Kruskal’s Algorithm Single L5
source shortest paths: Dijkstra's Algorithm.
Optimal Tree problem: Huffman Trees and Codes.
Module 4
Dynamic Programming: General method with Examples, Knapsack problem,
L1,L2,
Optimal Binary Search Trees 08
L3,L4,
All Pairs Shortest Paths: Warshall’s Algorithm, Floyd’s Algorithm, Bellman-Ford L5
Algorithm.
Module 5
Backtracking: General method, N-Queens problem, Hamiltonian Circuit problem,
Sum of Subsets problem. L1,L2,
Branch and Bound: Assignment Problem, Knapsack Problem, Travelling 08 L3,L4,
Salesman Problem. L5
Limitations of Algorithmic Power: Decision trees P, NP, NP-Complete problems.
Course Outcomes
On successful completion of the course, the students will be able to
CO1 : Understand the basic notation for analyzing the performance of the algorithms
CO2 : Use divide-and-conquer techniques for solving suitable problems
CO3 : Use greedy approach to solve an appropriate problem for optimal solution
CO4 : Apply dynamic programming approach to solve suitable problems
CO5 : Apply Backtracking and NP-Complete problem approach to solve suitable problems
Question Paper Pattern
The Question Paper will have Ten Questions.
There will be two questions from each module.
Each question will have questions covering all the topics under a module.
The students will have to answer 5 full questions, selecting one full question from each module.
Text Books:
1. Introduction to the Design Analysis and Analysis of Algorithms,Anany Levitin,Second Edition,Pearson.
2. Design Analysis and Analysis of Algorithms,Chandra Mohan,Second Edition, PHI Learning publisher.
3. Design Analysis and Analysis of Algorithms, Kabat Manas Ranjan,PHI Learning publisher.
4. Design Methods and Analysis of Algorithms,basu S K, PHI Learning publisher
5. Introduction to the Design Analysis and Analysis of Algorithms,Anany Levitin,Third Edition,Pearson.
Reference Books:
1. Introduction to Algorithms, Thomas H. Cormen, Charles E. Leiserson, Ronal L. Rivest,
Clifford Stein, 3rd Edition, PHI
2. Design and Analysis of Algorithms , S. Sridhar, Oxford (Higher Education)
