Required
Grissom, S., McNally, M.F. and Naps, T., 2003, June. Algorithm visualization in CS education: comparing levels of student engagement. In Proceedings of the 2003 ACM symposium on Software visualization (pp. 87-94).
Read the resource ↗Readings
The assigned papers for Week 3 are as follows:
Required
Grissom, S., McNally, M.F. and Naps, T., 2003, June. Algorithm visualization in CS education: comparing levels of student engagement. In Proceedings of the 2003 ACM symposium on Software visualization (pp. 87-94).
Read the resource ↗Required
Guo, P.J., 2013, March. Online python tutor: embeddable web-based program visualization for cs education. In Proceeding of the 44th ACM technical symposium on Computer science education (pp. 579-584).
Read the resource ↗Optional
Farghally, M.F., Koh, K.H., Shahin, H. and Shaffer, C.A., 2017, March. Evaluating the effectiveness of algorithm analysis visualizations. In Proceedings of the 2017 ACM SIGCSE Technical Symposium on Computer Science Education (pp. 201-206).
Read the resource ↗After reading the assigned papers, write a reflection for each one addressing the following points:
Briefly summarize the key findings, or insights from the readings. What are the main takeaways from the research?
Reflect on how you could apply the findings from the research to your own future courses. For example, how could you integrate the strategies, tools, or insights discussed in the paper into your teaching methods, course design, or assessments?
Consider the limitations or challenges of the research. Are there any aspects of the study that you believe could be improved or further explored? Do you think the findings are applicable to a variety of student populations, or are they context-dependent?
Some publisher resources require institutional access or a subscription.