SICP Study, a collaborative classroom style learning

This project is for peer reviewing the Structure and Interpretation of Computer Programs (SICP) assigments using this workflow:

Watch the lecture and read the book,
Submit assignments before Friday, and
Review others assignments on Friday.

Bookmarks:

Do not edit this document directly, instead modify the README.org file and re-export the markdown and ics file.

Submit Assignment

To submit an assignment, first create a folder with your name in the assignments directory and add your answers in text file(s). Any file format or directory structure will do. For example:

assignments/my-name/solution-1.txt
assignments/my-name/week1/1.2.scm

Note that if the file name matches an exercise number, then an evaluation script will be used to validate the code (wip). Org-mode tangle are also supported, feel free to use the template.

Then submit a Pull request with the assignment name in the commit message.

Review Assignment

Go to the pull request list and pick another student assignment. Click the Files Changed button and check the answers. Feel free to add comment or ask for clarification by clicking the blue + sign. If the answers look correct to you, click the Review changes button and Approve the change.

When one or more other studends already approved a change, then add a mergeit label to close the pull request.

2019 Schedule

This is a weekly schedule adapted from this meetup:

Chapter 1

1.1 (The Elements of Programming)

DEADLINE: <2019-01-11 Fri>

SICP Study, a collaborative classroom style learning

Submit Assignment

Review Assignment

2019 Schedule

Chapter 1

1.1 (The Elements of Programming)

1.2 (Procedures and the Processes Who Love Them)

1.3 (Formulating Abstractions)

Chapter 2

1.3.4 & 2.1.1 & 2.1.2 & 2.1.3 (Data Abstraction)

2.1.4 (Interval Arithmetic)

2.2.1 & 2.2.2 (Hierarchical Structures)

2.2.3 (Sequences as Conventional Interfaces)

2.2.4 (A Picture Language)

2.3.1 & 2.3.2 (Symbolic Differentiation)

2.3.3 (Representing Sets)

2.3.4 (Huffman Encoding)

2.4 (Data Representations)

2.5.1 & 2.5.2 (Generic Operations)

2.5.3 (Symbolic Algebra)

Chapter 3

3.1 (Local State)

3.2 (The Environmental Model)

3.3.1 & 3.3.2 (Mutable Lists and Queues)

3.3.3 & 3.3.4 (Mutable Tables and Circuit Simulation)

3.3.5 (Propagation of Constraints)

3.4 (Concurrency)

3.5.1 & 3.5.2 (Infinite Streams)

3.5.3 (Exploiting the Stream Paradigm)

3.5.4 & 3.5.5 (Streams and Delayed Evaluation)

Chapter 4

4.1.1 & 4.1.2 (Metacircular Doohickeys)

4.1.3 & 4.1.4 & 4.1.5 & 4.1.6 & 4.1.7 (Evaluators are Programs Too)

4.1.3 & 4.1.4 & 4.1.5 & 4.1.6 & 4.1.7 (Evaluators are Programs Too)

4.2.1 & 4.2.2 (Lazy Evaluators Need Motivation)

4.2.3 (Lazy Streams Wend Cross Dales)

4.3.1, first half of 4.3.2 (Non-deterministic Computing Exclamation Point)

remainder of 4.3 (Implementing Amb)

4.4.1 (Deductive Information Retrieval)

4.4.2, 4.4.3

4.4.2, 4.4.3

Week off!

4.4.4.1&2

4.4.4.3&4

Chapter 5

5.1

5.1.1-5.1.2

5.1.3-5.1.5

5.2.1

5.2.2

5.2.3-5.2.4

5.3

5.4.1 & 5.4.2

5.4.3 & 5.4.4

5.5.1 & 5.5.2

5.5.3 & 5.5.4

5.5.5 & 5.5.6

Ending

SICP The Final Chapter! (SICP The End)

SICP REVIEW PARTY!!! (SICP Review Party!)

About

Languages