-
Notifications
You must be signed in to change notification settings - Fork 11
/
index.html
677 lines (589 loc) · 48.8 KB
/
index.html
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
<html><head><meta http-equiv="Content-Type" content="text/html; charset=utf-8"/><title>Structure and Interpretation of Computer Programs</title><style>
/* cspell:disable-file */
/* webkit printing magic: print all background colors */
html {
-webkit-print-color-adjust: exact;
}
* {
box-sizing: border-box;
-webkit-print-color-adjust: exact;
}
html,
body {
margin: 0;
padding: 0;
}
@media only screen {
body {
margin: 2em auto;
max-width: 900px;
color: rgb(55, 53, 47);
}
}
body {
line-height: 1.5;
white-space: pre-wrap;
}
a,
a.visited {
color: inherit;
text-decoration: underline;
}
.pdf-relative-link-path {
font-size: 80%;
color: #444;
}
h1,
h2,
h3 {
letter-spacing: -0.01em;
line-height: 1.2;
font-weight: 600;
margin-bottom: 0;
}
.page-title {
font-size: 2.5rem;
font-weight: 700;
margin-top: 0;
margin-bottom: 0.75em;
}
h1 {
font-size: 1.875rem;
margin-top: 1.875rem;
}
h2 {
font-size: 1.5rem;
margin-top: 1.5rem;
}
h3 {
font-size: 1.25rem;
margin-top: 1.25rem;
}
.source {
border: 1px solid #ddd;
border-radius: 3px;
padding: 1.5em;
word-break: break-all;
}
.callout {
border-radius: 3px;
padding: 1rem;
}
figure {
margin: 1.25em 0;
page-break-inside: avoid;
}
figcaption {
opacity: 0.5;
font-size: 85%;
margin-top: 0.5em;
}
mark {
background-color: transparent;
}
.indented {
padding-left: 1.5em;
}
hr {
background: transparent;
display: block;
width: 100%;
height: 1px;
visibility: visible;
border: none;
border-bottom: 1px solid rgba(55, 53, 47, 0.09);
}
img {
max-width: 100%;
}
@media only print {
img {
max-height: 100vh;
object-fit: contain;
}
}
@page {
margin: 1in;
}
.collection-content {
font-size: 0.875rem;
}
.column-list {
display: flex;
justify-content: space-between;
}
.column {
padding: 0 1em;
}
.column:first-child {
padding-left: 0;
}
.column:last-child {
padding-right: 0;
}
.table_of_contents-item {
display: block;
font-size: 0.875rem;
line-height: 1.3;
padding: 0.125rem;
}
.table_of_contents-indent-1 {
margin-left: 1.5rem;
}
.table_of_contents-indent-2 {
margin-left: 3rem;
}
.table_of_contents-indent-3 {
margin-left: 4.5rem;
}
.table_of_contents-link {
text-decoration: none;
opacity: 0.7;
border-bottom: 1px solid rgba(55, 53, 47, 0.18);
}
table,
th,
td {
border: 1px solid rgba(55, 53, 47, 0.09);
border-collapse: collapse;
}
table {
border-left: none;
border-right: none;
}
th,
td {
font-weight: normal;
padding: 0.25em 0.5em;
line-height: 1.5;
min-height: 1.5em;
text-align: left;
}
th {
color: rgba(55, 53, 47, 0.6);
}
ol,
ul {
margin: 0;
margin-block-start: 0.6em;
margin-block-end: 0.6em;
}
li > ol:first-child,
li > ul:first-child {
margin-block-start: 0.6em;
}
ul > li {
list-style: disc;
}
ul.to-do-list {
text-indent: -1.7em;
}
ul.to-do-list > li {
list-style: none;
}
.to-do-children-checked {
text-decoration: line-through;
opacity: 0.375;
}
ul.toggle > li {
list-style: none;
}
ul {
padding-inline-start: 1.7em;
}
ul > li {
padding-left: 0.1em;
}
ol {
padding-inline-start: 1.6em;
}
ol > li {
padding-left: 0.2em;
}
.mono ol {
padding-inline-start: 2em;
}
.mono ol > li {
text-indent: -0.4em;
}
.toggle {
padding-inline-start: 0em;
list-style-type: none;
}
/* Indent toggle children */
.toggle > li > details {
padding-left: 1.7em;
}
.toggle > li > details > summary {
margin-left: -1.1em;
}
.selected-value {
display: inline-block;
padding: 0 0.5em;
background: rgba(206, 205, 202, 0.5);
border-radius: 3px;
margin-right: 0.5em;
margin-top: 0.3em;
margin-bottom: 0.3em;
white-space: nowrap;
}
.collection-title {
display: inline-block;
margin-right: 1em;
}
.simple-table {
margin-top: 1em;
font-size: 0.875rem;
empty-cells: show;
}
.simple-table td {
height: 29px;
min-width: 120px;
}
.simple-table th {
height: 29px;
min-width: 120px;
}
.simple-table-header-color {
background: rgb(247, 246, 243);
color: black;
}
.simple-table-header {
font-weight: 500;
}
time {
opacity: 0.5;
}
.icon {
display: inline-block;
max-width: 1.2em;
max-height: 1.2em;
text-decoration: none;
vertical-align: text-bottom;
margin-right: 0.5em;
}
img.icon {
border-radius: 3px;
}
.user-icon {
width: 1.5em;
height: 1.5em;
border-radius: 100%;
margin-right: 0.5rem;
}
.user-icon-inner {
font-size: 0.8em;
}
.text-icon {
border: 1px solid #000;
text-align: center;
}
.page-cover-image {
display: block;
object-fit: cover;
width: 100%;
max-height: 30vh;
}
.page-header-icon {
font-size: 3rem;
margin-bottom: 1rem;
}
.page-header-icon-with-cover {
margin-top: -0.72em;
margin-left: 0.07em;
}
.page-header-icon img {
border-radius: 3px;
}
.link-to-page {
margin: 1em 0;
padding: 0;
border: none;
font-weight: 500;
}
p > .user {
opacity: 0.5;
}
td > .user,
td > time {
white-space: nowrap;
}
input[type="checkbox"] {
transform: scale(1.5);
margin-right: 0.6em;
vertical-align: middle;
}
p {
margin-top: 0.5em;
margin-bottom: 0.5em;
}
.image {
border: none;
margin: 1.5em 0;
padding: 0;
border-radius: 0;
text-align: center;
}
.code,
code {
background: rgba(135, 131, 120, 0.15);
border-radius: 3px;
padding: 0.2em 0.4em;
border-radius: 3px;
font-size: 85%;
tab-size: 2;
}
code {
color: #eb5757;
}
.code {
padding: 1.5em 1em;
}
.code-wrap {
white-space: pre-wrap;
word-break: break-all;
}
.code > code {
background: none;
padding: 0;
font-size: 100%;
color: inherit;
}
blockquote {
font-size: 1.25em;
margin: 1em 0;
padding-left: 1em;
border-left: 3px solid rgb(55, 53, 47);
}
.bookmark {
text-decoration: none;
max-height: 8em;
padding: 0;
display: flex;
width: 100%;
align-items: stretch;
}
.bookmark-title {
font-size: 0.85em;
overflow: hidden;
text-overflow: ellipsis;
height: 1.75em;
white-space: nowrap;
}
.bookmark-text {
display: flex;
flex-direction: column;
}
.bookmark-info {
flex: 4 1 180px;
padding: 12px 14px 14px;
display: flex;
flex-direction: column;
justify-content: space-between;
}
.bookmark-image {
width: 33%;
flex: 1 1 180px;
display: block;
position: relative;
object-fit: cover;
border-radius: 1px;
}
.bookmark-description {
color: rgba(55, 53, 47, 0.6);
font-size: 0.75em;
overflow: hidden;
max-height: 4.5em;
word-break: break-word;
}
.bookmark-href {
font-size: 0.75em;
margin-top: 0.25em;
}
.sans { font-family: ui-sans-serif, -apple-system, BlinkMacSystemFont, "Segoe UI", Helvetica, "Apple Color Emoji", Arial, sans-serif, "Segoe UI Emoji", "Segoe UI Symbol"; }
.code { font-family: "SFMono-Regular", Menlo, Consolas, "PT Mono", "Liberation Mono", Courier, monospace; }
.serif { font-family: Lyon-Text, Georgia, ui-serif, serif; }
.mono { font-family: iawriter-mono, Nitti, Menlo, Courier, monospace; }
.pdf .sans { font-family: Inter, ui-sans-serif, -apple-system, BlinkMacSystemFont, "Segoe UI", Helvetica, "Apple Color Emoji", Arial, sans-serif, "Segoe UI Emoji", "Segoe UI Symbol", 'Twemoji', 'Noto Color Emoji', 'Noto Sans CJK JP'; }
.pdf:lang(zh-CN) .sans { font-family: Inter, ui-sans-serif, -apple-system, BlinkMacSystemFont, "Segoe UI", Helvetica, "Apple Color Emoji", Arial, sans-serif, "Segoe UI Emoji", "Segoe UI Symbol", 'Twemoji', 'Noto Color Emoji', 'Noto Sans CJK SC'; }
.pdf:lang(zh-TW) .sans { font-family: Inter, ui-sans-serif, -apple-system, BlinkMacSystemFont, "Segoe UI", Helvetica, "Apple Color Emoji", Arial, sans-serif, "Segoe UI Emoji", "Segoe UI Symbol", 'Twemoji', 'Noto Color Emoji', 'Noto Sans CJK TC'; }
.pdf:lang(ko-KR) .sans { font-family: Inter, ui-sans-serif, -apple-system, BlinkMacSystemFont, "Segoe UI", Helvetica, "Apple Color Emoji", Arial, sans-serif, "Segoe UI Emoji", "Segoe UI Symbol", 'Twemoji', 'Noto Color Emoji', 'Noto Sans CJK KR'; }
.pdf .code { font-family: Source Code Pro, "SFMono-Regular", Menlo, Consolas, "PT Mono", "Liberation Mono", Courier, monospace, 'Twemoji', 'Noto Color Emoji', 'Noto Sans Mono CJK JP'; }
.pdf:lang(zh-CN) .code { font-family: Source Code Pro, "SFMono-Regular", Menlo, Consolas, "PT Mono", "Liberation Mono", Courier, monospace, 'Twemoji', 'Noto Color Emoji', 'Noto Sans Mono CJK SC'; }
.pdf:lang(zh-TW) .code { font-family: Source Code Pro, "SFMono-Regular", Menlo, Consolas, "PT Mono", "Liberation Mono", Courier, monospace, 'Twemoji', 'Noto Color Emoji', 'Noto Sans Mono CJK TC'; }
.pdf:lang(ko-KR) .code { font-family: Source Code Pro, "SFMono-Regular", Menlo, Consolas, "PT Mono", "Liberation Mono", Courier, monospace, 'Twemoji', 'Noto Color Emoji', 'Noto Sans Mono CJK KR'; }
.pdf .serif { font-family: PT Serif, Lyon-Text, Georgia, ui-serif, serif, 'Twemoji', 'Noto Color Emoji', 'Noto Serif CJK JP'; }
.pdf:lang(zh-CN) .serif { font-family: PT Serif, Lyon-Text, Georgia, ui-serif, serif, 'Twemoji', 'Noto Color Emoji', 'Noto Serif CJK SC'; }
.pdf:lang(zh-TW) .serif { font-family: PT Serif, Lyon-Text, Georgia, ui-serif, serif, 'Twemoji', 'Noto Color Emoji', 'Noto Serif CJK TC'; }
.pdf:lang(ko-KR) .serif { font-family: PT Serif, Lyon-Text, Georgia, ui-serif, serif, 'Twemoji', 'Noto Color Emoji', 'Noto Serif CJK KR'; }
.pdf .mono { font-family: PT Mono, iawriter-mono, Nitti, Menlo, Courier, monospace, 'Twemoji', 'Noto Color Emoji', 'Noto Sans Mono CJK JP'; }
.pdf:lang(zh-CN) .mono { font-family: PT Mono, iawriter-mono, Nitti, Menlo, Courier, monospace, 'Twemoji', 'Noto Color Emoji', 'Noto Sans Mono CJK SC'; }
.pdf:lang(zh-TW) .mono { font-family: PT Mono, iawriter-mono, Nitti, Menlo, Courier, monospace, 'Twemoji', 'Noto Color Emoji', 'Noto Sans Mono CJK TC'; }
.pdf:lang(ko-KR) .mono { font-family: PT Mono, iawriter-mono, Nitti, Menlo, Courier, monospace, 'Twemoji', 'Noto Color Emoji', 'Noto Sans Mono CJK KR'; }
.highlight-default {
color: rgba(55, 53, 47, 1);
}
.highlight-gray {
color: rgba(120, 119, 116, 1);
fill: rgba(120, 119, 116, 1);
}
.highlight-brown {
color: rgba(159, 107, 83, 1);
fill: rgba(159, 107, 83, 1);
}
.highlight-orange {
color: rgba(217, 115, 13, 1);
fill: rgba(217, 115, 13, 1);
}
.highlight-yellow {
color: rgba(203, 145, 47, 1);
fill: rgba(203, 145, 47, 1);
}
.highlight-teal {
color: rgba(68, 131, 97, 1);
fill: rgba(68, 131, 97, 1);
}
.highlight-blue {
color: rgba(51, 126, 169, 1);
fill: rgba(51, 126, 169, 1);
}
.highlight-purple {
color: rgba(144, 101, 176, 1);
fill: rgba(144, 101, 176, 1);
}
.highlight-pink {
color: rgba(193, 76, 138, 1);
fill: rgba(193, 76, 138, 1);
}
.highlight-red {
color: rgba(212, 76, 71, 1);
fill: rgba(212, 76, 71, 1);
}
.highlight-gray_background {
background: rgba(241, 241, 239, 1);
}
.highlight-brown_background {
background: rgba(244, 238, 238, 1);
}
.highlight-orange_background {
background: rgba(251, 236, 221, 1);
}
.highlight-yellow_background {
background: rgba(251, 243, 219, 1);
}
.highlight-teal_background {
background: rgba(237, 243, 236, 1);
}
.highlight-blue_background {
background: rgba(231, 243, 248, 1);
}
.highlight-purple_background {
background: rgba(244, 240, 247, 0.8);
}
.highlight-pink_background {
background: rgba(249, 238, 243, 0.8);
}
.highlight-red_background {
background: rgba(253, 235, 236, 1);
}
.block-color-default {
color: inherit;
fill: inherit;
}
.block-color-gray {
color: rgba(120, 119, 116, 1);
fill: rgba(120, 119, 116, 1);
}
.block-color-brown {
color: rgba(159, 107, 83, 1);
fill: rgba(159, 107, 83, 1);
}
.block-color-orange {
color: rgba(217, 115, 13, 1);
fill: rgba(217, 115, 13, 1);
}
.block-color-yellow {
color: rgba(203, 145, 47, 1);
fill: rgba(203, 145, 47, 1);
}
.block-color-teal {
color: rgba(68, 131, 97, 1);
fill: rgba(68, 131, 97, 1);
}
.block-color-blue {
color: rgba(51, 126, 169, 1);
fill: rgba(51, 126, 169, 1);
}
.block-color-purple {
color: rgba(144, 101, 176, 1);
fill: rgba(144, 101, 176, 1);
}
.block-color-pink {
color: rgba(193, 76, 138, 1);
fill: rgba(193, 76, 138, 1);
}
.block-color-red {
color: rgba(212, 76, 71, 1);
fill: rgba(212, 76, 71, 1);
}
.block-color-gray_background {
background: rgba(241, 241, 239, 1);
}
.block-color-brown_background {
background: rgba(244, 238, 238, 1);
}
.block-color-orange_background {
background: rgba(251, 236, 221, 1);
}
.block-color-yellow_background {
background: rgba(251, 243, 219, 1);
}
.block-color-teal_background {
background: rgba(237, 243, 236, 1);
}
.block-color-blue_background {
background: rgba(231, 243, 248, 1);
}
.block-color-purple_background {
background: rgba(244, 240, 247, 0.8);
}
.block-color-pink_background {
background: rgba(249, 238, 243, 0.8);
}
.block-color-red_background {
background: rgba(253, 235, 236, 1);
}
.select-value-color-pink { background-color: rgba(245, 224, 233, 1); }
.select-value-color-purple { background-color: rgba(232, 222, 238, 1); }
.select-value-color-green { background-color: rgba(219, 237, 219, 1); }
.select-value-color-gray { background-color: rgba(227, 226, 224, 1); }
.select-value-color-opaquegray { background-color: rgba(255, 255, 255, 0.0375); }
.select-value-color-orange { background-color: rgba(250, 222, 201, 1); }
.select-value-color-brown { background-color: rgba(238, 224, 218, 1); }
.select-value-color-red { background-color: rgba(255, 226, 221, 1); }
.select-value-color-yellow { background-color: rgba(253, 236, 200, 1); }
.select-value-color-blue { background-color: rgba(211, 229, 239, 1); }
.checkbox {
display: inline-flex;
vertical-align: text-bottom;
width: 16;
height: 16;
background-size: 16px;
margin-left: 2px;
margin-right: 5px;
}
.checkbox-on {
background-image: url("data:image/svg+xml;charset=UTF-8,%3Csvg%20width%3D%2216%22%20height%3D%2216%22%20viewBox%3D%220%200%2016%2016%22%20fill%3D%22none%22%20xmlns%3D%22http%3A%2F%2Fwww.w3.org%2F2000%2Fsvg%22%3E%0A%3Crect%20width%3D%2216%22%20height%3D%2216%22%20fill%3D%22%2358A9D7%22%2F%3E%0A%3Cpath%20d%3D%22M6.71429%2012.2852L14%204.9995L12.7143%203.71436L6.71429%209.71378L3.28571%206.2831L2%207.57092L6.71429%2012.2852Z%22%20fill%3D%22white%22%2F%3E%0A%3C%2Fsvg%3E");
}
.checkbox-off {
background-image: url("data:image/svg+xml;charset=UTF-8,%3Csvg%20width%3D%2216%22%20height%3D%2216%22%20viewBox%3D%220%200%2016%2016%22%20fill%3D%22none%22%20xmlns%3D%22http%3A%2F%2Fwww.w3.org%2F2000%2Fsvg%22%3E%0A%3Crect%20x%3D%220.75%22%20y%3D%220.75%22%20width%3D%2214.5%22%20height%3D%2214.5%22%20fill%3D%22white%22%20stroke%3D%22%2336352F%22%20stroke-width%3D%221.5%22%2F%3E%0A%3C%2Fsvg%3E");
}
</style></head><body><article id="1863113d-7210-45be-8080-02e3355fa9de" class="page sans"><header><div class="page-header-icon undefined"><img class="icon" src="sicp.webp"/></div><h1 class="page-title">Structure and Interpretation of Computer Programs</h1></header><div class="page-body"><hr id="a38f5ed4-3db1-407e-8365-02d4fc551657"/><figure class="block-color-gray_background callout" style="white-space:pre-wrap;display:flex" id="6e5777b9-a368-4cf7-818b-3d7238c22ff0"><div style="font-size:1.5em"><span class="icon">📖</span></div><div style="width:100%">This is intended to be a definitive resource on self-teaching the classic Computer Science book, <strong>Structure and Interpretation of Computer Programs</strong>, commonly SICP.
This page compiles lectures and readings from Berkeley’s series from 2011 (originally scattered throughout old course pages and dead links) to produce a clean path through the textbook that focuses on the content.</div></figure><hr id="79b45efd-5a0e-4df0-bb5b-26cd0385fd0a"/><nav id="aae495f4-38d8-4117-a334-7684af5d6918" class="block-color-gray table_of_contents"><div class="table_of_contents-item table_of_contents-indent-0"><a class="table_of_contents-link" href="#eb69dfef-7caf-4b63-9cac-cb67c2a1e33f">Prerequisites</a></div><div class="table_of_contents-item table_of_contents-indent-0"><a class="table_of_contents-link" href="#d7d61a7c-8d0e-4659-b0ea-21b194dba9dd">Course Introduction</a></div><div class="table_of_contents-item table_of_contents-indent-1"><a class="table_of_contents-link" href="#19fb20b2-3446-4d1e-868b-3b547e7e881d">What to expect (read before starting)</a></div><div class="table_of_contents-item table_of_contents-indent-2"><a class="table_of_contents-link" href="#8ae1ed34-be75-47cf-a207-10e78c5eaa80">Readings</a></div><div class="table_of_contents-item table_of_contents-indent-2"><a class="table_of_contents-link" href="#104009be-6c59-4ffe-88a4-ea5272b9593a">Homework</a></div><div class="table_of_contents-item table_of_contents-indent-2"><a class="table_of_contents-link" href="#719c8328-72df-425c-ae58-a49fe8142bdd">Lab sections</a></div><div class="table_of_contents-item table_of_contents-indent-2"><a class="table_of_contents-link" href="#1b4b0fed-27a1-4bc9-ae0e-1906c891d2a5">Lectures</a></div><div class="table_of_contents-item table_of_contents-indent-2"><a class="table_of_contents-link" href="#4118e116-608b-4889-947e-1343e3c46965">Projects</a></div><div class="table_of_contents-item table_of_contents-indent-2"><a class="table_of_contents-link" href="#54363ae3-6748-4067-a1cf-a7eb017d2917">Exams</a></div><div class="table_of_contents-item table_of_contents-indent-1"><a class="table_of_contents-link" href="#e682e189-1f90-4713-9dfe-35c92b7d1cdf">For completionists…</a></div><div class="table_of_contents-item table_of_contents-indent-0"><a class="table_of_contents-link" href="#635a8743-f0a5-4dac-b99a-b64171bae893">Get started</a></div><div class="table_of_contents-item table_of_contents-indent-1"><a class="table_of_contents-link" href="#bfbdeafa-dd21-4b89-9bfc-b220752f26e0">Download the materials</a></div><div class="table_of_contents-item table_of_contents-indent-0"><a class="table_of_contents-link" href="#f39297db-1f30-4919-ab64-2393523ff64e">Course calendar</a></div><div class="table_of_contents-item table_of_contents-indent-0"><a class="table_of_contents-link" href="#6a43aae8-0983-4373-b9e1-6768c6bfabc0">Credits</a></div></nav><h3 id="eb69dfef-7caf-4b63-9cac-cb67c2a1e33f" class="">Prerequisites</h3><p id="8bcbb62a-667d-438b-a23a-6eb57242a82d" class=""><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong>THIS IS A HARD BOOK. </strong></strong></strong></strong></strong></strong></strong></strong></strong></strong></strong></strong></strong></strong></strong></strong></strong></strong></strong></strong>Although the course allows for no former programming experience, approaching the course this way will make it needlessly difficult. Berkeley, in their version of the course recommends:<div class="indented"><ul id="6e45f5e1-4fda-4665-a661-cd3a8ba637da" class="bulleted-list"><li style="list-style-type:disc"><strong>Maths up to Single Variable Calculus</strong>: limits, functions, integration, differentiation.<ul id="b59a8081-8e01-4ec2-aeb4-aeeaa923c8ca" class="bulleted-list"><li style="list-style-type:circle">Optionally, <strong>Discrete Maths and proofs</strong> will be extremely helpful for the course’s harder exercises.</li></ul></li></ul><ul id="8e77fd42-78a1-4194-a393-f8b13b766769" class="bulleted-list"><li style="list-style-type:disc"><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong>Some programming experience: </strong></strong></strong></strong></strong></strong></strong></strong></strong></strong></strong></strong></strong></strong></strong></strong></strong></strong></strong></strong></strong></strong></strong></strong></strong></strong></strong></strong></strong>some confidence in using recursion is cited as a benchmark. If you’re in between comfort levels, we strongly recommend<strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong><strong> </strong></strong></strong></strong></strong></strong></strong></strong></strong></strong></strong></strong></strong></strong></strong></strong></strong></strong></strong>the twin courses How to Code: Simple Data and Complex Data as a precursor. </li></ul><figure id="a88ec086-accd-47d6-94eb-b2280ef00405"><a href="https://www.edx.org/course/how-to-code-simple-data" class="bookmark source"><div class="bookmark-info"><div class="bookmark-text"><div class="bookmark-title">How to Code: Simple Data</div><div class="bookmark-description">There is one session available: This programming course takes a unique approach, as it focuses on learning a systematic programming method rather than a programming language. This practical approach will help you channel your creativity so that you can program well in any language.</div></div><div class="bookmark-href"><img src="https://www.edx.org/favicon.ico" class="icon bookmark-icon"/>https://www.edx.org/course/how-to-code-simple-data</div></div><img src="https://prod-discovery.edx-cdn.org/media/course/image/895afa12-6162-420d-a522-9945ddf29011-fb7c4a5e516a.small.jpg" class="bookmark-image"/></a></figure></div></p><p id="41e9010f-67cb-42f9-80b7-57a21d54a5a3" class="">
</p><h1 id="d7d61a7c-8d0e-4659-b0ea-21b194dba9dd" class="">Course Introduction</h1><figure class="block-color-gray_background callout" style="white-space:pre-wrap;display:flex" id="861cf25e-c567-4973-a3e2-aab672b60fdc"><div style="font-size:1.5em"><span class="icon">⚠️</span></div><div style="width:100%">This page relates to the <strong><strong><strong><strong><strong><strong><strong>Scheme</strong></strong></strong></strong></strong></strong></strong> version of SICP, as opposed to newer versions that teach with JavaScript or Python. </div></figure><h2 id="19fb20b2-3446-4d1e-868b-3b547e7e881d" class="">What to expect (read before starting)</h2><p id="8603a3ff-8bb2-4bc8-8b27-b7390eb20454" class="">The course is split into 16 weeks. Materials given are in order (ie reading should precede homework should precede … etc.) Each week will have readings, homework, a lab section, and 2-3 lectures. Some intervals will have projects and midterm exams associated with them.</p><h3 id="8ae1ed34-be75-47cf-a207-10e78c5eaa80" class="">Readings</h3><p id="7c4a1fc1-69ed-4638-8fa7-26aced8c60f7" class="">These are usually taken from the SICP textbook. This resource will link to the corrected 2nd edition, available free online. The textbook contains exercises, see Homework below for details. Occasionally a non-SICP handout is given - these will be linked.</p><h3 id="104009be-6c59-4ffe-88a4-ea5272b9593a" class="">Homework</h3><p id="2b5fad4a-64b3-4402-8cc0-33b9cee44965" class="">From the lecturers:</p><blockquote id="4d398443-995e-4744-9cf3-974f11f25ce1" class="">Homework assignments consist mostly of exercises from the textbook; you’ll do
these whenever you can schedule time, either in the lab or at home. You may be accustomed to textbooks with huge numbers of boring, repetitive exercises. You won’t find that in our text! Each assigned exercise teaches an important point.</blockquote><p id="a6238e33-7ed5-40e6-8c8d-19ca725c2de5" class="">Because of the textbook’s popularity, answers for every SICP exercise can be easily found online through Google.</p><h3 id="719c8328-72df-425c-ae58-a49fe8142bdd" class="">Lab sections</h3><p id="c8e801cd-f9cc-472d-a11c-73a2700d88ec" class="">These are quick projects, usually intended to be completed in groups. A good opportunity for collaboration if you are going through these texts alongside somebody else!</p><h3 id="1b4b0fed-27a1-4bc9-ae0e-1906c891d2a5" class="">Lectures</h3><p id="6076a791-4187-472d-a1be-a03413295762" class="">Each week has 2 or 3 lectures associated with it. Given are lecture notes, the appropriate ones will be linked on the week’s page. Keep in mind this quote from the course creators:</p><blockquote id="55caae93-e855-4e8e-a196-e7fe42963de6" class="">The course reader includes my lecture notes. What this means is that you should be
able to devote your effort during lecture to thinking, rather than to frantic scribbling.</blockquote><p id="94e14c74-0a52-4792-b575-b9adda475eb4" class="">Programs from the lectures can be accessed in the cs61a/lib folder of the course materials (see below)</p><figure class="block-color-gray_background callout" style="white-space:pre-wrap;display:flex" id="9954ca8e-aead-4c50-9999-dedbf79698a4"><div style="font-size:1.5em"><span class="icon">💡</span></div><div style="width:100%">Don’t worry about the missing numbers in the lectures (there’s no lecture 15, or 27-29) - the lectures are not lost, but rather they correspond to half-terms and spring breaks.</div></figure><h3 id="4118e116-608b-4889-947e-1343e3c46965" class="">Projects</h3><p id="1fb270b8-84bf-49cb-b110-74d48d9b2d47" class="">These are larger projects for you to apply more of your skills, given every few weeks or so. Often these projects are intended for pairs.</p><h3 id="54363ae3-6748-4067-a1cf-a7eb017d2917" class="">Exams</h3><p id="2579a5f0-fcaa-4c96-bf82-3e3d86319edc" class="">There are three midterm exams and a final. For each, three sample papers (with answers) are given for each.</p><p id="ce9d1b9d-9da3-4d21-b972-ba8c308ddbff" class="">
</p><h2 id="e682e189-1f90-4713-9dfe-35c92b7d1cdf" class="">For completionists…</h2><p id="248fca5a-a87f-495e-8831-2c861da32325" class="">Not every chapter in SICP is covered in these lecture series (the last of the 5 segments is entirely dropped, for one). A full list of chapters skipped is given here:</p><figure id="49435e5e-117f-4645-a188-0cd183f4cbfa" class="link-to-page"><a href="missingchapters.html">List of chapters not covered</a></figure><p id="0baf83bf-9d3e-45f1-94be-e5e0b7a28ced" class="">
</p><p id="9ec06d92-c452-43c6-8ae1-bb8a914adaa9" class="">Every exercise is also, not necessarily assigned. But solutions for every one can be easily found online if you want to go ahead with them.</p><p id="cc9776f0-b02c-4214-a9d0-362a429780b4" class="">
</p><h1 id="635a8743-f0a5-4dac-b99a-b64171bae893" class="">Get started</h1><h2 id="bfbdeafa-dd21-4b89-9bfc-b220752f26e0" class="">Download the materials</h2><ul id="4b6084cf-1370-4965-b166-79583220112e" class="bulleted-list"><li style="list-style-type:disc">To get started, clone the course materials from the github repository <a href="https://github.com/romanbird/sicp">linked here</a>.</li></ul><ul id="9c46f9f6-e1bd-41b8-bff4-b27a4c790081" class="bulleted-list"><li style="list-style-type:disc">We use the online SICP given here, as created by sarabander</li></ul><figure id="9c1f5004-78d1-4c08-b5b8-0ac01aeaa996"><a href="https://sarabander.github.io/sicp/html/index.xhtml" class="bookmark source"><div class="bookmark-info"><div class="bookmark-text"><div class="bookmark-title">Structure and Interpretation of Computer Programs</div><div class="bookmark-description">Second Edition Unofficial Texinfo Format 2.andresraba6.6 Harold Abelson and Gerald Jay Sussman with Julie Sussman, foreword by Alan J. Perlis ©1996 by The Massachusetts Institute of Technology This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License (). Based on a work at mitpress.mit.edu.</div></div><div class="bookmark-href">https://sarabander.github.io/sicp/html/index.xhtml</div></div></a></figure><h1 id="f39297db-1f30-4919-ab64-2393523ff64e" class="">Course calendar</h1><table id="80bb8f39-1303-4dca-a640-d6e1ab6acba1" class="simple-table"><thead class="simple-table-header"><tr id="e1156eef-7514-46df-8a07-8a194cafc275"><th id="uklP" class="simple-table-header-color simple-table-header"><strong><strong><strong><strong>Week</strong></strong></strong></strong></th><th id="TxYf" class="simple-table-header-color simple-table-header" style="width:114px">Reading</th><th id="Ox=b" class="simple-table-header-color simple-table-header" style="width:110px">Homework</th><th id="_|?I" class="simple-table-header-color simple-table-header" style="width:96px">Lab</th><th id="Eaft" class="simple-table-header-color simple-table-header"></th></tr></thead><tbody><tr id="330fc198-16d9-4343-a5be-51422ecb5f61"><th id="uklP" class="simple-table-header-color simple-table-header">1</th><td id="TxYf" class="" style="width:114px">1.1</td><td id="Ox=b" class="" style="width:110px">☑️</td><td id="_|?I" class="" style="width:96px">☑️</td><td id="Eaft" class=""><a href="https://archive.org/details/ucberkeley_webcast_l28HAzKy0N8">Lecture 01: functional programming 1</a></td></tr><tr id="7cb11c47-1cca-445b-9376-a675c7e7f9fd"><th id="uklP" class="simple-table-header-color simple-table-header"></th><td id="TxYf" class="" style="width:114px"></td><td id="Ox=b" class="" style="width:110px"></td><td id="_|?I" class="" style="width:96px"></td><td id="Eaft" class=""><a href="https://archive.org/details/ucberkeley_webcast_TTK2lZoWbPQ">Lecture 02: functional programming 2</a></td></tr><tr id="1e2fa3ab-42a9-4ac7-8b61-454fb735a70c"><th id="uklP" class="simple-table-header-color simple-table-header">2</th><td id="TxYf" class="" style="width:114px">1.3</td><td id="Ox=b" class="" style="width:110px">☑️</td><td id="_|?I" class="" style="width:96px">☑️</td><td id="Eaft" class=""><a href="https://archive.org/details/ucberkeley_webcast_ogIGxEzvnSE">Lecture 03: higher-order procedures 1</a></td></tr><tr id="758a2b3e-4c2a-423b-a08e-088667516734"><th id="uklP" class="simple-table-header-color simple-table-header"></th><td id="TxYf" class="" style="width:114px"></td><td id="Ox=b" class="" style="width:110px"></td><td id="_|?I" class="" style="width:96px"></td><td id="Eaft" class=""><a href="https://archive.org/details/ucberkeley_webcast_ZvH3wF2qg7Q">Lecture 04: higher-order procedures 2</a></td></tr><tr id="82ea5782-3c67-4f6e-8e6f-07debdfc6c61"><th id="uklP" class="simple-table-header-color simple-table-header">3</th><td id="TxYf" class="" style="width:114px">1.2.1-4</td><td id="Ox=b" class="" style="width:110px">☑️</td><td id="_|?I" class="" style="width:96px">☑️</td><td id="Eaft" class=""><a href="https://archive.org/details/ucberkeley_webcast_dC4YGxzoAXk">Lecture 05: user interface -Alan Kay-</a></td></tr><tr id="1e9f47a6-59ba-492d-86ec-fe4276b4e3af"><th id="uklP" class="simple-table-header-color simple-table-header"></th><td id="TxYf" class="" style="width:114px"></td><td id="Ox=b" class="" style="width:110px"></td><td id="_|?I" class="" style="width:96px"></td><td id="Eaft" class=""><a href="https://archive.org/details/ucberkeley_webcast_qxDGE1-S_LE">Lecture 06: user interface -Alan Kay-</a></td></tr><tr id="62988445-8089-483c-8a81-3cafd8d64d56"><th id="uklP" class="simple-table-header-color simple-table-header"></th><td id="TxYf" class="" style="width:114px"></td><td id="Ox=b" class="" style="width:110px"></td><td id="_|?I" class="" style="width:96px"></td><td id="Eaft" class=""><a href="https://archive.org/details/ucberkeley_webcast_32L5j10rrK0">Lecture 07: orders of growth</a></td></tr><tr id="db59be95-66a9-442f-a97c-120daa653b94"><th id="uklP" class="simple-table-header-color simple-table-header"></th><td id="TxYf" class="" style="width:114px"></td><td id="Ox=b" class="" style="width:110px"></td><td id="_|?I" class="" style="width:96px"></td><td id="Eaft" class=""><a href="https://archive.org/details/ucberkeley_webcast_0G3tNuBBO5I">Lecture 08: recursion and iteration</a></td></tr><tr id="e3586c8f-adb7-47d4-9a80-604398319920"><th id="uklP" class="block-color-gray_background simple-table-header">Project 1</th><td id="TxYf" class="block-color-gray_background" style="width:114px"></td><td id="Ox=b" class="block-color-gray_background" style="width:110px"></td><td id="_|?I" class="block-color-gray_background" style="width:96px"></td><td id="Eaft" class="block-color-gray_background"></td></tr><tr id="139f8fe3-088f-47c3-8465-eda758a8327b"><th id="uklP" class="simple-table-header-color simple-table-header">4</th><td id="TxYf" class="" style="width:114px">2.1, 2.2.1</td><td id="Ox=b" class="" style="width:110px">☑️</td><td id="_|?I" class="" style="width:96px">☑️</td><td id="Eaft" class=""><a href="https://archive.org/details/ucberkeley_webcast_Oy36XpGVyjA">Lecture 09: data abstraction</a></td></tr><tr id="d17c1e1c-6182-4c5b-bef2-fc090e143960"><th id="uklP" class="simple-table-header-color simple-table-header"></th><td id="TxYf" class="" style="width:114px"></td><td id="Ox=b" class="" style="width:110px"></td><td id="_|?I" class="" style="width:96px"></td><td id="Eaft" class=""><a href="https://archive.org/details/ucberkeley_webcast__qGeRWplPgc">Lecture 10: sequences</a></td></tr><tr id="2ecce3f7-f1af-4289-8ca0-7d9a4d66d57a"><th id="uklP" class="simple-table-header-color simple-table-header"></th><td id="TxYf" class="" style="width:114px"></td><td id="Ox=b" class="" style="width:110px"></td><td id="_|?I" class="" style="width:96px"></td><td id="Eaft" class=""><a href="https://archive.org/details/ucberkeley_webcast_nzMPF59Ackg">Lecture 11: Example: calculator</a></td></tr><tr id="4466cdf4-b809-4a3d-9582-1ae054e2f359"><th id="uklP" class="block-color-gray_background simple-table-header">Midterm 1</th><td id="TxYf" class="block-color-gray_background" style="width:114px"></td><td id="Ox=b" class="block-color-gray_background" style="width:110px"></td><td id="_|?I" class="block-color-gray_background" style="width:96px"></td><td id="Eaft" class="block-color-gray_background"></td></tr><tr id="f1ed1cb5-488a-4cd8-bd08-4bfb2516f934"><th id="uklP" class="simple-table-header-color simple-table-header">5</th><td id="TxYf" class="" style="width:114px">2.2.2-3, 2.3.1-3</td><td id="Ox=b" class="" style="width:110px">☑️</td><td id="_|?I" class="" style="width:96px">☑️</td><td id="Eaft" class=""><a href="https://archive.org/details/ucberkeley_webcast_pSuEz5ZCVAg">Lecture 12: hierarchical data</a></td></tr><tr id="63c41567-e72a-48aa-9650-7030abd0087d"><th id="uklP" class="simple-table-header-color simple-table-header"></th><td id="TxYf" class="" style="width:114px"></td><td id="Ox=b" class="" style="width:110px"></td><td id="_|?I" class="" style="width:96px"></td><td id="Eaft" class=""><a href="https://archive.org/details/ucberkeley_webcast_kbqJ3UGPgOc">Lecture 13: hierarchical data</a></td></tr><tr id="eb77cbef-2b3b-4a98-a052-0281a75c0226"><th id="uklP" class="simple-table-header-color simple-table-header"></th><td id="TxYf" class="" style="width:114px"></td><td id="Ox=b" class="" style="width:110px"></td><td id="_|?I" class="" style="width:96px"></td><td id="Eaft" class=""><a href="https://archive.org/details/ucberkeley_webcast_3FjDrWv00Hc">Lecture 14: Example: Scheme-1 interpr</a></td></tr><tr id="006f9f9e-206d-4378-ad78-86e12f1e21a1"><th id="uklP" class="block-color-gray_background simple-table-header">Project 2</th><td id="TxYf" class="block-color-gray_background" style="width:114px"></td><td id="Ox=b" class="block-color-gray_background" style="width:110px"></td><td id="_|?I" class="block-color-gray_background" style="width:96px"></td><td id="Eaft" class="block-color-gray_background"></td></tr><tr id="48a7975f-879d-4a59-bcb7-891ca906b7c7"><th id="uklP" class="block-color-gray_background simple-table-header">BREAK</th><td id="TxYf" class="block-color-gray_background" style="width:114px"></td><td id="Ox=b" class="block-color-gray_background" style="width:110px"></td><td id="_|?I" class="block-color-gray_background" style="width:96px"></td><td id="Eaft" class="block-color-gray_background">Lecture 15 is not given due to a half-term</td></tr><tr id="2c4b7405-9bb6-4175-8b5d-4dcf6ef984b4"><th id="uklP" class="simple-table-header-color simple-table-header">6</th><td id="TxYf" class="" style="width:114px">2.4-2.5.2</td><td id="Ox=b" class="" style="width:110px">☑️</td><td id="_|?I" class="" style="width:96px">☑️</td><td id="Eaft" class=""><a href="https://archive.org/details/ucberkeley_webcast_rz_XpDhDtFI">Lecture 16: generic operators</a></td></tr><tr id="23f56c5b-f64a-45ef-b756-50ac62cce247"><th id="uklP" class="simple-table-header-color simple-table-header"></th><td id="TxYf" class="" style="width:114px"></td><td id="Ox=b" class="" style="width:110px"></td><td id="_|?I" class="" style="width:96px"></td><td id="Eaft" class=""><a href="https://archive.org/details/ucberkeley_webcast_8HDIqZ2ZqKI">Lecture 17: generic operators</a></td></tr><tr id="be0968b0-7d05-446d-a1ed-45ec3ee073bc"><th id="uklP" class="simple-table-header-color simple-table-header">7</th><td id="TxYf" class="" style="width:114px">oop_aboveline.pdf (given)</td><td id="Ox=b" class="" style="width:110px">☑️</td><td id="_|?I" class="" style="width:96px">☑️</td><td id="Eaft" class=""><a href="https://archive.org/details/ucberkeley_webcast_jq1v8YUftxE">Lecture 18: object-oriented programmi</a></td></tr><tr id="8fafa381-c73c-49a7-bb54-f7df83e8c4cb"><th id="uklP" class="simple-table-header-color simple-table-header"></th><td id="TxYf" class="" style="width:114px"></td><td id="Ox=b" class="" style="width:110px"></td><td id="_|?I" class="" style="width:96px"></td><td id="Eaft" class=""><a href="https://archive.org/details/ucberkeley_webcast_S9mGKy3Dzqw">Lecture 19: object oriented programm</a></td></tr><tr id="2c4695b1-d78e-4b57-a566-0be9415b03d7"><th id="uklP" class="simple-table-header-color simple-table-header"></th><td id="TxYf" class="" style="width:114px"></td><td id="Ox=b" class="" style="width:110px"></td><td id="_|?I" class="" style="width:96px"></td><td id="Eaft" class=""><a href="https://archive.org/details/ucberkeley_webcast_AYoW8-L2dTQ">Lecture 20: object-oriented programmi</a></td></tr><tr id="57ea0fef-a7b8-4ac5-9c2d-ca3aa65811e3"><th id="uklP" class="block-color-gray_background simple-table-header">Midterm 2</th><td id="TxYf" class="block-color-gray_background" style="width:114px"></td><td id="Ox=b" class="block-color-gray_background" style="width:110px"></td><td id="_|?I" class="block-color-gray_background" style="width:96px"></td><td id="Eaft" class="block-color-gray_background"></td></tr><tr id="bd5e828e-6398-48ec-96cf-aac093401fd6"><th id="uklP" class="simple-table-header-color simple-table-header">8</th><td id="TxYf" class="" style="width:114px">3.1, 3.2, oop_belowline.pdf (given)</td><td id="Ox=b" class="" style="width:110px">☑️</td><td id="_|?I" class="" style="width:96px">☑️</td><td id="Eaft" class=""><a href="https://archive.org/details/ucberkeley_webcast_crlcqL7lKME">Lecture 21: assignment and state</a></td></tr><tr id="f3753519-65ab-40b8-ac51-68f1efe718fb"><th id="uklP" class="simple-table-header-color simple-table-header"></th><td id="TxYf" class="" style="width:114px"></td><td id="Ox=b" class="" style="width:110px"></td><td id="_|?I" class="" style="width:96px"></td><td id="Eaft" class=""><a href="https://archive.org/details/ucberkeley_webcast_uxvRoOV9nOk">Lecture 22: environments</a></td></tr><tr id="e689d4de-7894-44a7-bec2-13a4afa930a9"><th id="uklP" class="simple-table-header-color simple-table-header"></th><td id="TxYf" class="" style="width:114px"></td><td id="Ox=b" class="" style="width:110px"></td><td id="_|?I" class="" style="width:96px"></td><td id="Eaft" class=""><a href="https://archive.org/details/ucberkeley_webcast_jmDguUbxOns">Lecture 23: environments</a></td></tr><tr id="2576b6c9-8a73-49a5-bc00-4ef25cef0979"><th id="uklP" class="block-color-gray_background simple-table-header">Project 3 (a)</th><td id="TxYf" class="block-color-gray_background" style="width:114px"></td><td id="Ox=b" class="block-color-gray_background" style="width:110px"></td><td id="_|?I" class="block-color-gray_background" style="width:96px"></td><td id="Eaft" class="block-color-gray_background"></td></tr><tr id="ddfca1d4-2d55-4d3f-97c4-4793075a64b5"><th id="uklP" class="simple-table-header-color simple-table-header">9</th><td id="TxYf" class="" style="width:114px">3.3.1-3</td><td id="Ox=b" class="" style="width:110px">☑️</td><td id="_|?I" class="" style="width:96px">☑️</td><td id="Eaft" class=""><a href="https://archive.org/details/ucberkeley_webcast_OCocDioUZOo">Lecture 24: mutable data</a></td></tr><tr id="ed61e85a-3999-4b7a-88df-2d000e8fd55c"><th id="uklP" class="simple-table-header-color simple-table-header"></th><td id="TxYf" class="" style="width:114px"></td><td id="Ox=b" class="" style="width:110px"></td><td id="_|?I" class="" style="width:96px"></td><td id="Eaft" class=""><a href="https://archive.org/details/ucberkeley_webcast_YgUZP1YbHsM">Lecture 25: mutable data</a></td></tr><tr id="67285a2e-aa9d-4efc-8ea1-0eda22a730b6"><th id="uklP" class="simple-table-header-color simple-table-header"></th><td id="TxYf" class="" style="width:114px"></td><td id="Ox=b" class="" style="width:110px"></td><td id="_|?I" class="" style="width:96px"></td><td id="Eaft" class=""><a href="https://archive.org/details/ucberkeley_webcast_vV7gargdGxU">Lecture 26: vectors</a></td></tr><tr id="b6f02055-ea60-448c-bb08-cb0f9c437f9f"><th id="uklP" class="block-color-gray_background simple-table-header">Project 3(b)</th><td id="TxYf" class="block-color-gray_background" style="width:114px"></td><td id="Ox=b" class="block-color-gray_background" style="width:110px"></td><td id="_|?I" class="block-color-gray_background" style="width:96px"></td><td id="Eaft" class="block-color-gray_background"></td></tr><tr id="233a17a2-3038-40c2-8b37-252bbb1e9484"><th id="uklP" class="block-color-gray_background simple-table-header">BREAK</th><td id="TxYf" class="block-color-gray_background" style="width:114px"></td><td id="Ox=b" class="block-color-gray_background" style="width:110px"></td><td id="_|?I" class="block-color-gray_background" style="width:96px"></td><td id="Eaft" class="block-color-gray_background">Lecture 27-29 is not given due to spring break</td></tr><tr id="a33e7413-588d-497f-81ad-4cd45332d316"><th id="uklP" class="simple-table-header-color simple-table-header">10</th><td id="TxYf" class="" style="width:114px">3.4</td><td id="Ox=b" class="" style="width:110px">☑️</td><td id="_|?I" class="" style="width:96px">☑️</td><td id="Eaft" class=""><a href="https://archive.org/details/ucberkeley_webcast_Lr4zVJPpMrM">Lecture 30: client-server programming</a></td></tr><tr id="6b7332c6-b729-44b3-a329-a6efce9ed530"><th id="uklP" class="simple-table-header-color simple-table-header"></th><td id="TxYf" class="" style="width:114px"></td><td id="Ox=b" class="" style="width:110px"></td><td id="_|?I" class="" style="width:96px"></td><td id="Eaft" class=""><a href="https://archive.org/details/ucberkeley_webcast_tfTD0B8dX7I">Lecture 31: concurrency</a></td></tr><tr id="1ba2e6bd-0ffb-4c12-9c0d-1976fb62d4bc"><th id="uklP" class="simple-table-header-color simple-table-header"></th><td id="TxYf" class="" style="width:114px"></td><td id="Ox=b" class="" style="width:110px"></td><td id="_|?I" class="" style="width:96px"></td><td id="Eaft" class=""><a href="https://archive.org/details/ucberkeley_webcast_a_qhlzmXqAo">Lecture 32: concurrency</a></td></tr><tr id="57bb1fdc-db1e-4ba0-b5aa-d89aa0045fdb"><th id="uklP" class="simple-table-header-color simple-table-header">11</th><td id="TxYf" class="" style="width:114px">3.5.1-3, 3.5.5, therac25.pdf (given)</td><td id="Ox=b" class="" style="width:110px">☑️</td><td id="_|?I" class="" style="width:96px">☑️</td><td id="Eaft" class=""><a href="https://archive.org/details/ucberkeley_webcast_LLl89UwSflo">Lecture 33: streams</a></td></tr><tr id="c1e0f2d5-9f48-4e1c-8469-14778d612a75"><th id="uklP" class="simple-table-header-color simple-table-header"></th><td id="TxYf" class="" style="width:114px"></td><td id="Ox=b" class="" style="width:110px"></td><td id="_|?I" class="" style="width:96px"></td><td id="Eaft" class=""><a href="https://archive.org/details/ucberkeley_webcast_mtl0z0HgRTM">Lecture 34: streams</a></td></tr><tr id="c5c37911-8308-4423-bd1e-ada60b05d426"><th id="uklP" class="simple-table-header-color simple-table-header"></th><td id="TxYf" class="" style="width:114px"></td><td id="Ox=b" class="" style="width:110px"></td><td id="_|?I" class="" style="width:96px"></td><td id="Eaft" class=""><a href="https://archive.org/details/ucberkeley_webcast_nxX-aAvZbmM">Lecture 35: Therac-25</a></td></tr><tr id="0ec745a7-5771-4449-915d-58c8889d0459"><th id="uklP" class="block-color-gray_background simple-table-header">Midterm 3</th><td id="TxYf" class="block-color-gray_background" style="width:114px"></td><td id="Ox=b" class="block-color-gray_background" style="width:110px"></td><td id="_|?I" class="block-color-gray_background" style="width:96px"></td><td id="Eaft" class="block-color-gray_background"></td></tr><tr id="e069a718-e699-4ed0-9df9-c8e8e4d1c785"><th id="uklP" class="simple-table-header-color simple-table-header">12</th><td id="TxYf" class="" style="width:114px">4.1, mapreduce.pdf (given)</td><td id="Ox=b" class="" style="width:110px">☑️</td><td id="_|?I" class="" style="width:96px">☑️</td><td id="Eaft" class=""><a href="https://archive.org/details/ucberkeley_webcast_E8ZyYL1qWWY">Lecture 36: metacircular evaluator -</a></td></tr><tr id="1b97ca3c-0728-4ff0-bddf-8161de5ed949"><th id="uklP" class="simple-table-header-color simple-table-header"></th><td id="TxYf" class="" style="width:114px"></td><td id="Ox=b" class="" style="width:110px"></td><td id="_|?I" class="" style="width:96px"></td><td id="Eaft" class=""><a href="https://archive.org/details/ucberkeley_webcast_0SbpbHiyyEU">Lecture 37: metacircular evaluator -</a></td></tr><tr id="7ec549f8-8c9d-4754-acf8-0d6a7963441f"><th id="uklP" class="simple-table-header-color simple-table-header"></th><td id="TxYf" class="" style="width:114px"></td><td id="Ox=b" class="" style="width:110px"></td><td id="_|?I" class="" style="width:96px"></td><td id="Eaft" class=""><a href="https://archive.org/details/ucberkeley_webcast_OVbHFr6SG_8">Lecture 38: mapreduce</a></td></tr><tr id="38367efa-c134-4398-8b87-a74bdf5c6922"><th id="uklP" class="simple-table-header-color simple-table-header"></th><td id="TxYf" class="" style="width:114px"></td><td id="Ox=b" class="" style="width:110px"></td><td id="_|?I" class="" style="width:96px"></td><td id="Eaft" class=""><a href="https://archive.org/details/ucberkeley_webcast_tlABAGE-Tvc">Lecture 39: mapreduce</a></td></tr><tr id="35e4ad59-55a3-4d03-900e-0e612f090759"><th id="uklP" class="simple-table-header-color simple-table-header">13</th><td id="TxYf" class="" style="width:114px">See homework</td><td id="Ox=b" class="" style="width:110px">☑️</td><td id="_|?I" class="" style="width:96px">☑️</td><td id="Eaft" class=""><a href="https://archive.org/details/ucberkeley_webcast_S9VoxtdsRyA">Lecture 40: analyzing evaluator</a></td></tr><tr id="d1cb2d10-9c5d-4034-a1b0-c39623efaf3a"><th id="uklP" class="simple-table-header-color simple-table-header">14</th><td id="TxYf" class="" style="width:114px">4.2,4.3</td><td id="Ox=b" class="" style="width:110px">☑️</td><td id="_|?I" class="" style="width:96px">☑️</td><td id="Eaft" class=""><a href="https://archive.org/details/ucberkeley_webcast_WJsgTZsFE3M">Lecture 41: lazy evaluator</a></td></tr><tr id="299d4508-5247-49b7-989d-4ca67e0528de"><th id="uklP" class="block-color-gray_background simple-table-header">Project 4a</th><td id="TxYf" class="block-color-gray_background" style="width:114px"></td><td id="Ox=b" class="block-color-gray_background" style="width:110px"></td><td id="_|?I" class="block-color-gray_background" style="width:96px"></td><td id="Eaft" class="block-color-gray_background"></td></tr><tr id="274e5b65-59e1-422b-a421-a798d247dc41"><th id="uklP" class="simple-table-header-color simple-table-header">15</th><td id="TxYf" class="" style="width:114px">4.4.1-3</td><td id="Ox=b" class="" style="width:110px">☑️</td><td id="_|?I" class="" style="width:96px">☑️</td><td id="Eaft" class=""><a href="https://archive.org/details/ucberkeley_webcast_JIMS_mspmug">Lecture 42: logic programming</a></td></tr><tr id="627db0bc-11ca-4bb1-82dc-f57f524dad3d"><th id="uklP" class="simple-table-header-color simple-table-header"></th><td id="TxYf" class="" style="width:114px"></td><td id="Ox=b" class="" style="width:110px"></td><td id="_|?I" class="" style="width:96px"></td><td id="Eaft" class=""><a href="https://archive.org/details/ucberkeley_webcast_i5XtLVwTcZY">Lecture 43: logic programming</a></td></tr><tr id="b1e979e5-e5b0-4915-8fd5-308cd4e20537"><th id="uklP" class="block-color-gray_background simple-table-header">Project 4b</th><td id="TxYf" class="block-color-gray_background" style="width:114px"></td><td id="Ox=b" class="block-color-gray_background" style="width:110px"></td><td id="_|?I" class="block-color-gray_background" style="width:96px"></td><td id="Eaft" class="block-color-gray_background"></td></tr><tr id="5b54cecc-d060-4d2a-9359-e71ac04916bd"><th id="uklP" class="simple-table-header-color simple-table-header">16</th><td id="TxYf" class="" style="width:114px">n/a</td><td id="Ox=b" class="" style="width:110px">n/a</td><td id="_|?I" class="" style="width:96px">n/a</td><td id="Eaft" class=""><a href="https://archive.org/details/ucberkeley_webcast_zWiQru4tn-o">Lecture 44: Review</a></td></tr><tr id="2f527201-8658-4b07-b291-20cdd7101acf"><th id="uklP" class="block-color-gray_background simple-table-header">Final exam</th><td id="TxYf" class="block-color-gray_background" style="width:114px"></td><td id="Ox=b" class="block-color-gray_background" style="width:110px"></td><td id="_|?I" class="block-color-gray_background" style="width:96px"></td><td id="Eaft" class="block-color-gray_background"></td></tr></tbody></table><h1 id="6a43aae8-0983-4373-b9e1-6768c6bfabc0" class="">Credits</h1><p id="60ff7404-814e-44eb-b1f8-7f24e2ccd059" class="">Structure and Interpretation of Computer Programs<div class="indented"><p id="86ee0b73-af97-40e2-ab21-1f4eee8c802b" class="">Harold Abelson and Gerald Jay Sussman with Julie Sussman, foreword by Alan J. Perlis
(c) 1996 by The Massachusetts Institute of Technology</p></div></p><p id="060e7190-d658-48f7-ad70-9caa2d851c08" class="">Lecture materials made generously available online by Brain Harvey and the University of California, Berkeley.</p><p id="50460fb4-1599-4e99-8976-50fe267459cd" class="">This resource compiles those already freely available and claims no ownership.</p></div></article></body></html>