CMSC 31100-1: Big Ideas in Computer Science
This course will give an introduction to many of the important
concepts in the broad area of computer science. Each week a different
professor from the computer science department will give a
three-lecture sequence on a big idea in their field of specialty.
Organizer: Lance Fortnow
Lectures: MWF 10:30-11:20 in Ryerson 276
Teaching Assistant: Xiofei He
Course Requirements: Students are required to attend all
classes. Each week the faculty member of that week will assign
readings and a short assignment. Grades and course credit will be
based on these assignments. There will be no exams. Grading will be Pass/Fail.
Course Schedule
- Week of September 27: Janos Simon on Models of
Computation and
Undecidability.
- Week of October 4: David MacQueen on
Structural Operational Semantics.
- Week of October 11: Stuart Kurtz on
Randomness.
- Kolmogorov
Complexity by Lance Fortnow. Note: This survey contains some of
the solutions to the homework problems. Try doing the homework before
reading the proofs in the survey.
- Assignment 3, Due Monday, October 25.
- Week of October 18:
Lance
Fortnow on Cryptography.
- Week of October 25:
Ian Foster on Packet
Switching and the Internet.
- Week of November 1: Rick Stevens on
Software Engineering.
- Week of November 8: Gina Levow on
Learning, Uncertainty, and Information.
- Topics: The noisy-channel model, probabilistic
reasoning, and learning through the lens of Hidden Markov
Models and their EM-based training procedures.
- Reading
Material and Slides
- Assignment
7, New Due Date: Monday, November 22.
- Week of November 15: Robert Kirby on Stability.
- Week of November 22: Pedro Felzenswalb on Fast
Fourier Transforms and Signal Processing.
- Lecture Notes
- Fast Fourier Transform Algorithm in Introduction to Algorithms by
Cormen, Leiserson and Rivest. See Pedro for a copy.
- Assignment 9, due Friday,
December 3.
- Week of November 29: John Reppy on
Techniques for Program Specialization.