cs24-23fa

Introduction to Computing Systems (Fall 2023)

Welcome to CS 24! We’re super excited to have you here this term!

Due Next

Calendar

Wellness and Inclusion

It is very important to us that you succeed in CS 24. We provide many extra resources to help you. Adam and the TAs hold many office hours, and we have a Ed Discussion Board where you can ask questions asynchronously.

It is also very important to us that you maintain your mental wellness throughout the course. A few points are not worth losing sleep over. Everyone on the course staff is available to chat, and you can always attend office hours for a non-academic conversation if necessary. You can also visit the counseling center if you find you need help beyond the course staff. If you have a temporary health condition or permanent disability (either mental health or physical health related), you should contact accessibility services if you have not already. Additionally, if there is something we can do to make your experience better, please let us know.

Diversity, inclusion, and belonging are all core values of this course. All participants in this course must be treated with respect by other members of the community in accordance with the honor code. If you feel unwelcome or unsafe in any way, no matter how minor, we encourage you to talk to Adam or one of the Deans. We view these sorts of honor code violations as completely unacceptable, and we take them very seriously.

Tools

Project Registration Ed Discussion Use Late Tokens

Course Staff

Instructor

they/them
Book an appointment!
Annenberg 115
blank@caltech.edu
(626) 395-1765

Teaching Assistants

Hopper
she/her
hopper@
Ilana Hejna
she/her
ihejna@
Dominic Phung
he/him
dominicph@
Andy Dimnaku
he/him
adimnaku@
Eli Kugelsky
he/him
ekugelsk@
Emily Hu
she/her
ehu@
Jacob Acosta
he/him
cjacosta@
Jia Yue Wu
she/her
jwu7@
Joaquín Gomez
he/him
jagomez@
Jun Hyuk Kwak
he/him
jkwak@
Leo Jenkins
he/him
lbjenkin@
Maria Vazhaeparambil
she/her
mvazhaep@
Markus Lendermann
he/him
mlenderm@
Nico Adamo
he/him
nadamo@
Neil Janwani
he/him
njanwani@
Sahil Azad
he/him
sazad@
Winter Pearson
they/them
winter@
Yakov Shalunov
he/him
yakov@

Handouts

The following is a list of handouts that you might find helpful throughout the course. We’ve categorized them by when they are useful.

Course

Syllabus – an overview of the course and administrative information

Collaboration Policy – the course collaboration policy

Code Quality Guidelines – a list of style requirements for the projects

Tools of the Trade – tutorials for tools that you will need to use in this course

Manual Pages – documentation for relevant standard C functions

Weeks 2 & 3

x86-64 Reference – a description of relevant instructions and ABIs for x86-64

Schedule

L00 Wed, Sep 27 Perspectives on Computing Systems [ pdf ]
What is this course about? How will grading work? What will the notes look like? What is hexadecimal and why do I care? How do computers represent information?
L01 Fri, Sep 29 Memory [ pdf ]
What does an abstraction for memory look like? Give me the details!
L02 Mon, Oct 02 Fixed-Width Integers [ pdf ]
How do computers represent integers? What about negative numbers? How does this affect me as a programmer?
DS 4.1-4.7
Lecturcises00 (integers and memory) due @ 11:30 pm on Tue, Oct 03
L03 Wed, Oct 04 Cancelled
Pretest (disk) due @ 11:30 pm on Thu, Oct 05
L04 Fri, Oct 06 x86-64 Introduction [ pdf ]
What is x86-64? Why should I care about assembly? How can I understand basic assembly programs and instructions such as mov and others?
DS 7.1-7.3
L05 Mon, Oct 09 x86-64 Conditionals [ pdf ]
How does branching work in x86-64? What is a label? How can we translate if statements into assembly?
DS 7.4
Lecturcises01 () due @ 11:30 pm on Tue, Oct 10
L06 Wed, Oct 11 x86-64 Procedures [ pdf ]
How do function calls and returns work? What is 'the stack' really?
Project01 (jvm) due @ 11:30 pm on Thu, Oct 12
L07 Fri, Oct 13 x86-64 Recursive Procedures [ pdf ]
How does recursion work using the stack?
DS 7.7-7.9, 12
L08 Mon, Oct 16 Security: Buffer Overflows
What happens if we read past the end of a buffer? How can we exploit this?
L09 Wed, Oct 18 HTTP and Buffer Overflow Review
Project02a (bomb) due @ 11:30 pm on Thu, Oct 19
L10 Fri, Oct 20 Dynamic Memory: Basic
L11 Mon, Oct 23 Dynamic Memory: Advanced
L12 Wed, Oct 25 Dynamic Memory: Garbage Collection
Project02b (asmgen) due @ 11:30 pm on Thu, Oct 26
L13 Fri, Oct 27 ECF: Processes I
L14 Mon, Oct 30 ECF: Processes II
L15 Wed, Nov 01 ECF: Signals
Midterm (adventure) due @ 11:30 pm on Thu, Nov 02
L16 Fri, Nov 03 ECF: Exceptions
L17 Mon, Nov 06 Memory: Locality & The Memory Hierarchy
L18 Wed, Nov 08 Memory: Cache Memories
L19 Fri, Nov 10 Memory: Virtual Memory
L20 Mon, Nov 13 Security: Side-Channel Attacks
L21 Wed, Nov 15 Security: Meltdown
Meltdown!
Project03 (malloc) due @ 11:30 pm on Thu, Nov 16
Extracredit01 (gc) due @ 11:30 pm on Thu, Nov 16
L22 Fri, Nov 17 Concurrent Programming: Processes & Threads
L23 Mon, Nov 20 Concurrent Programming: pthreads & mutexes
L24 Wed, Nov 22 Concurrent Programming: Condition Variables
:( Fri, Nov 24 Thanksgiving: No Class
Project04 (vm & meltdown) due @ 11:30 pm on Fri, Nov 24
L25 Mon, Nov 27 Concurrent Programming: More Condition Variables
L26 Wed, Nov 29 Final Exam Review
L27 Fri, Dec 01 Victory Lap
Project05 (passwd) due @ 11:30 pm on Fri, Dec 01
Final (final) due @ 11:30 pm on Wed, Dec 06