COMPUTER DOMAIN
Published May 8, 2023 | Version v1
Journal article Open

Deepen Your Knowledge of Dynamic Programming in Data Science

Creators

  • 1. Student, Dept. School of Engineering, Ajeenkya D.Y. Patil University, Pune, India
  • 2. Professor, Dept. School of Engineering, Ajeenkya D.Y. Patil University, Pune, India

Description

Dynamic programming is an area that is often not well understood by those learning algorithms for the first time, but it is a crucial part that should be studied. This technique has been effectively used in numerous fields, including controlling human movement, distributing hydroelectric resources, and gene sequencing. This article provides a detailed explanation of the dynamic programming principle, comparing it to other algorithms to help readers understand its nature, benefits, and drawbacks compared to alternative problem-solving techniques. Using relevant application examples, it explores the stages and techniques involved in dynamic programming problem-solving.

Files

Deepen Your Knowledge of Dynamic -Formatted Paper.pdf

Files (176.2 kB)

Additional details

References

  • 1. Levitin. A. (2019). Rethinking algorithm design and analysis. 32(1):14-20.
  • 2. Pferschy U, Scatamacchia R.(2017). Results of improved dynamic programming and approximation for the setups knapsack problem. 25(2): 677-662.
  • 3. Dereventsov D. B., Temlyakov V. F.(2022). A methodical approach to studying several greedy algorithm. 227(12): 69-54.
  • 4. Teaching Algorithms. SIGACT News, 36 (December 2015), 58–56. Baeza-Yates, R.
  • 5. Bentley, J. (2016). Programming pearls. Addison-Wesley Professional.. Brassard, G., & Bratley, P. (1996). Fundamentals of algorithmics. Prentice-Hall, Inc...
  • 6. Cormen, T. H., Leiserson, C. E., Rivest, R. L., & Stein, C. (2022). Introduction to algorithms. MIT press. Computer Algorithms, 2019, Computer Science Press, Horowitz et al
  • 7. Kernighan, B. W., & Pike, R. (1999). The practice of programming. Addison-Wesley Professional..
  • 8. Levitin, A (2013)Should we teach the correct algorithm design techniques?. 179–183 in Proc. SIGCSE '99 . Neapolitan, R., & Naimipour, K. (2010). Foundations of algorithms. Jones & Bartlett Publishers.
  • 9. Polya, G. (2004). How to solve it: A new aspect of mathematical method (No. 246). Princeton university press. Rawlins. J. (2019). Compared To What? : an Introduction to the Study of AlgorithmsComp. Sc. Press.
  • 10. Algorithms, R. Sedgewick, 2020, Addison-Wesley.