Four coloring greedy algorithm visualizations
John A. Beidler, Yaodong Bi · Journal of computing sciences in colleges · 2014
This paper presents two programming assignments where students construct software to four-color a map using greedy algorithms. A visualization is employed so that students can see the progress of their software as the map is colored. The assignments are given in two courses, our CMPS 144 (first year second semester), Computer Science II, and CMPS 240 (second year first semester), Data Structures and Algorithms. In the CMPS 144 course the students use two stacks to hold access to the areas that have been successfully and unsuccessfully colored by the greedy algorithm. In the CMPS 240 course the student employ a greedy algorithm using threads, one thread per area. This paper presents observations about the role visualization plays in these assignments.