Simplifying Dynamic Programming
Proceeding: The Fifth International Conference on Informatics and Applications (ICIA2016)Publication Date: 2016-11-14
Authors : Jamil Saquer; Lloyd Smith;
Page : 159-164
Keywords : Dynamic Programming; Computer Science Education; Algorithms; Python.;
Abstract
Dynamic Programming (DP) is one of the fundamental topics usually covered in the algorithms course. Nonetheless, it is a challenging subject for many computer science students. This paper presents work in progress for making dynamic programming easier for students. We propose four simple and interesting DP problems that students can learn early in the curriculum. One of these problems can be introduced as early as CS1. The other problems can be used in a CS2 course. We believe that this will make the subject of DP easier for many students when they encounter it later, in an algorithms course, and will result in more success and retention of CS students.
Other Latest Articles
- An Efficient Algorithm for Processing Top-K Spatial Keyword Query Based on Single Quadtree Traversal
- Regular vs. Irregular Topologies in Networks-on-Chips: A Survey
- A Survey: Load Balanced Routing Techniques in Network-on-Chips
- Constructing Topic Hierarchy Tree for User Interests from Multiple Knowledge Bases
- Automatic Generation of Membership Functions and Rules in a Fuzzy Logic System
Last modified: 2016-11-28 23:13:20