Computer Science 271:
Discrete Methods in Computer Science (3.0 units)
Propositional and First-Order Logic; General Proof Techniques,Proofs by Induction; Applications to Program Verification; Counting/ Discrete Probability; Graphs, Trees, other discrete structures; Basic algorithms and complexity.
| Section | Session | Type | Time | Days | Registered | Instructor | Location | Syllabus | Info |
|---|---|---|---|---|---|---|---|---|---|
| 29934D | 001 | Lecture | 2:00-3:20pm | Tue, Thu | 94 of 102 | David Kempe | WPHB27 |    | |
| 29935R | 001 | Discussion | 11:00-11:50am | Monday | 50 of 52 | VKC156 | | ||
| 29936D | 001 | Discussion | 11:00-11:50am | Friday | 44 of 52 | GFS116 | |