We've just finished grading the final exam. We've posted solutions and statistics, and your graded exams are up online at Gradescope. It's been a pleasure teaching CS103 this quarter. Feel free to stay in touch with us throughout your further adventures, and enjoy the break!
Our very last problem set, Problem Set Nine, is now available. It's due next Friday right before our last lecture. This problem set is all about the very limits of computing power - and even what lies beyond them. We hope it's a fitting coda to our exploration of computing and computation!
Problem Set Eight has just been released. It comes due the Friday after break, so you have a full two weeks to work on this one even though it's designed to just take a single week to complete.
Solutions to the second midterm exam are now available. We will be grading the exam on Saturday and will post statistics, common mistakes, etc. once we've finished.
Problem Set Seven has just been released. It explores regular expressions and the limits of the regular languages. We hope you enjoy this one - it's a blend of immensely practical and purely theoretical results!
Solutions to the first midterm exam are now available. We are working on reviewing revise-and-resubmit answers and will aim to have them all graded by this Saturday.
We've just posted Extra Practice Problems 2, a set of thirty cumulative review problems you can work through if you'd like to get more practice with the topics covered on PS3 - PS5. Feel free to ping us if you have any questions or would like us to take a look over your answers.
Problem Set Six, which is all about DFAs, NFAs, and formal languages, goes out today. It's due next Friday at 2:30PM. In this problem set you'll learn how to design automata, as well as seeing some neat applications of the concepts to other areas. We hope you have fun with this one!
Midterm scores have just been published, along with TA feedback. You will have the opportunity to revise and resubmit your answers to earn an overall score of up to 85% on the midterm. For information about the timeline and logistics for doing so, check this page about revise-and-resubmit.
Problem Set Five goes out today. This problem set is all about induction and its applications, and we hope you have a lot of fun working through it. It's due, as usual, next Friday at 2:30PM. Enjoy, and good luck!
Problem Set Four goes out today. It's due next Friday at 2:30PM and explores the amazing world of graph theory and its applications. Good luck!
Problem Set Three goes out today. It's due next Friday at 2:30PM. This problem set is all about functions and set cardinality, and in the course of working through it you'll build up a deep understanding of how to use and manipulate first-order definitions in proofs. Good luck!
Problem Set Two goes out today. It's due next Friday at 2:30PM. In this problem set, you'll dive deep into propositional and first-order logic and get additional practice writing mathematical proofs. Good luck!
We're running a second round of our Problem Set Matchmaking service! If you're interested in signing up, fill out this new form by Friday at 2:30PM.
Problem Set One goes out today. It's due next Friday at 2:30PM. This problem set is all about mathematical proofs and is designed to get you comfortable structuring and formal arguments. It also includes a review of the set theory concepts we covered this week. If you need any help working through these problems, check out our Guide to Office Hours and the office hours calendar. You can also ask questions on EdStem. We're happy to help out. You are welcome to work on this problem set in pairs. If you do, please make sure to submit just a single joint copy of your answers; that will save the TAs a lot of time when grading. Good luck!
You're welcome to work with a partner this quarter on problem sets (starting with PS1). If you're looking for a partner and would like us to match you with another CS103 student, fill out this matchmaking form by this Friday afternoon and we'll connect you with another CS103 student.
CS103A is an optional, one-unit companion course to CS103. It meets once a week to provide extra practice and review of the course material in a small group setting. If you're interested in the course, feel free to apply online using this link by this Friday.
Welcome to CS103, an introduction to discrete mathematics, computability theory, and complexity theory! We have an great quarter ahead of us filled with interesting and exciting results in the power and limits of computation, and I hope that you're able to join us. If you have any questions in the meantime, feel free to email me at htiek@cs.stanford.edu. See you soon!