Syllabus
MANAV RACHNA INTERNATIONAL INSTITUTE OF RESEARCH AND STUDIES
(Deemed to be University under section 3 of the UGC Act 1956)
NAAC 'A' Grade University
BCS-DS-501: Design & Analysis of Algorithms
Periods/week Credits Max. Marks : 200
L :3 T: 1 4.0 Continuous Evaluation : 100
Duration of Exam: 3-Hrs End Sem Examination : 100
Pre-Requisite: Data Structures & Algorithms (BCS-DS-301)
Course Type: Program Core
Course Outcomes: The student will be able to:
BCS-DS-501.1. Recall and associate algorithms and their complexity.
BCS-DS-501.2. Understand various problem-solving algorithms.
BCS-DS-501.3. Apply and analyze different algorithmic methods on real-life problems.
BCS-DS-501.4. Examine graph and network concepts.
BCS-DS-501.5. Evaluate the complexity and NP completeness of a problem.
BCS-DS-501.6. Create and optimize advanced features of algorithms to improve computational
efficiency.
Part- A
Unit 1: Algorithm and its performance analysis
1.1 Introduction: Characteristics of algorithms
1.2 Analysis of algorithm: Asymptotic analysis of complexity bounds – best, average and
worst-case behavior; Performance measurements of Algorithm, Time and space trade-offs.
1.3 Analysis of recursive algorithms through recurrence relations: Substitution method,
Recursion tree method and Masters’ theorem
Unit 2: Graph Theory
2.1 Graph and Tree Algorithms: Traversal algorithms: Depth First Search (DFS) and
Breadth First Search (BFS)
2.2 Shortest path algorithms, Transitive closure(Warshall’s Algo), Minimum Spanning Tree,
Floyd-Warshall algorithm.
2.3 Topological sorting, Network Flow Algorithm.
Unit 3: Fundamental Algorithmic Paradigms (Part-I)
3.1 Brute-Force method
3.2 Divide and Conquer : Strassen’s matrix multiplication, finding max -min, Convex hull
3.3 Greedy problem :KnapSack problem, Huffman algorithm, , Task scheduling algorithm).
3.4 Dynamic Programming: Optimal BST, 0/1 Knapsack, Travelling Salesperson
Problem(TSP), Matrix chain multiplication, Longest Common Subsequence(LCS).
PART - B
Unit 4:Fundamental Algorithmic Paradigms (Part-II)
4.1 Branch and Bound method (0/1 Knapsack problem, Travelling salesman problem).
4.2 Backtracking method (N-queens problem, Sum of subsets, Graph coloring, Hamiltonian
cycle, Knapsack problem).
4.3 Heuristics –characteristics and their application domains.
Unit5: String matching and NP completeness
5.1 String Matching algorithms: Naïve string-matching algorithm, Rabin-karp algorithm,
String matching with finite automata, Knuth-Morris-pratt algorithm.
5.2 Tractable and Intractable Problems: Computability of Algorithms, Computability classes
– P, NP, NP-complete and NP-hard.
5.3 Cook’s theorem, Standard NP-complete problems and Reduction techniques.
Unit6:Advanced Topics
6.1 Approximation algorithms, Randomized algorithms.
6.2 Class of problems beyond NP – P SPACE.
Text Books/ Reference Books:
1. Cormen, T.H., Leiserson, C.E., Rivest, R.L. and Stein, C., 2009. Introduction to algorithms.
MIT press.
2. Sahni, S. and Horowitz, E., 1978. Fundamentals of computer algorithms. Computer Science
Press.
3. Singhal, S., 2018. ANALYSIS AND DESIGN OF ALGORITHMS. BPB Publications.
Suggested reference books
1. Dietzfelbinger, M., 2008. Sanjoy Dasgupta, Christos Papadimitriou, Umesh Vazirani,
Algorithms, McGraw Hill, Boston (2007), p. x+ 320, Paperback $33.75, ISBN: 978-
007352340-8 J
2. on Kleinberg, ÉvaTardos, Algorithm Design, Pearson/Addison Wesley, Boston
(2006), p. xxiii+ 838, Hardcover $103, ISBN: 978-032129535-4.
3. Goodrich, M.T. and Tamassia, R., 2006. Algorithm design: foundation, analysis and
internet examples. John Wiley & Sons.
4. Manber, U., 1989. Introduction to algorithms: a creative approach. Addison-Wesley
Longman Publishing Co., Inc.
Web links:
1. https://www.tutorialspoint.com
2. https://www.geeksforgeeks.org
3. https://www.programiz.com
Instructions for paper setting: Seven questions are to be set in total. First question will be
conceptual covering entire syllabus and will be compulsory to attempt. Three questions will be
set from each PART-A and PART-B (one from each unit). Student needs to attempt two
questions out of three from each part. Each question will be of 20 marks.
Distribution of Continuous Evaluation:
Sessional- I 30%
Sessional- II 30%
Assignment/Tutorial 20%
Class Work/ Performance 10%
Attendance 10%
Evaluation Tools:
Assignment/Tutorials
Sessional tests
Surprise questions during lectures/Class Performance
End Semester Examination
Course Articulation Matrix:
CO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO1 PO11 PO1 PSO PSO PSO
Statement 0 2 1 2
3
(BCS-DS-
501)
BCS-DS- 3 3 - - 3 3 - 3 1 2 - 3 2 - -
501.1
BCS-DS- 2 2 3 3 - 1 2 - - - - 3 - 3 -
501.2
BCS-DS- 2 2 3 3 - 1 2 - - - - 3 - 3 -
501.3
BCS-DS- 3 - 2 1 2 - 2 - 3 2 2 3 2 3 2
501.4
BCS-DS- - 2 3 3 2 - - 2 3 - 2 3 2 3 2
501.5
BCS-DS- - - 3 1 3 3 2 3 3 2 2 - 3 - 3
501.6
