University of Calgary
CPSC 251 - Theoretical Foundations of Computer Science I - Winter 2023
Proof techniques. Recursion and iteration. Specification of algorithmic problems, proofs of correctness, and bounds on their computational complexity. Discrete structures such as graphs, trees, strings, functions, and their computer representation. Counting, permutations, discrete probability spaces, random events. Applications in Computer Science.
This course may not be repeated for credit.This course will be offered next in Summer 2023.
This course may not be repeated for credit.
Hours
- (3-2T)
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 ENA 103 Peter Hoyer Outline LEC 2 TR 15:30 - 16:45 ENA 103 Peter Hoyer Outline LEC 3 MWF 10:00 - 10:50 ICT 121 Outline TUT 1 MW 09:00 - 09:50 ST 027A TUT 2 TR 14:00 - 14:50 SA 243 TUT 3 MW 16:00 - 16:50 ST 027 TUT 4 TR 17:00 - 17:50 SA 243 TUT 5 MW 09:00 - 09:50 ST 027 TUT 6 TR 14:00 - 14:50 EEEL 151 TUT 7 MW 16:00 - 16:50 SA 243 TUT 8 TR 17:00 - 17:50 EEEL 151 TUT 9 TR 10:00 - 10:50 MS 205 TUT 10 MW 11:00 - 11:50 SA 243 TUT 11 TR 08:00 - 08:50 EEEL 151 TUT 12 TR 08:00 - 08:50 SA 243 TUT 13 TR 09:00 - 09:50 ST 061 TUT 14 TR 09:00 - 09:50 EDC 276 TUT 15 TR 11:00 - 11:50 EEEL 151 TUT 16 TR 11:00 - 11:50 SA 243
Powered by UNITIS. More features.