This course explores the theoretical foundations of computation at various levels of abstraction. Specific topics include graph theory and related algorithms; functional programming with an emphasis on recursion and recurrences; the description of languages using formalisms such as regular expressions, finite state machines, and context free grammars; and digital logic and its application to sequential and combinational circuits. Prerequisite: CSC 122 and Math123. Offered each semester. Not offered pass/fail.
|CSC 122 and MATH 123||1 course|