CPSC251
Download as PDF
Theoretical Foundations of Computer Science I
Computer Science
SC - Faculty of Science
Subject
CPSC - Computer Science
Description
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.
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.
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.
Course Attributes
Fee Rate Group(Domestic) - A, Fee Rate Group(International) -A, GFC Hours (3-2T)
Courses may consist of a Lecture, Lab, Tutorial, and/or Seminar. Students will be required to register in each component that is required for the course as indicated in the schedule of classes. Practicums, internships or other experiential learning modalities are typically indicated as a Lab component.
Component
LEC
Component
TUT
Units
3
Repeat for Credit
No
Subject code
CPSC
Understanding Course Information
Please refer to Course Terminology and Description to better understand how to interpret course information such as GFC Hours, pre-requisites, course levels, etc.