Skip to content

Latest commit

 

History

History
77 lines (67 loc) · 7.14 KB

README.md

File metadata and controls

77 lines (67 loc) · 7.14 KB

Course : Design and Analysis of Algorithm Lab (NCMPCL41)

Lab Instructor Email-id Sample Practical Questions Theory Attendance Syllabus
Lifna C S lifna.cs@ves.ac.in [Sample Practical Questions] Attendance Theory & Lab Syllabus

Evaluation Scheme

No Rubrics Marks Document / Schedule
1 Term Work 25 Marks
a. Experiments 15 Marks Front Page, Index Page
b. Term Work Assessment 10 Marks
Assignment - 1 28th Feb. to 10th Mar. 2025
Assignment - 2 4th Apr. to 17th Apr. 2025
2 Practical and Oral Examination 25 Marks
Total Marks 50 Marks

Lab Outcomes (LO's)

At the end of the course, students will be able to

  1. Analyze the running time and space complexity of algorithms and describe P and NP Algorithms.
  2. Describe, apply, and analyze the complexity of the Divide and Conquer strategy.
  3. Describe, apply, and analyze the complexity of the Greedy strategy.
  4. Describe, apply, and analyze the complexity of the Dynamic Programming strategy.
  5. Explain and apply Backtracking, Branch and Bound.
  6. Explain and apply string-matching techniques.

Lab Experiments

No Name of Experiment LO's Date of Preparation Date of Submission
1. Analysing Sorting Techniques L01 1st week of Feb 2025 2nd week of Feb0 2025
a. Selection Sort -"-
b. Insertion Sort -"-
2. Implement and analyze Merge sort (Divide & Conquer) LO2 2nd week of Feb0 2025 3rd week of Feb 2025
3. Implement and analyze Quick sort (Divide & Conquer) LO2 3rd week of Feb 2025 4th week of Feb. 2025
4. Implement and analyze Fractional Knapsack Problem (Greedy Method) LO3 4th week of Feb. 2025 1st week of Mar. 2025
5. Implement and analyze Minimum cost spanning tree using Kruskal algorithm (Greedy Method) LO3 1st week of Mar. 2025 2nd week of Mar. 2025
6 Implement and analyze Longest common subsequence (Dynamic Programming) LO4 4th week of Mar. 2025 1st week of Apr. 2025
7 Implement and analyze N-queen problem (Backtracking) LO5 1st week of Apr. 2025 2nd week od Apr. 2025
8 Implement and analyze 15 Puzzle Problem (Branch and Bound) LO5 2nd week od Apr. 2025 3rd week od Apr. 2025
9. Implement String Matching Algorithms LO6 3rd week of Mar. 2025 4th week of Mar. 2025
a. Rabin Karp -"- -"- -"-
b. Knuth-Morris-Pratt algorithm -"- -"- -"-
10. Write a case study on Complexity Classes: P, NP, NP-Hard, NP-Complete LO1 4th week of Feb. 2025 1st week of Mar. 2025

Text Books :

  1. T. H. Cormen, C.E. Leiserson, R. L. Rivest, and C. Stein, “Introduction to algorithms”, 2nd Edition, PHI Publication 2005.
  2. Ellis Horowitz, Sartaj Sahni, S. Rajsekaran. “Fundamentals of computer algorithms',' University Press.

Refernces :

  1. Sanjoy Dasgupta, Christos Papadimitriou, Umesh Vazirani, “Algorithms”, Tata McGraw Hill Edition.
  2. S. K. Basu, “Design Methods and Analysis of Algorithm”, PHI.
  3. J. Kleinberg and E. Tardos, Algorithm Design, Pearson International Edition, 2005.

Online Resources

  1. Design and Analysis of Algorithms - NPTEL Course 1
  2. Design and analysis of algorithms - NPTEL Course 2
  3. Algorithms Specialization - Coursera Stanford University Course
  4. https://www.mooc-list.com/tags/algorithms

AI Tools

  1. Algorithmia :
  2. TensorFlow :
  3. VisuAlgo :
  4. Algorithm Visualizer :
  5. Pathfinding Visualizer :
  6. Artificial intelligence (AI) algorithms: a complete overview :
  7. What Is an Algorithm?
  8. Algorithmic bias detection and mitigation: Best practices and policies to reduce consumer harms
  9. Code-Dependent Pros and Cons of the Algorithm Age :

Case Studies

  1. A Case Study in Algorithm Analysis
  2. An Introduction to the Analysis of Algorithms
  3. Parallel MCMC Algorithms: Theoretical Foundations, Algorithm Design, Case Studies

Acknowledgements

  • This material was prepared as a part of the Course - Design and Analysis of Algorithms Lab offered by the Department of Computer Engineering, (VES Institute of Technology - An Autonomous Institute, Affiliated with the University of Mumbai) to the Second Year Computer Engineering Students durigng the Acdemic Year 2024-25