University of Calgary

CPSC 351 - Theoretical Foundations of Computer Science II - Winter 2024

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 Statistics 213; and 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 14:00 - 14:50
    Ali JamadiOutline
    LEC 2MWF 10:00 - 10:50
    Philipp WoelfelOutline
    TUT 1MW 12:00 - 12:50
    TUT 2MW 17:00 - 17:50
    TUT 3MW 15:00 - 15:50
    TUT 4TR 18:00 - 18:50
    TUT 5MW 09:00 - 09:50
    TUT 6MW 13:00 - 13:50
    TUT 7MW 16:00 - 16:50
    TUT 8TR 16:00 - 16:50
    TUT 9MW 08:00 - 08:50
    TUT 10TR 08:00 - 08:50
    TUT 11MW 08:00 - 08:50
This course will be offered next in Fall 2024.
Powered by UNITIS. More features.