Racket Programming Ways Of Representing And Tracing Recursive Calls

Harvey Mudd College CS 60 Prof. Colleen Lewis Lecture 02 part 1 Content:

Harvey Mudd College CS 60 Prof. Colleen Lewis Lecture 05 part 2 Content: Use-it or lose-it: sublist.

Using

We explore more concepts around

Reading (1.1.1 and 1.1.2): https://mitpress.mit.edu/sites/default/files/sicp/full-text/book/book-Z-H-10.html.

Tracing Recursive Calls

Harvey Mudd College CS 60 Prof. Colleen Lewis Lecture 06 part 1 Content: Tree vocab, BST introduction and representations.

In this video, we take a look at one of the more challenging computer science concepts:

Harvey Mudd College CS 60 Prof. Colleen Lewis Lecture 01 part 1 Content: Introduction to

jest learn

Timeline -- 0:00 Introduction to

Harvey Mudd College CS 60 Prof. Colleen Lewis Lecture 05 part 3 Content: Use-it or Lose-it: reach.

I'm assuming that students watching this videos have already mastered the basics of

Looking at embedded and tail

Tail and non-tail

Harvey Mudd College CS 60 Prof. Colleen Lewis Lecture 04 part 1 Content: Implementing cons without built-in pairs!

ERRATA: in comment for "is this