Online Version - Last Updated - 20 Jan 2012 |
 |
| Home |
| |
| Procedures and Resources for Authors |
|
| Information and Resources for Volume Editors |
| |
| Orders and Subscriptions |
| |
| Published Articles |
|
| Upcoming Volumes |
| |
| Contact Us |
| |
| Useful External Links |
| |
| CRPIT Site Search |
Dynamic evaluation trees for novice C programmers
Egan, M.H. and McDonald, C.
The dynamic evaluation tree is a method of visualizing expression evaluation that annotates a program's source code with expression results. It is intended to reduce students' visual attention problems by removing the need to alternate between disparate source code and expression evaluation windows. We generalise the dynamic evaluation tree to support arbitrary expressions in the C programming language, and present the first ever implementation for a novice-focused program visualization and debugging tool.
Cite as: Egan, M.H. and McDonald, C. (2015). Dynamic evaluation trees for novice C programmers. In Proc. 17th Australasian Computing Education Conference (ACE 2015) Sydney, Australia. CRPIT, 160. D'Souza, D and Falkner, K. Eds., ACS. 175-181
(from crpit.com)
(local if available)
