University of Calgary
CPSC 351 - Theoretical Foundations of Computer Science II - Winter 2023
Probability spaces, random variables, expectation, independence, concentration bounds, conditional probability, repeated trials, error bounds. Turing machines and finite automata. Deterministic, nondeterministic and probabilistic models of computation. Languages, regular languages and regular expressions. Methods for classifying computational problems as decidable or undecidable.
This course may not be repeated for credit.This course will be offered next in Fall 2023.
This course may not be repeated for credit.
Hours
- (3-2T)
Prerequisite(s)
- 3 units from Computer Science 219, 233 or 235; and Computer Science 251 or with department consent Statistics 213 and either Mathematics 271 or 273; and 3 units from Mathematics 249, 265 or 275; and Philosophy 279 or 377.
Antirequisite(s)
- Credit for Computer Science 351 and Computer Science 313 will not be allowed.
Sections
LEC 1 MWF 14:00 - 14:50 SB 103 Wayne Michael Eberly Outline LEC 2 MWF 11:00 - 11:50 ENE 239 Wayne Michael Eberly Outline TUT 1 MW 12:00 - 12:50 MS 205 TUT 2 MW 17:00 - 17:50 KNA 120 TUT 3 MW 15:00 - 15:50 ST 063 TUT 4 TR 18:00 - 18:50 MS 205 TUT 5 MW 09:00 - 09:50 KNA 120 TUT 6 MW 13:00 - 13:50 ST 057 TUT 7 MW 16:00 - 16:50 ST 061 TUT 8 TR 16:00 - 16:50 KNA 120 TUT 9 MW 08:00 - 08:50 TBA TUT 10 TR 08:00 - 08:50 MS 205
Powered by UNITIS. More features.