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 |
---|---|---|---|---|---|---|---|---|---|
29929R | 001 | Lecture | 10:00-11:50am | Mon, Wed | Canceled | ![]() ![]() | |||
29934D | 001 | Lecture | 3:30-4:50pm | Mon, Wed | Canceled | ![]() ![]() ![]() | |||
30230R | 001 | Lecture | 2:00-3:20pm | Mon, Wed | Canceled | ![]() ![]() | |||
29935R | 001 | Discussion | 5:00-5:50pm | Wednesday | Canceled | ![]() | |||
29936R | 001 | Discussion | 3:30-4:20pm | Thursday | Canceled | ![]() | |||
30382R | 001 | Discussion | 10:00-10:50am | Friday | Canceled | ![]() |