University of Calgary

CPSC 351 - Theoretical Foundations of Computer Science II - Fall 2022

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.

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 1MWF 11:00 - 11:50
    Philipp WoelfelOutline
    TUT 1MW 15:00 - 15:50
    TUT 2TR 11:00 - 11:50
    TUT 3TR 14:00 - 14:50
    TUT 4MW 17:00 - 17:50
    TUT 5MW 12:00 - 12:50
    TUT 6MW 13:00 - 13:50
    TUT 7MW 08:00 - 08:50
This course will be offered next in Winter 2023.
Powered by UNITIS. More features.