Announcements
Class Info
-
Professor: Kevin Webb
-
Lecturer: Charles Kazer
-
Class: Tuesday / Thursday, 1:15 PM - 2:30 PM, Science Center 199 (Cunniff)
-
Labs:
Section A
Wednesday 8:50 AM - 10:20 AM (Webb)
SCI 240
Section B
Wednesday 1:15 PM - 2:45 PM (Kazer)
SCI 240
Section C
Wednesday 3:00 PM - 4:30 PM (Kazer)
SCI 240
-
Ninjas: Amy, Ryan, Trisha, and Zach — see CS31 Ninja Sessions.
-
Office Hours:
-
Monday 12:30 PM - 1:30 PM (Kevin — SCI 255)
-
Tuesday 10:30 AM - Noon (Kevin — SCI 255)
-
Friday 1:00 PM - 3:00 PM (Charlie — SCI 262A)
-
-
Textbook: Dive into Systems
-
EdSTEM: Q&A Forum
-
GitHub: Swarthmore GitHub Enterprise
Inclusion Statement
Diversity, inclusion, and a mutual sense of belonging are all core values of this course. All participants in this course must be treated with respect by other members of the Swarthmore CS community. We must all strive, students and faculty both, to never make anyone feel unwelcome or unsafe in any way. Violations of these principles are viewed as unacceptable, and we take them very seriously. If you ever feel discriminated against or otherwise excluded, no matter how minor the offense, we encourage you to reach out to Kevin, Charlie, one of the college deans, or campus non-discrimination contacts.
Required Materials
-
iClicker: This course uses iClicker devices to facilitate feedback and discussion during class. For many intermediate and upper level CS courses including CS 31, we require that students purchase their own clicker for personal use. Clickers may be purchased at the college bookstore or online. If you purchase your clicker at the bookstore, it is eligible for the TAP program. Please register your clicker online as soon as possible! Even if you have used clickers in other CS courses, you still need to register your clicker for use in this course.
-
Textbook: all readings will come from a free, online textbook: Dive into Systems by Matthews, Newhall, and Webb. (Two of the co-authors are Swarthmore CS faculty!)
Course Overview, Goals, and Structure
This course is a broad introduction to computer science that focuses on how a computer works and how programs run on computers. We examine the hardware and software components required to go from a program expressed in a high-level programming language like C or Python to the computer actually running the program. This course takes a bottom-up approach to discovering how a computer works and introduces parallel and distributed computing with a specific focus on parallelism for multicore and other shared memory systems.
Topics include theoretical models of computation, data representation, machine organization, assembly and machine code, memory, I/O, the stack, the operating system, compilers and interpreters, processes and threads, and synchronization. In addition to parallel programming, we will discuss parallel computers and system-level support for parallel computing.
Prerequisite: Completion of CS21 or its equivalent.
Goals for the Course:
Class Structure
-
Readings: Shorter readings serve as a first exposure to new topics, where students learn the basics of the material. These should be read prior to the class meeting for which they are assigned. The reading quizzes are primarly based on these readings. Full required weekly readings complement lecture content. See tips for reading textooks for how to read these.
-
Class meetings: The classroom material will cover the course concepts in depth, and include activites to practice applying concepts learned, and to facilitate student discussion.
-
Exams: There is a midterm exam and a final exam (both closed-book) covering the material in the class meetings (and to a lesser extent on some labs). Some reference materials will be provided with the exams.
-
Labs: There are several lab programming assignments (mostly in C) that will explore various aspects of computer systems.
-
Reading Quizzes: Most class meetings there will be a short quiz primarily based on the shorter assigned readings.
-
Written Homeworks: There are several written homework assignments. Written homeworks are on based on class material and provide good practice for exams.
Schedule
This is a tentative schedule; it may change as we go. All section numbers refer to the Dive into Systems textbook unless otherwise indicated. You should read the assigned sections before class to prepare for reading quizzes.
Week | Day | Recordings | Topic, Slides, & Readings | Labs & Homeworks |
---|---|---|---|---|
1 | Aug 30 | Course Introduction | ||
Aug 31 | ||||
Sep 01 | Introduction to C Programming | |||
2 | Sep 06 | Data Representation | ||
Sep 07 | ||||
Sep 08 |
NOTE: Drop/add ends (Sep 09) | Binary Arithmetic | ||
3 | Sep 13 | Digital Circuits | ||
Sep 14 | ||||
Sep 15 | Digital Circuits (continued) | |||
4 | Sep 20 | ISAs and Assembly | ||
Sep 21 | ||||
Sep 22 | ISAs and Assembly (continued) | |||
5 | Sep 27 | Pointers and Memory | ||
Sep 28 | ||||
Sep 29 | Pointers and Memory (continued) | |||
6 | Oct 04 | Functions and the Stack | ||
Oct 05 | ||||
Oct 06 | Midterm Exam | |||
Oct 11 | Fall Break | |||
Oct 12 | ||||
Oct 13 | ||||
7 | Oct 18 | Functions and the Stack (continued) | ||
Oct 19 | ||||
Oct 20 | Arrays, Structs, and Pointers | |||
8 | Oct 25 | Arrays, Structs, and Pointers (continued) | ||
Oct 26 | ||||
Oct 27 | ||||
9 | Nov 01 | Caching | ||
Nov 02 | ||||
Nov 03 |
NOTE: CR/NC/W Deadline (Nov 04) | Caching (continued) | ||
10 | Nov 08 | Operating Systems | ||
Nov 09 | ||||
Nov 10 | ||||
11 | Nov 15 | Virtual Memory | ||
Nov 16 | ||||
Nov 17 | Virtual Memory (continued) | |||
12 | Nov 22 | Parallel Applications and Threading | ||
Nov 23 | ||||
Nov 24 | Thanksgiving | |||
13 | Nov 29 | Race Conditions and Synchronization | ||
Nov 30 | ||||
Dec 01 | Other Synchronization & Thread Design Patterns | |||
14 | Dec 06 | |||
Dec 12 | Final Exam -- 2:00 PM - 5:00 PM |