Name: Movie Night
Institution: University of Michigan
CT: Data, Algorithms
RPP Connection: K and 1st Grade (Module 1)
Type: Digital & Unplugged
Platform: Jamboard
Status: Retire
-
Strands of Computational Thinking Addressed:
-
Algorithms:
-
Create a simple algorithm, individually and collaboratively, without using computers to complete a task (e.g., making a sandwich, getting ready for school, checking a book out of the library).
-
Enact an algorithm using tangible materials (e.g., manipulatives, your body) or present the algorithm in a visual medium (e.g., storyboard).
-
-
Data:
-
Individually and collaboratively, propose a solution to a problem or question based on an analysis of information.
-
-
-
Vignette and Funds of Knowledge Leveraged:
-
Vignette #99, p. 132: Movie Night Traditions
-
“Movie Night”, or in-family routines and traditions
-
This task taps into students’ funds of knowledge around family or group membership and the calculated ways in which members often need to balance a number of different preferences and needs in designing optimal experiences of shared quality time altogether.
-
-
Description of Task:
-
First, students will be told that they will be planning a movie night with their families. They are asked how many and which members of their family would be involved, and choose avatars/name cards for them (up to 6 members). These name cards will already be filled in with preferences of movie, snacks, and bedtime.
-

-
Depending on students’ grade level and cognitive needs, the descriptions and preferences connected to each family member can be as simple as the emojis indicated in the screenshot above, or more detailed, several word-length descriptions
-
These descriptions can also be more aligned altogether, or more varying and complex (for instance, 2 out of the family or group having the same bedtime versus every one having a different bedtime)
-
Teachers will click onto the next page of the jamboard. Students will pick, drag and drop avatars from the previous page (by copying and pasting) to match each participant in the movie night to a card, and type their name into the text box. Teachers should then remind students that each card details the participants’ preferences, and prompt students to identify each members’ preferences. They can ask, for instance, “What do you notice about Andrea’s movie preferences? What does she like to see, and what movie does it remind you of? What kind of snacks does she like to eat when watching a movie?”. If students need to see the cards more closely, the teacher can click back to the previous page, where cards are bigger.
-
Students are then told that there are three essential steps to planning a movie night: picking the movie, picking out snacks, and scheduling the time. They are asked to put those three steps in order, determining which steps to do first, next, and last. They will drag and drop cards corresponding to those steps in the spaces designated “Step 1”, “Step 2”, and “Step 3”. Teachers will then prompt students to validate their algorithm/set of steps by asking, “Why is this the order you chose? How is this the best approach to planning a movie night?”

-
Once their order is set, they will follow through with each of those steps, gauging the data of their family members' preferences to make decisions about each step. As they finish each step, the teacher should prompt them to justify their choices and check to see that they optimally align with family or individual needs and preferences.
-
Depending on students’ grade level and cognitive needs, the movie and snack, and timing choices can be as few as 3, or as large as 6. Some examples are listed below.
-
Movie choices: Luca, Encanto, Sonic, Puss in Boots: The Last Wish, Moana, Raya and the Last Dragon
-
Snack choices: Takis, Lay’s Chips, Sour Patch Kids, Popcorn, Welch’s Fruit Snacks, Oreos
-
Bedtime Choices: 7:00, 7:15, 7:30, 7:45, 8:00, 8:15, 8:30
-
-
-
Finally, the teacher will prompt students to reflect and evaluate how they did – first, they’ll ask them to drag and drop the emoji representing each participants’ level of happiness (sad, elated, and somewhere in the middle) into the blue box. Then they’ll ask, is everyone in the family the happiest they can be? What steps did you take to make sure you were planning the best movie night for everyone? For instance, in the screenshot below, a student might argue that everyone is partially satisfied with their final choices, because Samara got to watch the movie she wanted (Luca), Marcus got an optimal starting time of 6:00 PM (assuming a movie length of 2 hours), and Andrea got her snack choice of candy, though each participant didn’t get every one of their preferences. This argument is to the discretion of the student, and will be evaluated for computational thinking through a simple, standards-aligned rubric.
