Alexander Dyson’s Profile Student Toggle navigation

This course introduces the foundations of discrete mathematics as they apply to computer science, focusing on providing a solid theoretical foundation for further work. Topics include functions, relations, sets, simple proof techniques, Boolean algebra, propositional logic, elementary number theory, writing, analyzing and testing algorithms.

This course introduces the foundations of discrete mathematics as they apply to computer science, focusing on providing a solid theoretical foundation for further work. Topics include functions, relations, sets, simple proof techniques, Boolean algebra, propositional logic, elementary number theory, writing, analyzing and testing algorithms.

Topics include Taylor polynomials, Mean Value Theorem, Taylor and Maclaurin series, tests of convergence, techniques of integration, improper integrals, areas, volumes and arc lengths.

Topics include Taylor polynomials, Mean Value Theorem, Taylor and Maclaurin series, tests of convergence, techniques of integration, improper integrals, areas, volumes and arc lengths.

Topics in course Calculus 1 include functions, limits, differentiation, and tangent lines, L’Hôpital’s Rule, Fundamental Theorem of Calculus and Applications.

Topics in course Calculus 1 include functions, limits, differentiation, and tangent lines, L’Hôpital’s Rule, Fundamental Theorem of Calculus and Applications.