Towards a Better Way to Teach Dynamic Programming
Journal: Olympiads in Informatics (Vol.9, No. 1)Publication Date: 2015-08-01
Authors : Michal FORISEK.;
Page : 45-55
Keywords : algorithms; dynamic programming; memoization; task analysis;
Abstract
We give an overview of how various popular algorithm textbooks deal with the topic of dynamic programming, and we identify various issues with their expositions. In the second part of the paper we then give what we believe to be a better way of presenting the topic. While textbooks only contain the actual exposition, our paper also provides the rationale behind our choices. In particular, we managed to divide the topic into a sequence of simpler conceptual steps that are easier to learn.
Other Latest Articles
- Efficient Range Minimum Queries using Binary Indexed Trees
- Methodology for Characterization of Cognitive Activities when Solving Programming Problems of an Algorithmic Nature
- Influence of Amino-Ffunctional Macro and Micro Silicone Softeners on the Properties of Cotton Fabric
- Informatics: A Review of Selection Processes, Trainings and Promotion Activities
- Libinteractive: A Better Way to Write Interactive Tasks
Last modified: 2016-01-18 22:44:50