Date, Time, & Location

Wednesday, April 5, 3:30pm-4:45pm, Dion 101


Exam 2 may include all material from the beginning of the semester through aggregation, but it will emphasize material since Exam 1 (networks). That material is Chapters 8.1-8.3,10,6,11,12, and 13. In addition, the exam will cover HTML, CSS, SVG, and D3 concepts, including the understanding of code. If you are required to write code, I will only require pseudocode---the exact syntax is not required. As this is a graduate course, you will also be asked about papers referenced in class; for this exam, they will be restricted to those covered since Exam 1.


  • Multiple Choice
  • Free Response

Example Types of Free-Response Questions

  • What type of colormap would be appropriate for a given dataset? Which one of the following colormaps matches that type? Why would the other colormaps be suboptimal?
  • What are problems with rainbow colormaps?
  • Given the latitude and longitude representing the boundaries of a state, what steps are required to draw it on a screen?
  • What is a technique to address the problem of being able to see houses in a neighborhood while also being able to see where it is in a country?
  • When doing spatial aggregation, what issue do you need to be aware of?
  • Identify the strategy used to address complexity in the given visualization (e.g. juxtaposition, superimposition, nesting).
  • For juxtaposition, Is the data shown in each view the same, different, or a subset? Is the visualization encoding the same or different?
  • How scalable is the given strategy?
  • What problem does edge bundling address? Why is the hierarchical nature of this important?
  • What problem with slice-and-dice treemaps does squarified treemaps address?
  • What problem with with treemaps with no shading do cushioned treemaps address?
  • What did Heer and Robertson test with respect to animation? What did their results show?
  • What is the integration strategy for coordinated visualizations?