University of Calgary

CPSC 251 - Theoretical Foundations of Computer Science I - Winter 2024

Proof techniques. Recursion and iteration. Specification of algorithmic problems and fundamental proof techniques in Computer Science. Discrete structures such as graphs, trees, strings, functions, and their computer representation. Counting, permutations. Random events. Conditional events. Applications in Computer Science.
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 1TR 12:30 - 13:45
    Renate ScheidlerOutline
    LEC 2TR 15:30 - 16:45
    Janet LeahyOutline
    LEC 3MWF 10:00 - 10:50
    Austin DochertyOutline
    TUT 1MW 09:00 - 09:50
    TUT 2TR 14:00 - 14:50
    TUT 3MW 16:00 - 16:50
    TUT 4TR 17:00 - 17:50
    TUT 5MW 09:00 - 09:50
    TUT 6TR 14:00 - 14:50
    TUT 7MW 16:00 - 16:50
    TUT 8TR 17:00 - 17:50
    TUT 9TR 10:00 - 10:50
    TUT 10MW 11:00 - 11:50
    TUT 11TR 08:00 - 08:50
    TUT 12TR 08:00 - 08:50
    TUT 13TR 09:00 - 09:50
    TUT 14TR 09:00 - 09:50
    TUT 15TR 11:00 - 11:50
    TUT 16TR 11:00 - 11:50
    TUT 17TR 10:00 - 10:50
Powered by UNITIS. More features.