CS 5010 Module 06

Module Overview

In this module we will learn about two related topics: branching structures, such as trees, and mutually recursive data definitions, such as lists of alternating strings and numbers. These two topics combine in the study of S-expressions. S-expressions are nested lists, such as the lists we write when we write Racket programs. S-expressions are one of the great inventions of modern programming. They were the original idea from which things like XML and JSON grew.

Course Map

Readings

Part IV from the textbook.

Resources

• Examples for Week 06
• In-Class Exercise for Week 06

Lessons and Guided Practices

• Lesson 6.1 Lists vs. Structures (PDF)
• Guided Practice 6.1
• Lesson 6.2 Trees (PDF)
• Guided Practice 6.2
• Lesson 6.3 From Templates to Folds (PDF)
• Guided Practice 6.3
• Lesson 6.4 Mutually Recursive Data Definitions (PDF)
• Guided Practice 6.4
• Lesson 6.5 Lists of Lists (PDF)
• Guided Practice 6.5
• Lesson 6.6 Multi-Way Trees (PDF)
• Guided Practice 6.6

Problem Set

Problem Set 06 was assigned Monday, 22 February.