MonitTDPA: A Tool for Monitoring the Tracing of Dynamic Programming Algorithms

被引:6
|
作者
Bahig, Hazem M. [1 ,2 ]
Khedr, Ahmed Y. [1 ,3 ]
机构
[1] Hail Univ, Coll Comp Sci & Engn, Hail, Saudi Arabia
[2] Ain Shams Univ, Dept Math, Fac Sci, Cairo, Egypt
[3] Al Azhar Univ, Syst & Comp Dept, Fac Engn, Cairo, Egypt
关键词
D O I
10.1002/cae.21781
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
Algorithms are important procedures that are found in every aspect in our life. Large numbers of these algorithms cannot be accurately understood unless they are presented differently, especially if they are taught to students. A complete visualization system is created to teach dynamic programming algorithms. Through visualization, a student is able to trace the algorithm step-by-step, similar to the debugger, but in a simplified way. In addition, the system can handle errors during the execution of the algorithm. Moreover, the system guides and helps the students during the tracing and stores all of the information about the errors during the tracing. The students obtain the feedback of the tracing from a report generated by the system. The teacher benefits from the generated report through the enhancement of the teaching methods that focus on the misunderstood steps. Additionally, the system allows the user to see how a certain algorithm can be monitored by displaying the source code. The developed system is evaluated using different methods to prove the effectiveness of the system in teaching and learning. (C) 2017 Wiley Periodicals, Inc.
引用
收藏
页码:179 / 187
页数:9
相关论文
共 50 条
  • [1] Monitoring and control of anytime algorithms: A dynamic programming approach
    Hansen, EA
    Zilberstein, S
    ARTIFICIAL INTELLIGENCE, 2001, 126 (1-2) : 139 - 157
  • [2] DISCRETE DYNAMIC PROGRAMMING ALGORITHMS
    SEINFELD, JH
    LAPIDUS, L
    INDUSTRIAL & ENGINEERING CHEMISTRY PROCESS DESIGN AND DEVELOPMENT, 1968, 7 (03): : 479 - &
  • [3] Evolutionary algorithms and dynamic programming
    Doerr, Benjamin
    Eremeev, Anton
    Neumann, Frank
    Theile, Madeleine
    Thyssen, Christian
    THEORETICAL COMPUTER SCIENCE, 2011, 412 (43) : 6020 - 6035
  • [4] A Stronger Model of Dynamic Programming Algorithms
    Buresh-Oppenheim, Joshua
    Davis, Sashka
    Impagliazzo, Russell
    ALGORITHMICA, 2011, 60 (04) : 938 - 968
  • [5] A Stronger Model of Dynamic Programming Algorithms
    Joshua Buresh-Oppenheim
    Sashka Davis
    Russell Impagliazzo
    Algorithmica, 2011, 60 : 938 - 968
  • [6] ON THE ALGORITHMS OF DYNAMIC PROGRAMMING FOR OPTIMAL PROCESSES
    Ovchinnikov, V. G.
    VESTNIK SAMARSKOGO GOSUDARSTVENNOGO TEKHNICHESKOGO UNIVERSITETA-SERIYA-FIZIKO-MATEMATICHESKIYE NAUKI, 2012, (03): : 215 - 218
  • [7] How to Multiply Dynamic Programming Algorithms
    Siederdissen, Christian Hoener Zu
    Hofacker, Ivo L.
    Stadler, Peter F.
    ADVANCES IN BIOINFORMATICS AND COMPUTATIONAL BIOLOGY, 2013, 8213 : 82 - 93
  • [8] Canonical greedy algorithms and dynamic programming
    Lew, Art
    CONTROL AND CYBERNETICS, 2006, 35 (03): : 621 - 643
  • [9] PARALLEL DYNAMIC-PROGRAMMING ALGORITHMS
    VELDHORST, M
    LECTURE NOTES IN COMPUTER SCIENCE, 1986, 237 : 393 - 402
  • [10] DYNAMIC-PROGRAMMING MODELS AND ALGORITHMS
    DREYFUS, S
    MANAGEMENT SCIENCE, 1959, 5 (03) : 346 - 346