The lecture schedule will be updated as the term progresses.
Make sure to fill out the pre-course survey that is available on Lecture 1’s slides.
Make sure you are registered for the course Gradescope.
Date | Topic | Reading |
---|---|---|
Fri, Jan 24, 2025 |
Lecture 1 Course Overview History of Computing [slides] |
Computer Science: Not about Computers, Not Science (Krebsbach, FECS 2015)
My Ph.D. advisor rewrote himself in bash (Matt Might's blog post) How to Read a Computer Science Research Paper (Amanda Stent) |
Fri, Jan 31, 2025 |
Lecture 2
|
The Space Complexity of Approximating the Frequency Moments, Alon, N., Matias, Y., & Szegedy, M. (1996), Theory of Computing
Steve Cook's essay on P vs NP problem Fifty Years of P Versus NP and the Possibility of the Impossible, Fortnow 2017 Communcitations of ACM (Optionali) |
Fri, Feb 7, 2025 |
Lecture 3
|
<a href="https://sedgewick.io/wp-content/themes/sedgewick/papers/1977Analysis.pdf"">The Analysis of Quicksort Programs, Sedgewick (1977), Acta Informatica</a>
|