All Courses

Foundations of computational problem solving and mathematical techniques commonly used in computer science. Emphasis on analytical and logical skills, including an introduction to Boolean logic and proof techniques. Topics include set theory, permutations and combinations, mathematical induction, asymptotic analysis, recursion, regular expressions, searching and sorting, basic data structures, and graph theory. Topics are reinforced through extensive experiments in Python and Jupyter Notebooks, as well as a brief sojourn into functional programming. Prepares students for 200- and 300-level courses requiring mathematical underpinnings of computer science.