Friday - Lecture 17 - Hash Maps
Date: July 17

Today we’re going to spend some time reviewing imperatives to set the stage for the idea of object-oriented programming. This is a design approach to programs that essentially involves the idea that “everything is a struct!” That means we need to be super clear on all of our new struct abilities since we started working in #lang htdp/asl.

We’ll also introduce a new data structure as a preview to the sorts of things you’ll be doing in future CS classes (particularly CS 214 – now called CS 208). For those of you who have programmed before you may have used a dictionary which stores key-value pairs. For instance my "favorite color" (key) is "green" (value). While some languages call this a dictionary, in ASL, it’s called a HashMap. We’ll dig into the details of how these work and also talk about why we bother having multiple different ways of storing similar data.


In-Class Resources


📊 Slides
🏸 RKT Examples
🎬 Available Videos 🎥
Link Title Type Duration
Video 1 Lecture 17.1 - Introduction pre-recorded 4:59
Video 2 Lecture 17.2 - Key-Value Maps pre-recorded 8:00
Video 3 Lecture 17.3 - Y tho? pre-recorded 4:38

Mini-Quiz 17: HashMaps

To take the mini-quiz associated with this lecture's content, you can use this link or find the quiz under the Quizzes page on Canvas.