University of Calgary

CPSC 251 - Theoretical Foundations of Computer Science I - Summer 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.

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 09:00 - 11:45
    Austin DochertyOutline
    TUT 1MW 09:00 - 10:50
    TUT 2MW 13:00 - 14:50
    TUT 3TR 12:00 - 13:50
    TUT 4TR 14:00 - 15:50
This course will be offered next in Fall 2023.
Powered by UNITIS. More features.