Announcements

Final Exam Location
June 6, 2018

We will have the exam in our usual lecture room, STLC 111. See you there, Friday June 8, 3:30-6:30.

Practice Midterm tonight (5/17)
May 17, 2018

Practice exam tonight 7-10pm in Gates 104.

Second Midterm exam Monday 5/21!
May 14, 2018

Hi everyone, see you a week from tonight in Cubberley, 7-10pm! (Everyone goes to Cubberley, regardless of last name.) Practice exams are now posted for you.

Midterm exam tonight!
April 30, 2018

Hi everyone, see you tonight in Cubberley, 7-10pm! (Everyone goes to Cubberley, regardless of last name. Sorry there was a mistake in the "preparing for the exam" handout that said we would have two rooms, but that was last quarter.) Best of luck to all!

Practice Midterm exam
April 26, 2018

There will be a Practice "Dress Rehearsal" Midterm TONIGHT, Thurs 4/26, 7-10pm. The location is Cubberley Auditorium. The practice exam we use for this event will be posted on the website tonight in case you aren't able to make it in person.

Pset1 posted!
April 6, 2018

Pset1 is out. Please note that the checkpoint portion (the first few warm-up problems) are due MONDAY April 9, 2:30pm.

Pset0 posted!
April 2, 2018

Your first problem set is now posted. It is due FRIDAY April 6! It is quick, but be sure to keep that deadline.

Welcome to CS103!
April 2, 2018

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.

I'll see you for our first day of class 3:00 PM - 4:20 PM in STLC 111! (STLC is the Old Chemistry building near the Oval.)

If you have any questions in the meantime, feel free to email me at cbl@cs.stanford.edu.

See you soon!

Handouts

29: Induction Checklist
28: Guide to Induction
21: Preparing for the Exam
18: Discrete Structures Checklist
17: Guide to Discrete Structures
14: Logic Translation Checklist
12: Proofwriting Checklist
11: Ten Techniques to Get Unstuck
10: Guide to Indirect Proofs
09: Mathematical Vocabulary
08: Guide to Proofs
07: Set Theory Definitions
06: How to Succeed
05: Problem Set Policies
04: Honor Code
02: Math Prereqs
01: Syllabus
00: Course Information

Assignments

Problem Set 9

Problem Set 8 Problem Set 7 Problem Set 6 Problem Set 5 Problem Set 4 Problem Set 3 Problem Set 2 Problem Set 1 Problem Set 0

Practice Problems

Practice Final Exam 6
  (solutions)
Practice Final Exam 5
  (solutions)
Practice Final Exam 4
  (solutions)
Practice Final Exam 3
  (solutions)
Practice Final Exam 2
  (solutions)
Practice Final Exam 1
  (solutions)
Extra Practice Problems 3
  (solutions)
Practice Second Midterm 6 (dress rehearsal exam)
  (solutions)
Practice Second Midterm 5
  (solutions)
Practice Second Midterm 4
  (solutions)
Practice Second Midterm 3
  (solutions)
Practice Second Midterm 2
  (solutions)
Practice Second Midterm 1
  (solutions)
Extra Practice Problems 2
  (solutions)
Practice Midterm 4
  (solutions)
Practice Midterm 4
  (solutions)
Practice Midterm 3
  (solutions)
Practice Midterm 2
  (solutions)
Practice Midterm 1
  (solutions)
Extra Practice Problems 1
  (solutions)

Exams

Final Exam
  (solutions)
Midterm Exam 2
  (solutions)
Midterm Exam 1
  (solutions)

Resources

Course Reader
CS103A Website
Guide to ∈ and ⊆
Qt Creator
Office Hours Calendar
Truth Table Tool
Guide to Negations
Guide to Logic Translations
Guide to Cantor's Theorem
DFA/NFA Editor
Regex Editor
Regex Equivalence Tester
CFG Editor
TM Editor
Guide to Self-Reference
Guide to the Lava Diagram

Lectures

27: Big Picture and Next Steps
   Slides

26: Complexity Theory II
   Slides

25: Complexity Theory I
   Slides

24: Unsolvable Problems II
   Slides

23: Unsolvable Problems
   Slides quine.cc

22: Turing Machines III
   Slides

21: Turing Machines II
   Part1 Part2 Part3 Part4

20: Turing Machines I
   Part1 Part2 Part3 Part4 Part5 Part6

19: Context-Free Languages
   Slides

18: Non-Regular Languages
   Slides

17: Regular Expressions
   Slides

16: Finite Automata III (DFA-NFA equiv)
   Part1 Part2 Part3

15: Finite Automata II (NFAs)
   Part1 Part2 Part3

14: Finite Automata (DFAs)
   Slides

13: Induction
   Slides

12: Induction
   Slides

11: Graphs II: Pigeonhole
   Slides

10: Graphs I
   Slides (Part 1) Slides (Part 2)

09: Cardinality
   Slides

08: Binary Relations III
   Slides

07: Binary Relations II
   Slides

06: Binary Relations
   Slides

05: More Predicate Logic
   Slides

04: Predicate Logic
   Slides

03: Propositional Logic
   Slides

02: Indirect Proofs
   Slides

01: Proof-Writing
   Slides

00: Set Theory
   Slides