Category S Sem. Max.

Marks
Title of the Course CC / AC/ DE /
Sem. Course Code Credits SE / GS / EVS/
Theo. TutorialLab.
Exam
VE / VAC Hrs CIA ESE Total.
Hrs. Hrs. Hrs.
Design and Analysis Of
Algorithm 2 3 Hrs. 25 75 100
Pre-Requisite: Basic knowledge of programming, recursion, data structures , algorithm analysis, fundamental
problem-solving strategies and backtracking.
Course Objectives:
The purpose of learning this course is:
1. Enable the students to learn the Elementary Data Structures algorithms.
2. Presents an introduction to the algorithms, their an alysis and design
Discuss various methods like
3. Basic Traversal and Search Techniques, dividend conquers method.
4. Dynamic programming, backtracking.
5. Under stood the various design and analysis of the algorithms.
Course Outcomes:
CO1: Get knowledge about algorithms and determines their time complexity. Demonstrate specific search and sort
algorithms using divide and conquer technique.
CO2: Gain good understanding of Greedy method and its algorithm.
CO3: Able to describe about graphs using dynamic programming technique.
CO4: Demonstrate the concept of back tracking & branch and bound technique.
CO5: Explore the traversal and searching technique and apply it for trees and graphs
Unit-I Introduction: 00 Hrs.
Algorithm Definition and Specification – Space complexity-Time complexity- Asymptotic Notations -
Elementary Data Structure: Stacks and Queues – Binary Tree - Binary Search Tree - Heap – Heap sort- Graph.

Unit-II Traversal and search techniques: 00 Hrs.

Basic Traversal And Search Techniques: Techniques for Binary Trees-Techniques for Graphs -Divide and
Conquer: - General Method – Binary Search – Merge Sort – Quick Sort.

Unit-III Greedy method: 00 Hrs.

The Greedy Method:-General Method–Knapsack Problem– Minimum Cost Spanning Tree– Single Source
Shortest Path.
Unit-IV Dynamic programming: 00 Hrs.
Dynamic Programming-General Method– Multistage Graphs–All Pair Shortest Path–Optimal Binary Search
Trees – 0/1 Knapsacks – Traveling Salesman Problem – Flow Shop Scheduling.
Unit-V Backtracking: 00 Hrs.
Backtracking: -General Method–8-QueensProblem–SumOfSubsets–Graph Coloring– Hamiltonian Cycles –
Branch And Bound: - The Method – Traveling Salesperson.

M.Sc. Computer Science Regulation - 2025 Page 1 of 3

 Text Book(s):
1. S. K. Basu, Design Methods and Analysis of Algorithms, 2nd Edition, PHI Learning, 2021, ISBN: 978-
9353069314
2. Udi Manber, Introduction to Algorithms: A Creative Approach, Dover Publications, Reprint 2021, ISBN:
978-0486838520
3. S. Sridhar, Design and Analysis of Algorithms, 1st Edition, Oxford University Press, 2022, ISBN: 978-
0199492800
4. S. Dasgupta, C.H. Papadimitriou, U.V. Vazirani, Algorithms, McGraw-Hill Education, Reprint 2021,
ISBN: 978-0073523408
5. Narasimha Karumanchi, Algorithm Design Techniques: Recursion, Backtracking, Greedy, Divide &
Conquer, and Dynamic Programming, CareerMonk Publications, 2020, ISBN: 978-8193245283

Reference Book(s):
1. Karumanchi Narasimha, "Algorithm Design Techniques: Recursion, Backtracking, Greedy, Divide &
Conquer, and Dynamic Programming", 1st edition, CareerMonk Publications, 2020, ISBN: 978-
8193245283
2. Khot Megha, "Design and Analysis of Algorithms", 2nd edition, TechKnowledge Publications, 2021, ISBN:
978-9390747101
3. Mukhopadhyay A., "Design and Analysis of Algorithms", 1st edition, Universities Press, 2020, ISBN: 978-
9389211956
4. Maheshwari Anany Levitin, "Introduction to the Design and Analysis of Algorithms", 4th edition, Pearson,
2020, ISBN: 978-9332575317
5. Sahni Sartaj, "Data Structures, Algorithms and Applications in C++", 2nd edition, Universities Press,
2021, ISBN: 978-8173719779

Web Resources:
1. https://nptel.ac.in/courses/106/106/106106131/
2. https://www.tutorialspoint.com/design_and_analysis_of_algorithms/index.htm
3. https://www.javatpoint.com/daa-tutorial
4. https://www.geeksforgeeks.org/fundamentals-of-algorithms
5. https://www.coursera.org/specializations/algorithms
Relationship Matrix for Course Outcomes, Programme Outcomes and Programme Specific
Outcomes:
Semester Code Title of the Course Hours Credits
Design and Analysis Of Algorithm
Course Outcomes Programme Outcomes(POs) Programme Specific Outcomes(PSOs)
(Cos)
PO1 PO2 PO3 PO4 PO5 PSO1 PSO2 PSO3 PSO4 PSO5
CO1 
       

CO2        
CO3       
CO4        
CO5        
Number of matches()=40,Relationship: High

M.Sc. Computer Science Regulation - 2025 Page 2 of 3

Mapping 1–29% 30–59% 60–69% 70–89% 90–100%
Matches 1–14 15–29 30–34 35–44 45–50
Relationship Very Poor Poor Moderate High Very High

M.Sc. Computer Science Regulation - 2025 Page 3 of 3