Assignment
Visualizations in CS Education
THIS IS A GROUP ASSIGNMENT. YOU CAN WORK IN A GROUP OF 3 AND SUBMIT JUST ONE RESPONSE TO CANVAS. PLEASE DON'T FORGET TO ADD YOUR NAMES TO ONE OF THE GROUPS IN THE GROUP SET NAMED "VISUALIZATIONS IN CS EDUCATION".
The purpose of this assignment is to help you create a simple animation that you might use for your future course. The focus here in this assignment will be on the "Viewing" and "Responding" levels of engagement. To give an example of something similar, please take a look at this powerpoint file
visualizing the build-heap operation.
Please follow these steps:
- Choose a topic that is conceptually challenging and often misunderstood by students. Examples include but not limited to:
- Recursion
- Sorting algorithms (e.g., quicksort, mergesort)
- Data structures (e.g., binary trees, graphs)
- Algorithm analysis (e.g., Big-O notation)
- Any other topic from a non-programing course
- Using Microsoft Power Point (or your preferred tool), create the following slides:
- Title Slide: Briefly introduce the topic your visualization is describing
- Animation Slide: Using the animation effects in your tool, create a student-controlled animation (i.e., animation proceeds to the next step when the student clicks or presses a button)
- Make sure to observe the "Responding" level in your visualization. You can do that by displaying questions between some of the animation steps.
- Reflect on the challenges you might have faced when implementing your visualization, and suggest strategies to overcome these challenges.
Build-heap PowerPoint example — the original Canvas link requires course access. The example file was not included in the supplied materials.