Proof techniques. Deterministic models of computation. Specification of algorithmic problems and proofs of correctness. Discrete structures, their computer representation, and applications in Computer Science.
This course may not be repeated for credit.
Prerequisite(s)
- Computer Science 219 or 231.
Antirequisite(s)
- Students may not register in, or have credit for, Computer Science 251 if they have previous credit for one of Mathematics 271 or 273 or are concurrently enrolled in Mathematics 271 or 273.
Sections
| LEC 1 | TR 12:30 - 13:45
| | Peter Hoyer | | Outline |
| LEC 2 | TR 15:30 - 16:45
| | Philipp Woelfel | | Outline |
| TUT 1 | MW 09:00 - 09:50
| | | | |
| TUT 2 | TR 14:00 - 14:50
| | | | |
| TUT 3 | MW 16:00 - 16:50
| | | | |
| TUT 4 | TR 17:00 - 17:50
| | | | |
| TUT 5 | MW 09:00 - 09:50
| | | | |
| TUT 6 | TR 14:00 - 14:50
| | | | |
| TUT 7 | MW 16:00 - 16:50
| | | | |
| TUT 8 | TR 17:00 - 17:50
| | | | |
This course will be offered next in
Fall 2021.