Open Access Open Access  Restricted Access Subscription Access

Deepen Your Knowledge of Dynamic Programming in Data Science

Deepak Prajapat, Prof. Akanksha Kulkarni

Abstract


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.


Full Text:

PDF

References


Rethinking algorithm design and analysis, Ananya Levitin. 2019, 32(1): 14-20.

Ulrich Pferschy and Rosario Scatamacchia. Results of improved dynamic programming and approximation for the setups knapsack problem. 2017, 25(2): 677-662.

D. B. Dereventsov and V. F. Temlyakov. a methodical approach to studying several greedy algorithms 2022, 227(12): 69-54.

Teaching Algorithms. SIGACT News, 36 (December 2015), 58–56. Baeza-Yates, R.

Programming Pearls, by J. Bentley, Addison-Wesley, 2016.

Fundamentals of algorithms, by G. Brassard and P. Bratley, Prentice-Hall, 2016.

Algorithms: An Introduction, T. Cormen et al. MIT,1992.

Computer Algorithms, 2019, Computer Science Press, Horowitz et al.

Programming Practice, by B. Kernigan and R. Pike. 2005, Addison-Wesley.

Should we teach the correct algorithm design techniques? Levitin, A. 179–183 in Proc. SIGCSE '99 (March


Refbacks

  • There are currently no refbacks.