Link your references in here

References

Books

1. Cormen, T. H., Leiserson, C. E., Rivest, R. L., & Stein, C. (2009). Introduction to Algorithms (3rd ed.). MIT Press. (Chapter 15: Dynamic Programming)
2. Antoine Vigneron, CSE331 Introduction to Algorithms, Lecture 18, The Rod-Cutting Problem

Research Papers

1. https://www.researchgate.net/publication/228830288\_Rod\_cutting\_optimization\_with\_store\_utilization
2. https://www.researchgate.net/publication/304559939\_Optimal\_Cutting\_Problem.

Online Resources

1. GeeksforGeeks - https://www.geeksforgeeks.org/dsa/cutting-a-rod-dp-13/
2. Khan Academy - Dynamic Programming. https://www.khanacademy.org/computing/computer-science/algorithms
3. Stanford (Jessica Su) - https://web.stanford.edu/class/archive/cs/cs161/cs161.1168/lecture12.pdf
4. Virtual Labs - DEI. https://www.vlab.co.in/

Software and Tools

1. Virtual Labs Platform - Dayalbagh Educational Institute
2. Font Awesome Icons - https://fontawesome.com/
3. JSON Validator - https://jsonlint.com/

Online Video Lectures

1. NPTEL: Design and Analysis of Algorithms

   • Offered by: IIT Bombay
   • Instructors: Prof. Abhiram G. Ranade, Prof. Ajit A. Diwan, Prof. Sundar Viswanathan
   • Link: https://nptel.ac.in/courses/106101060

2. NPTEL (NOC): Design and Analysis of Algorithms

   • Offered by: Chennai Mathematical Institute
   • Instructor: Prof. Madhavan Mukund
   • Link: https://nptel.ac.in/courses/106106131