The final exam will be on December 12 from 12:15PM - 3:15PM. Locations are divvied up by last name:
As with the midterms, the exam is closed-book and closed-computer, but open one page of notes.
The order in which we've covered concepts in CS103 is quite different from the order in which they were originally developed and discovered. If you're interested in seeing the actual chronology of events, with citations of the original papers on each subject, check out this timeline of CS103 results. This timeline is definitely incomplete, so if there are any topics or events that you'd like me to include here, please let me know!
The second midterm exam is this Thursday night from 7PM - 10PM. The exam is held in two different locations that are divvied up by last name as follows:
As we approach the second midterm exam, I thought I'd share two resources that I've found helpful in the past when feeling stressed about math.
First, here's an excellent YouTube video from Mathematigal talking about how not to be afraid of math:
Second, here's an article by a journalism professor dispelling his belief that he was inherently "bad at math."
Hope this helps!
Problem Set Five will go out today and come due next Monday. We've posted two tools that you might find useful for the problem set: our DFA/NFA Developer, where you can design and test DFAs and NFAs, and our Regex Developer, where you can design and test regular expressions. Both tools come with a submission feature that you can use to submit your solutions for Q1, Q2, and Q3 of the upcoming problem set. Unfortunately, these tools only let you submit assignments under a single name, so please just have one person from each group submit answers.
Hope this helps!
The first midterm exam is this Thursday night from 6PM - 9PM. The exam is held in five different locations that are divvied up by last name as follows:
If you'd like some more practice, we have three sets of practice problems you can work through and a complete practice midterm exam.
Problem Set Four goes out today. It will be our final problem set on discrete structures (functions, cardinality, relations, and the pigeonhole principle) before we begin talking about computability. The checkpoint problem is due on Monday, October 20 at 2:15PM, and the full problem set is then due on Monday, October 27 at 2:15PM as well. That way, you won't have a problem set due during the middle of our midterm week.
We've released a set of midterm review problems that you can use to practice for the upcoming midterm exam. We'll release solutions to these problems, along with additional practice problems, on Friday.
Hope this helps!
Problem Set Three goes out today. It covers graphs and mathematical logic. The problem set consists of two parts - a checkpoint problem due Monday, October 13 at the start of class, and a remaining set of problems due on Friday, October 17.
Problem Set Two goes out today. It's all about induction and variations on induction, and we hope that you have fun with it! The problem set consists of two parts - a checkpoint problem due Monday, October 6 at the start of class, and a remaining set of problems due on Friday, October 10.
Along with this handout, we've released a guide to inductive proofs that covers some specific tips and tricks for writing inductive proofs and thinking about induction. We hope you find it useful!
If you'd like a fun little diversion, check out Vi Hart's video about Pythagoras and √2.
Also, as mentioned in lecture, if you assume 1 = 0, you can prove anything, including that Winston Churchill is a carrot. Just thought I'd share that gem of wisdom with you.
Office hours will start this Monday morning. We've posted our office hours schedule under the "Resources" header. We're still finalizing room times and locations, so please check in periodically for more information.
Our office hours are working office hours in which you're welcome to stop on by and ask any questions you'd like. You can ask clarifying questions on problem sets, get feedback on your previous problem sets, review the lecture content, etc. In past quarters of CS103, a large fraction of students attended at least one section of office hours, so please don't hesitate to stop on by!
Some of the time blocks listed on the schedule are labeled DS for Discussion Section. These are optional discussion sections in which you can stop by to work through problems related to each week's problem set questions. We'll release a set of discussion questions and solutions each week. We highly recommend these discussion sections, as they'll give you more practice working through the types of problems that will come up in CS103 and beyond.
Some of our office hours are specifically marked as SCPD office hours. These office hours sections are for remote SCPD students only, and the link to enter them online will be sent out to the SCPD students mailing list right before those office hours start.
The first problem set of the quarter goes out today. It covers direct proofs, indirect proofs, and set theory. It consists of two parts - a checkpoint problem due Monday, September 29 at the start of class, and a remaining set of problems due on Friday, October 3.
Along with this handout, we've released a handout of our problem set policies, a handout with our Honor Code policies, a handout with formal set theory definitions, our guide to proofs and proofwriting, and a special handout talking about how to write indirect proofs. We strongly recommend taking the time to read through these handouts, especially the handouts on problem set policies and Honor Code policies, before starting the problem sets. We hope that the Guide to Proofs gives you a better sense of our style expectations, and the handout on indirect proofs and set theory definitions might come particularly in handy on this problem set.
The first midterm has been shifted back an hour to 6PM - 9PM. It will still be on Thursday, October 23. Sorry about that - CS103 has grown so large that we couldn't find enough rooms to hold everyone during our planned exam time!
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 email@example.com with questions.
See you soon!
38: Last Review Problems
37: Practice Final Exam
36: Cumulative Review
33: Computability Problems
32: Timeline of CS103 Results
28: Practice Problems 3
27: Practice Midterm Exam 2
25: Practice Problems 2
24: Practice Problems 1
18: Practice Midterm Exam
17: Review Problems 3
16: Review Problems 2
14: Review Problems 1
10: Guide to Induction
07: Guide to Indirect Proofs
06: Guide to Proofs
04: Set Theory Definitions
03: Honor Code
02: Problem Set Policies
00: Course Information
Problem Set Nine
Problem Set Eight (feedback link)
Problem Set Seven (feedback link)
Problem Set Six (feedback link)
Problem Set Five (feedback link)
Problem Set Four (feedback link)
Problem Set Three (feedback link)
Problem Set Two (feedback link)
Problem Set One (feedback link)
Office Hours Schedule
Truth Table Tool
Theorem and Definition Reference
Context-Free Grammar Tool
29: The Big Picture
28: NP-Completenets, Part II
27: NP-Completenets, Part I
26: Complexity Theory, Part II
25: Complexity Theory, Part I
24: Impossible Problems, Part IV
Slides (Condensed) (Addendum)
23: Impossible Problems, Part III
22: Impossible Problems, Part II
Slides (Condensed) (Quine Code)
21: Impossible Problems, Part I
20: Turing Machines, Part II
19: Turing Machines, Part I
18: Context-Free Grammars
17: Nonregular Languages
16: Regular Expressions
15: Finite Automata, Part III
14: Finite Automata, Part II
13: Finite Automata, Part I
12: Binary Relations
10: Pigeonhole Principle, Functions
09: Mathematical Logic III
08: Mathematical Logic II
07: Mathematical Logic I
05: Mathematical Induction, Part III
04: Mathematical Induction, Part II
03: Mathematical Induction, Part I
02: Indirect Proofs
01: Direct Proofs
00: Set Theory