Computer Science 271:
Discrete Methods in Computer Science (3.0 units)
Models for discrete structures; finite state automata, regular sets. Selected applications of logic and combinatorics to program correctness, algorithms and complexity, programming language semantics and databases.
- Prerequisite: CSCI 102
- Note: Register for lecture and one discussion
| Section | Session | Type | Time | Days | Registered | Instructor | Location | Syllabus | Info |
|---|---|---|---|---|---|---|---|---|---|
| 29934R | 001 | Lecture | 2:00-3:20pm | Tue, Thu | 34 of 60 | David Wilczynski | SOSB46 |    | |
| 29935R | 001 | Discussion | 11:00-11:50am | Monday | 20 of 30 | GFS107 | | ||
| 29936R | 001 | Discussion | 1:00-1:50pm | Thursday | 14 of 30 | VKC201 | |