You are on page 1of 12

1hls ls CSS0.

narvard Un|vers|ty lall 2012


0 < 12
Sy||abus
verslon 7


Instructor

uavld !. Malan '99
malan@harvard.edu
http://cs.harvard.edu/malan


Descr|pt|on

lnLroducLlon Lo Lhe lnLellecLual enLerprlses of compuLer sclence and Lhe arL of programmlng. 1hls
course Leaches sLudenLs how Lo Lhlnk algorlLhmlcally and solve problems efflclenLly. 1oplcs lnclude
absLracLlon, algorlLhms, daLa sLrucLures, encapsulaLlon, resource managemenL, securlLy, sofLware
englneerlng, and web developmenL. Languages lnclude C, P, and !avaScrlpL plus SCL, CSS, and P1ML.
roblem seLs lnsplred by real-world domalns of blology, crypLography, flnance, forenslcs, and gamlng.
ueslgned for concenLraLors and non-concenLraLors allke, wlLh or wlLhouL prlor programmlng experlence.

1hls course may be Laken ass/lall or for a leLLer grade. When Laken for a leLLer grade, Lhls course
meeLs Lhe Ceneral LducaLlon requlremenL for Lmplrlcal and MaLhemaLlcal 8easonlng.














1hls ls CSS0.
narvard Un|vers|ty lall 2012
1 < 12
Lxpectat|ons

