Courses
CSC 236 Algorithmic Foundations of Computation (formerly CSC 233)
This course explores advanced data structures and the theoretical foundations of computation at various levels of abstraction. Specific topics include graph theory and related algorithms; analysis of algorithms; dynamic programming; functional programming with an emphasis on recursion and recurrences; and the description of languages using formalisms such as regular expressions, finite state machines, and context-free grammars. Prerequisite: CSC 235. Offered each semester. Not offered pass/fail.
Prerequisites
CSC 235
Credits
1 course
Fall Semester information
Brian Howard236A: Algorithmic Foundations of Computation
Brian Howard
236B: Algorithmic Foundations of Computation
Spring Semester information
Staff236A: Algorithmic Foundations
Staff