This course presents an introduction to the mathematical foundations of computer science, with an emphasis on mathematical reasoning, combinatorial analysis, discrete structures, applications and modeling, and algorithmic thinking. Topics include sets, functions, relations, algorithms, number theory, matrices, mathematical reasoning, counting, graphs and trees. Antirequisite(s): Mathematics 2151A/B, Mathematics 2155A/B, the former Software Engineering 2251A/B Prerequisite(s): Computer Science 1027A/B, 1037A/B, or Computer Science 2101A/B, in each case with at least 65%, and one full course or equivalent chosen from the following, with at least 60% in each: Applied Mathematics 1201A/B or the former Calculus 1201A/B, Applied Mathematics 1413, Calculus 1000A/B, 1100A/B, 1301A/B, 1500A/B, 1501A/B, Mathematics 1600A/B or the former Linear Algebra 1600A/B, or permission of the Department. Corequisite(s): Pre-or Corequisite(s): Extra Information: 3 lecture hours, 1 laboratory/tutorial hour, 0.5 course back to top