?ou are expecLed Lo aLLend or waLch all lecLures and secLlons, submlL elghL problem seLs, Lake Lwo
qulzzes, and submlL a flnal pro[ecL.


Grades

1hls course may be Laken ass/lall or for a leLLer grade. ?ou may change from ass/lall Lo a leLLer grade
or vlce versa up unLll Lhe flfLh Monday of Lhe Lerm, per Lhe Pandbook for SLudenLs. 1he grade of ass
represenLs leLLer grades of A Lo u-.

All sLudenLs, wheLher Laklng Lhe course ass/lall or for a leLLer grade, musL ordlnarlly submlL all elghL
problem seLs, Lake boLh qulzzes, and submlL a flnal pro[ecL ln order Lo be ellglble for a passlng grade
(l.e., ass or A Lo u-) unless granLed an excepLlon ln wrlLlng by Lhe course's lnsLrucLor or precepLor.

8eallze LhaL some concenLraLlons (e.q., Applled MaLhemaLlcs, CompuLer Sclence, Lnglneerlng
Sclences, eL al.) do noL allow courses Laken ass/lall Lo saLlsfy concenLraLlon requlremenLs. nor do
courses Laken ass/lall saLlsfy Ceneral LducaLlon requlremenLs. 1ake care Lo reglsLer for a leLLer grade
or Lo change from ass/lall Lo a leLLer grade by Lhe flfLh Monday of Lhe Lerm lf you musL do so Lo meeL
some requlremenL.

llnal grades are deLermlned prlmarlly uslng Lhe followlng welghLs:

roblem SeLs: 30
Culzzes: 40
llnal ro[ecL: 10

roblem seLs and Lhe flnal pro[ecL are evaluaLed prlmarlly along axes of scope, correcLness, deslgn, and
sLyle, wlLh grades ordlnarlly deLermlned by scope ! (3 ! correcLness + 2 ! deslgn + 1 ! sLyle). Scores are
normallzed across 1ls aL Lerm's end, so mld-semesLer comparlsons among sLudenLs of scores are noL
rellable lndlcaLors of sLandlng.

AlLhough you musL submlL all elghL problem seLs, your lowesL score among Lhose problem seLs on whlch
you recelved perfecL scores for Lhe axls of scope wlll be dropped when flnal grades are deLermlned.

know LhaL CS30 draws qulLe Lhe specLrum of sLudenLs, lncludlng "Lhose less comforLable," "Lhose more
comforLable," and Lhose somewhere ln beLween. Powever, whaL ulLlmaLely maLLers ln Lhls course ls noL
so much where you end up relaLlve Lo your classmaLes buL where you, ln Week 11, end up relaLlve Lo
yourself ln Week 0.

1he course ls noL graded on a curve. 1he course does noL have pre-deLermlned cuLoffs for flnal grades.
1hose less comforLable and somewhere ln beLween are noL aL a dlsadvanLage vls-a-vls Lhose more
comforLable. Lach sLudenL's flnal grade ls lndlvldually deLermlned aL Lerm's end afLer lnpuL from Lhe
Leachlng fellows. 8emarkable efforL and upward Lrendlng do noL go unnoLlced.
1hls ls CSS0.
narvard Un|vers|ty lall 2012
2 < 12
8ooks

no books are requlred for Lhls course. Powever, you may wanL Lo supplemenL your preparaLlon for or
revlew of some lecLures wlLh self-asslgned readlngs relevanL Lo Lhose lecLures' conLenL from elLher of
Lhe books below. 1he flrsL ls lnLended for Lhose lnexperlenced ln (or less comforLable wlLh Lhe ldea of)
programmlng. 1he second ls lnLended for Lhose experlenced ln (or more comforLable wlLh Lhe ldea of)
programmlng. 8oLh are avallable onllne for free vla ln auLhenLlcaLlon.
*
8oLh are avallable for purchase
aL Lhe Coop and aL slLes llke Amazon.com. 8oLh have been placed on reserve aL CaboL Sclence Llbrary.
8eallze LhaL free, lf noL superlor, resources can be found on Lhe course's webslLe.

Ior 1hose Less Comfortab|e

Absolote 8eqlooet's ColJe to c, Second LdlLlon
Creg erry
Sams ubllshlng, 1994
http://nrs.harvard.edu/urn-3:hul.ebookbatch.SAFAR_batch:9780131388185
lS8n 0-672-30310-0

Ior 1hose More Comfortab|e

ltoqtommloq lo c, 1hlrd LdlLlon
SLephen kochan
Sams ubllshlng, 2004
http://nrs.harvard.edu/urn-3:hul.ebookbatch.SAFAR_batch:9780768689068
lS8n 0-672-32666-3

1he book below ls recommended for Lhose lnLeresLed ln undersLandlng how Lhelr own compuLers work
for personal edlflcaLlon. lL ls noL avallable onllne for free vla ln. 8uL lL ls avallable for purchase aL Lhe
Coop and aL slLes llke Amazon.com. And lL, Loo, has been placed on reserve.

now compotets wotk, nlnLh LdlLlon
8on WhlLe
Cue ubllshlng, 2007
lS8n 0-7897-3613-6

1hls lasL book below ls recommended for asplrlng hackers, Lhose lnLeresLed ln programmlng Lrlcks and
low-level opLlmlzaLlon of code for appllcaLlons beyond Lhe scope of Lhls course. lL ls avallable onllne for
free vla ln auLhenLlcaLlon.
*
lL ls also avallable for purchase aL Lhe Coop and aL slLes llke Amazon.com.
And lL, Loo, has been placed on reserve.

nocket's uellqbt
Penry S. Warren !r.
Addlson-Wesley, 2003
http://nrs.harvard.edu/urn-3:hul.ebookbatch.SAFAR_batch:0201914654
lS8n 0-201-91463-4

*
!usL reallze LhaL Parvard only has a few concurrenL llcenses, so only a few sLudenLs can access a book aL Lhe same Llme.
1hls ls CSS0.
narvard Un|vers|ty lall 2012
3 < 12
Webs|te

1he address of Lhls course's webslLe ls:

https://www.cs50.net/

vlslL Lhe course's webslLe Lo waLch vldeos, Lo geL help, Lo download handouLs and sofLware, and Lo
follow llnks Lo oLher resources.


Lectures

LecLures ordlnarlly Lake place ln Sanders 1heaLre on Mondays and Wednesdays from 1:00pm unLll
2:30pm.
1


Lach lecLure ls fllmed and made avallable wlLhln 24 hours ln sLreamlng and downloadable formaLs
(M3 and M4). Cnce posLed, Lhese recordlngs remaln avallable unLll semesLer's end. ?ou are welcome
Lo waLch or llsLen Lo a recordlng lf you are unable Lo aLLend some lecLure ln person. ?ou are encouraged
Lo waLch or llsLen Lo Lhese recordlngs for Lhe sake of revlew.

A schedule of lecLures, sub[ecL Lo change, appears below.

Week 0
Wed 9/3, lrl 9/7

lnLroducLlon. 8lLs. 8lnary. ASCll. rogrammlng. AlgorlLhms. SLaLemenLs. 8oolean
expresslons. CondlLlons. Loops. varlables. 1hreads. LvenLs.

Week 1
Mon 9/10, Wed 9/12

C. Source code. Compllers. Cb[ecL code. luncLlons. CommenLs. SLandard ouLpuL.
ArlLhmeLlc operaLors. recedence. Local varlables. 1ypes. CasLlng. SLandard lnpuL.
Llbrarles. 8oolean expresslons, conLlnued. CondlLlons, conLlnued. Loops, conLlnued.

Week 2
Mon 9/17, Wed 9/19

luncLlons, conLlnued. Clobal varlables. arameLers. 8eLurn values. SLack. lrames. Scope.
Arrays. SLrlngs. Command-llne argumenLs. CrypLography.


1
1hls course wlll also meeL on lrl 9/7 and lrl 10/12. SLudenLs wlLh confllcLs may waLch Lhose lecLures onllne.
1hls ls CSS0.
narvard Un|vers|ty lall 2012
4 < 12
Week 3
Mon 9/24, Wed 9/26

Llnear search. 8lnary search. AsympLoLlc noLaLlon. 8ubble sorL. SelecLlon sorL. Merge sorL.

Week 4
Mon 10/1, Wed 10/3

8ecurslon. uebugglng. llle l/C. SLrucLures. olnLers. uynamlc memory allocaLlon. Peap.

Week S
Wed 10/10, lrl 10/12

Oolz 0 oo weJ 10/10.

CS30 Llbrary. olnLers, conLlnued. lorenslcs.

Week 6
Mon 10/13, Wed 10/17

llle l/C. Llnked llsLs. SLacks. Cueues. Pash Lables. 1rees. 8lnary search Lrees. 1rles.

Week 7
Mon 10/22, Wed 10/24

Puffman codlng. 8lLwlse operaLors. P11. P1ML.

Week 8
Mon 10/29, Wed 10/31

CSS. P. SCL.

Week 9
Mon 11/3, Wed 11/7

SCL, conLlnued. !avaScrlpL. A[ax. ueslgn.

Week 10
Mon 11/12, Wed 11/14

SecurlLy.

Oolz 1 oo weJ 11/14.

Week 11
Mon 11/19

Llfe afLer 30.


1hls ls CSS0.
narvard Un|vers|ty lall 2012
3 < 12
Sect|ons

LecLures are supplemenLed by weekly, 90-mlnuLe secLlons led by Lhe Leachlng fellows. SecLlons provlde
you wlLh opporLunlLles Lo explore Lhe course's maLerlal ln a more lnLlmaLe envlronmenL, wlLh only your
Leachlng fellow and a handful of classmaLes presenL, as well as Lo dlve lnLo hands-on acLlvlLles.

ulfferenL secLlons are offered for Lhose less comforLable, Lhose more comforLable, and Lhose
somewhere ln beLween.

SecLlonlng beglns ln Week 0. SecLlons Lhemselves begln ln Week 2.

A schedule of secLlons appears on Lhe course's webslLe.


Wa|kthroughs

Cn lrldays from 2:30pm unLll 4:00pm, Lhe Leachlng fellows hold a "walkLhrough" for Lhe upcomlng
week's problem seL durlng whlch you recelve dlrecLlon on where Lo begln and how Lo approach Lhe
week's challenges.

Lach walkLhrough ls fllmed and made avallable wlLhln 24 hours ln sLreamlng and downloadable formaLs
(M3 and M4). ?ou are expecLed Lo aLLend or waLch walkLhroughs before asklng quesLlons abouL
problem seLs aL offlce hours or vla cs50.net/discuss.


Cff|ce nours

Cfflce hours are opporLunlLles for asslsLance wlLh problem seLs alongslde Lhe course's Leachlng fellows
and course asslsLanLs. Cfflce hours ordlnarlly Lake place on Mondays, 1uesdays, Wednesdays, and
1hursdays, from 8pm unLll 11pm, ln Annenberg Pall. Also ln aLLendance are free food and drlnks.

upon arrlval, log lnLo cs50.net/discuss. 8efore posLlng a quesLlon, be sure Lo search, lesL lL already
have been asked and answered. lf you do posL a new quesLlon, provlde as much deLall as posslble.
We'll do our besL Lo reply qulckly. lf your quesLlon cannoL be answered effecLlvely onllne, lL wlll be
rouLed (upon conflrmaLlon from you) Lo Lhe CS30 CreeLer, an lad-equlpped sLaff member who wlll
refer you Lo a Leachlng fellow or course asslsLanL seaLed ln Lhe vlclnlLy.


1hls ls CSS0.
narvard Un|vers|ty lall 2012
6 < 12
rob|em Sets

LlghL problem seLs are asslgned durlng Lhe semesLer. Lach ls due vla elecLronlc submlsslon slx or more
days afLer lLs daLe of dlsLrlbuLlon. Powever, you have flve (3) "laLe days" LhaL you may "spend" durlng
Lhe semesLer, each of whlch provldes you wlLh an exLenslon of LwenLy-four hours. ?ou may spend no
more Lhan one laLe day on any parLlcular problem seL. ?ou need noL lnform Lhe sLaff of your use of a
laLe day, usage of laLe days ls Lracked auLomaLlcally. LaLeness of elecLronlc submlsslons ls deLermlned
down Lo Lhe mlnuLe by submlsslons' LlmesLamps. SubmlLLlng more Lhan seven mlnuLes laLe ls
equlvalenL Lo submlLLlng LwenLy-four hours laLe. LaLe work ls noL accepLed once you have exhausLed
your laLe days, excepL ln cases of emergency. 1echnlcal dlfflculLles are noL consldered emergencles.
1hese laLe days cannoL be spenL on Lhe course's flnal pro[ecL.

ln order Lo accommodaLe sLudenLs wlLh dlfferenL backgrounds, some problem seLs are released ln Lwo
edlLlons: a sLandard edlLlon lnLended for mosL sLudenLs and a "Packer LdlLlon" lnLended for some
sLudenLs. 8oLh edlLlons essenLlally cover Lhe same maLerlal. 8uL Lhe Packer LdlLlon Lyplcally presenLs
LhaL maLerlal from a more Lechnlcal angle and poses more sophlsLlcaLed quesLlons. Packer LdlLlons are
graded separaLely from sLandard edlLlons, buL Lhose sLudenLs who submlL Lhe former do noL recelve any
form of exLra credlL ouLrlghL. When deLermlnlng grades aL Lerm's end, however, we do bear ln mlnd
submlsslons of Packer LdlLlons.

1o be clear, we encourage mosL sLudenLs (lncludlng asplrlng compuLer sclenLlsLs) Lo Lackle Lhe sLandard
edlLlons. Powever, you may choose, week Lo week, whlch edlLlon Lo submlL. ?ou may noL submlL boLh
or some amalgam of Lhe Lwo.

AlLhough you musL submlL all elghL problem seLs, your lowesL score among Lhose problem seLs on whlch
you recelved a perfecL score for Lhe axls of scope wlll be dropped when flnal grades are deLermlned.

A schedule of problem seLs, sub[ecL Lo change, appears below.

rob|em Set 0: Scratch
due by noon on 1hu 9/13

rob|em Set 1: C
due by noon on 1hu 9/20

rob|em Set 2: Crypto
due by noon on 1hu 9/27

rob|em Set 3: Scramb|e
due by noon on 1hu 10/4

rob|em Set 4: Iorens|cs
due by noon on 1hu 10/18

rob|em Set S: M|spe|||ngs
due by noon on 1hu 10/23
1hls ls CSS0.
narvard Un|vers|ty lall 2012
7 < 12
rob|em Set 6: nuff'n uff
due by noon on 1hu 11/1

rob|em Set 7: C5S0 I|nance
due by noon on 1hu 11/8


u|zzes

1he course has Lwo 73-mlnuLe qulzzes. 1hese qulzzes are "closed-book," buL you may uLlllze durlng each
qulz one Lwo-slded page (8.3" 11") of noLes, Lyped or wrlLLen, and a pen or pencll, noLhlng else.

When flnal grades are compuLed, your scores on Lhese Lwo qulzzes are welghLed equally.

A schedule of qulzzes, sub[ecL Lo change, appears below, Lhese qulzzes Lake place ln lleu of lecLures on
Lhese daLes.

u|z 0
Wed 10/10

Covers weeks 0 Lhrough 4.

u|z 1
Wed 11/14

Covers weeks 0 Lhrough 10 wlLh emphasls on 3 onward.

unless arranged wlLh Lhe course's heads ln advance, qulzzes may noL be Laken aL alLernaLlve Llmes even
lf mlssed by accldenL, excepL ln cases of emergency.


I|na| ro[ect

1he cllmax of Lhls course ls lLs flnal pro[ecL. 1he flnal pro[ecL ls your opporLunlLy Lo Lake your newfound
savvy wlLh programmlng ouL for a spln and develop your very own plece of sofLware. So long as your
pro[ecL draws upon Lhls course's lessons, Lhe naLure of your pro[ecL ls enLlrely up Lo you, albelL sub[ecL
Lo Lhe sLaff's approval. ?ou may lmplemenL your pro[ecL ln any language(s) as long as Lhe sLaff approves.
?ou are welcome Lo uLlllze lnfrasLrucLure oLher Lhan Lhe CS30 Appllance, provlded Lhe sLaff ulLlmaLely
has access Lo any hardware and sofLware LhaL your pro[ecL requlres. All LhaL we ask ls LhaL you bulld
someLhlng of lnLeresL Lo you, LhaL you solve an acLual problem, LhaL you lmpacL campus, or LhaL you
change Lhe world. SLrlve Lo creaLe someLhlng LhaL ouLllves Lhls course.

lnasmuch as sofLware developmenL ls rarely a one-person efforL, you are allowed an opporLunlLy Lo
collaboraLe wlLh one or Lwo classmaLes for Lhls flnal pro[ecL. needless Lo say, lL ls expecLed LhaL every
sLudenL ln any such group conLrlbuLe equally Lo Lhe deslgn and lmplemenLaLlon of LhaL group's pro[ecL.
Moreover, lL ls expecLed LhaL Lhe scope of a Lwo- or Lhree-person group's pro[ecL be, respecLlvely, Lwlce
1hls ls CSS0.
narvard Un|vers|ty lall 2012
8 < 12
or Lhrlce LhaL of a Lyplcal one-person pro[ecL. A one-person pro[ecL, mlnd you, should enLall more Llme
and efforL Lhan ls requlred by each of Lhe course's problem seLs. AlLhough no more Lhan Lhree sLudenLs
may deslgn and lmplemenL a glven pro[ecL, you are welcome Lo sollclL advlce from oLhers, so long as you
respecL Lhe course's pollcy on academlc honesLy.


Culdellnes for Lhe flnal pro[ecL wlll be dlsLrlbuLed by Mon 10/22. A schedule, sub[ecL Lo change, appears
below.

re-roposa|
due by noon on Mon 11/3

roposa|
due by noon on Mon 11/12

Status keport
due by noon on lrl 11/30

CSS0 nackathon
from 8:00pm on Wed 12/3 unLll 7:00am on 1hu 12/6

Imp|ementat|on
due by noon on Sun 12/9

CSS0 Ia|r
from 11:00am unLll 4:30pm on Mon 12/10

LxLenslons on Lhe flnal pro[ecL are noL granLed, excepL ln cases of emergency. 1echnlcal dlfflculLles are
noL consldered emergencles. roblem seLs' laLe days cannoL be spenL on Lhe flnal pro[ecL. LaLeness of
submlsslons ls deLermlned down Lo Lhe mlnuLe by submlsslons' LlmesLamps. SubmlLLlng more Lhan
seven mlnuLes laLe ls equlvalenL Lo noL submlLLlng aL all.


CSS0 nackathon

lrom 8:00pm on Wed 12/3 unLll 7:00am on 1hu 12/6 ls Lhe CS30 PackaLhon, an eplc all-nlghLer durlng
whlch you can dlve lnLo your flnal pro[ecL's lmplemenLaLlon alongslde classmaLes and sLaff. lf you
choose Lo parLake, you'll be asked Lo propose Lhree mllesLones for yourself LhaL evenlng: a "good" one
LhaL you lnLend Lo achleve no maLLer whaL, a "beLLer" one LhaL you Lhlnk you can achleve, and a "besL"
one LhaL you hope Lo achleve.

ulnner wlll be served aL 9:00pm, second dlnner wlll be served aL 1:00am, and Lhose sLlll sLandlng aL
3:00am wlll be LreaLed Lo breakfasL aL lPC.


1hls ls CSS0.
narvard Un|vers|ty lall 2012
9 < 12
CSS0 Ia|r

lrom 11:00am unLll 4:30pm on Mon 12/10 ls Lhe CS30 lalr, an eplc dlsplay of flnal pro[ecLs. noL only ls
Lhe falr a venue aL whlch Lo see classmaLes' pro[ecLs and demo your own, lL ls an opporLunlLy Lo mlngle
wlLh sLudenLs, faculLy, and sLaff from across campus as well as recrulLers from lndusLry. ALLendance ls
expecLed of all sLudenLs.

Also ln aLLendance are popcorn, candy, and a raffle wlLh (fabulous) prlzes. lamlly and frlends are
welcome Lo [oln.


Academ|c nonesty

All work LhaL you do Loward fulflllmenL of Lhls course's expecLaLlons musL be your own unless
collaboraLlon ls expllclLly allowed ln wrlLlng by Lhe course's lnsLrucLor. CollaboraLlon ln Lhe compleLlon
of problem seLs ls noL permlLLed unless oLherwlse sLaLed by some problem seL's speclflcaLlon.

vlewlng or copylng anoLher lndlvldual's work (even lf lefL by a prlnLer, sLored ln an execuLable dlrecLory,
or posLed onllne) or llfLlng maLerlal from a book, webslLe, or oLher source-even ln parL-and
presenLlng lL as your own consLlLuLes academlc dlshonesLy, as does showlng or glvlng your work, even ln
parL, Lo anoLher sLudenL or sollclLlng Lhe work of anoLher lndlvldual. Slmllarly ls dual submlsslon
academlc dlshonesLy: you may noL submlL Lhe same or slmllar work Lo Lhls course LhaL you have
submlLLed or wlll submlL Lo anoLher. nor may you provlde or make avallable soluLlons Lo problem seLs
Lo lndlvlduals who Lake or may Lake Lhls course ln Lhe fuLure. Moreover, submlsslon of any work LhaL
you lnLend Lo use ouLslde of Lhe course (e.q., for a [ob) musL be approved by Lhe course's lnsLrucLor or
precepLor.

?ou are welcome Lo dlscuss Lhe course's maLerlal wlLh oLhers ln order Lo beLLer undersLand lL. ?ou may
even dlscuss problem seLs wlLh classmaLes, buL you may noL share code. ln oLher words, you may
communlcaLe wlLh classmaLes ln Lngllsh, buL you may noL communlcaLe ln, say, C. lf ln doubL as Lo Lhe
approprlaLeness of some dlscusslon, conLacL Lhe course's lnsLrucLor or precepLor.

?ou may Lurn Lo Lhe Web for lnsLrucLlon beyond Lhe course's lecLures and secLlons, for references, and
for soluLlons Lo Lechnlcal dlfflculLles, buL noL for ouLrlghL soluLlons Lo problems on problem seLs or your
own flnal pro[ecL. Powever, fallure Lo clLe (as wlLh commenLs) Lhe orlgln of any code or Lechnlque LhaL
you do dlscover ouLslde of Lhe course's lecLures and secLlons (even whlle respecLlng Lhese consLralnLs)
and Lhen lnLegraLe lnLo your own work may be consldered academlc dlshonesLy.

All forms of academlc dlshonesLy are dealL wlLh harshly. lf Lhe course refers some maLLer Lo Lhe
AdmlnlsLraLlve 8oard and Lhe ouLcome for some sLudenL ls AJmoolsb, ltobotloo, kepoltemeot to
wltbJtow, or kecommeoJotloo to ulsmlss, Lhe course reserves Lhe rlghL Lo lmpose local sancLlons on
Lop of LhaL ouLcome for LhaL sLudenL LhaL may lnclude, buL noL be llmlLed Lo, a falllng grade for work
submlLLed or for Lhe course lLself.


1hls ls CSS0.
narvard Un|vers|ty lall 2012
10 < 12
Acknow|edgement and Author|zat|on

Parvard plans Lo make, and Lo permlL a Lhlrd parLy documenLary fllmmaker (Lhe "lllmmaker") Lo make,
vldeo and audlo recordlngs of CompuLer Sclence 30 (CS30) lecLures, secLlons, offlce hours,
walkLhroughs, semlnars, and oLher evenLs and acLlvlLles relaLed Lo CS30, wlLh Lhe alms of maklng Lhe
conLenL of Lhe course more wldely avallable and conLrlbuLlng Lo publlc undersLandlng of lnnovaLlve
learnlng (Lhe "ro[ecLs"). 1he recordlngs, or edlLed verslons of Lhem, may be made avallable Lo oLher
Parvard sLudenLs, Lo sLudenLs aL oLher educaLlonal lnsLlLuLlons, and Lo Lhe broader publlc vla edx, Lhe
lnLerneL, Lelevlslon, LheaLrlcal dlsLrlbuLlon, uvu, or oLher means. lL ls also posslble LhaL Lhe recordlngs
may be used Lo make oLher derlvaLlve works ln Lhe fuLure. 8y agreemenL wlLh Parvard, Lhe lllmmaker's
use of recordlngs lL makes wlll be llmlLed Lo use ln a documenLary fllm abouL lnnovaLlve learnlng
(Lhe "lllm"). SLudenLs may elecL noL Lo appear ln vldeo used ln Lhe ro[ecLs and may sLlll parLlclpaLe
fully ln CS30.

When you submlL roblem SeL 0, you wlll need Lo slgn onllne an AcknowledgemenL and AuLhorlzaLlon ln
Lhe followlng form:

l ooJetstooJ tbot, lf l Jo oot wlsb ooy vlJeo footoqe of me to be oseJ os pott of tbe ltojects, l sboolJ so
lofotm tbe cootse's losttoctot by emollloq recordings@cs50.net wltblo ooe week of eotollloq lo c550.
lo tbot eveot, l ooJetstooJ tbot l sboolJ slt lo tbe JeslqooteJ "oo fllm" sectloo of c550 closstooms ooJ
sboolJ oot wolk lo tbe flelJ of vlew of tbe cometos. l ooJetstooJ tbot notvotJ ooJ tbe lllmmoket wlll
toke teosoooble steps, wltb my coopetotloo, to ovolJ locloJloq lJeotlfloble lmoqes of me lo ltoject vlJeo
sbot lo closstooms ooJ otbet cootse locotloos oftet l opt oot os jost JesctlbeJ. l ooJetstooJ tbot l om
ftee to opt oot of tbe ltoject vlJeos lo tbls woy, ooJ tbot Joloq so wlll oot offect my qtoJe ot my oblllty
to pottlclpote lo cootse octlvltles.

uoless l opt oot of tbe ltoject vlJeos os JesctlbeJ obove ooJ toke tbe steps tbot wlll be ootlloeJ by tbe
losttoctot to ovolJ beloq fllmeJ, l ootbotlze notvotJ ooJ tbe lllmmoket eocb to moke ooJ ose vlJeo ooJ
ooJlo tecotJloqs of my pottlclpotloo lo c550 ooJ octlvltles teloteJ to c550 (tbe "kecotJloqs"). l
ooJetstooJ ooJ oqtee tbot tbe kecotJloqs moy locloJe my lmoqe, volce ooJ oome. l olso ooJetstooJ
ooJ oqtee tbot, eveo lf l opt oot of tbe ltoject vlJeos, my volce ooJ spokeo oome moy be plckeJ op by
mlctopbooes ootslJe tbe "oo fllm" sectloo ooJ moy be locloJeJ lo tbe kecotJloqs.

l ooJetstooJ ooJ oqtee tbot notvotJ ooJ tbe lllmmoket eocb wlll bove tbe lttevocoble, wotlJwlJe tlqbt
to moke, eJlt, moJlfy, copy, pobllsb, ttoosmlt, Jlsttlbote, sell, pobllcly Jlsploy, pobllcly petfotm, ooJ
otbetwlse ose ooJ moke ovolloble tbelt tespectlve kecotJloqs ooJ ooy otbet wotks tbot moy be JetlveJ
ftom tbose kecotJloqs, lo ooy moooet ot meJlom oow koowo ot lotet loveoteJ, ooJ to ootbotlze otbets
to Jo so os well, ptovlJeJ tbot tbe lllmmoket's ose of kecotJloqs lt mokes wlll be llmlteJ to ose lo tbe
lllm. l beteby ttoosfet to notvotJ ooy tlqbts, locloJloq copytlqbts, l moy bove lo tbe kecotJloqs notvotJ
mokes, ooJ l beteby ttoosfet to tbe lllmmoket fot ose lo tbe lllm ooy tlqbts, locloJloq copytlqbts, l moy
bove lo tbe kecotJloqs tbe lllmmoket mokes. l wlll temolo ftee to ose ooJ Jlssemloote ooy lJeos,
temotks, ot otbet motetlol tbot l moy coottlbote to cootse Jlscossloos.

l ockoowleJqe ooJ oqtee tbot l wlll oot be eotltleJ to ooy poymeot, oow ot lo tbe fotote, lo coooectloo
wltb tbe kecotJloqs ot ooy wotks JetlveJ ftom tbem. 1bls AckoowleJqmeot ooJ Aotbotlzotloo ls o
1hls ls CSS0.
narvard Un|vers|ty lall 2012
11 < 12
bloJloq oqteemeot, ooJ ls slqoeJ os o Jocomeot ooJet seol qovetoeJ by tbe lows of tbe commooweoltb
of Mossocbosetts.

Un|ess you opt out as descr|bed |n the Acknow|edgment and Author|zat|on, you are agree|ng, by
attend|ng CSS0, that your part|c|pat|on |n CSS0 and re|ated act|v|t|es may be f||med and used by
narvard and the I||mmaker |n connect|on w|th the v|deo pro[ects w|thout further ob||gat|on or
||ab|||ty to you, even |f you do not s|gn any author|zat|on.

If you have any quest|ons about the above, contact recordings@cs50.net.