Theoretical Foundations of Computer Science I

3 credits · Undergraduate Programs

Recursion and iteration. Specification of algorithmic problems. Fundamental proof techniques in computer science. Discrete structures such as sets, graphs, trees, strings, sequences, and their computer representations. 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.