DY PATIL INTERNATIONAL UNIVERSITY AKURDI PUNE Sector 29, Pradhikaran, Akurdi, Pune - Maharashtra, INDIA 411044 ablishment by Maharashtra Act No. LXIII of 2017) School of Computer Science, Engg. & Applications ig of Algorithm Course Code CSE 301 Course Name Design and Analysis of Algorithms Credits 5 Pre-Requisites Data Structures L-T-P-C 341-25 COURSE OBJECTIVE Upon successfull completion of this course, students will be able to: ‘© Design and Analysis of Algorithm course is essential to understand behavioral of algorithms in Computer Science and Engineering. This course also trains the students to solve problems using algorithms Analyze the asymptotic performance of algorithms. Write rigorous correctness proofs for algorithms. Demonstrate a familiarity with major algorithms and data structures. Apply important algorithmic design paradigms and methods of analysis. Synthesize efficient algorithms in common engineering design situations. LECTURES WITH BREAKUP No. of Lectures a MODULE-I: INTRODUCTION Algorithm definition, characteristics of an algorithm, Sorting in linear time, Analyzing efficiency of algorithms — Classes of functions, Performance Analysis - space complexity, time complexity, measures- worst case , best case average case, Asymptotic notations.TT ER ST! TEGY MODULE-I: DIVIDE AND CONQUER STRA | __psinary search, Merge sort, Quick Control abstraction f ind conquer, Binary sort, Strassen‘s matrix multiplication. 7 MODULE-I1l: GREEDY METHOD,BACKTRACKING encing Control abstraction for greedy method, Knapsack problem, un Se With deadlines, Optimal merge patterns, Huffman coding, Contra) aa for backtracking, 8 Queen's problem, Sum of subsets problem, graph co problem. 6 MODULE-IV: DYNAMIC PROGRAMMING Control abstraction for dynamic programming, Matrix chain multiplication, Longest common subsequence, String editing, 0/1 knapsack problem, Traveling salesperson problem. 8 MODULE-V: GRAPH ALGORITHMS DFS, BFS, Topological Sort, Minimum spanning trees (Kruskal and Prim’s algorithms), and Shortest Paths: Single Source shortest paths — Bellman-Ford algorithm, Dijkstra’s algorithm, String Matching: The Robin-Karp algorithm, 6 MODULE-VI: PROBLEM CLASSIFICATION: Nondeterministic algorithm, The class of P, NP, NP-hard and NP- Complete problems. COURSE OUTCOMES On completion of the course the student should be able to; Introduces the need of analyzing algorithms and basic techniques used in the analysis Makes students aware of standard design techniques « Makes students aware of complexity theory Students equipped with all these topics will always be keen on writing efficient code, use standard techniques to solve problems from different domains and go for approximate solutions when the problems are computationally hard This course would give them an edge over other software professionals who know only technology.Text Books: Thomas Cormen. Charles Leiserson, Ronald Rivest and Cliford Stein 5 ; “Introduction to Algorithms”, PHI Reference. Reference Material- 1, E, Horowitz and S. Sahni. “Fundamentals of Computer Algorithms” , Galgotia, 1991 2. V. Aho. J. E. Hoperoft, and J. D. Ullman, “The Design and Analysis of Computer Algorithms”, Addison Wesley, 1974Evaluation Details: Assignments | Mid-Term-1 | Midterm-2 End Term Total 30% 15% 15% 40 % 100 % List of Practical’s There will be lab assignments based on Design and analysis of algorithm concepts to make students familiar with their programming implementations. These assignments have to be implemented using Python & C. Implementation of linear algorithms. Implementation Binary search, Merge sort, Quick sort using divide and conquer method Implementation of Strassen‘s matrix multiplication using divide and conquer method Implementation of knapsack, Graph coloring algorithm using greedy method. Implementation of 8 Queen‘s problem using backtracking method. Implementation of Traveling salesperson problem using dynamic programming method Implementation of Minimum cost spanning trees algorithm. Implementation of The Robin-Karp algorithm. Lab attendance Lab Work End term Exam Total 10% 40% 50 % 100 % QO. ee $ 3 wer we Ms. Stfobhana D. Patil Dr. Bahubali K. Shiragpur Faculty Name Director School of Computer Science Enge. & Applications, DYPIU