Document Type
Syllabus
Publication Date
Fall 9-1-2024
Course Description
This course explores advanced data structures and the theoretical foundations of computation at various levels of abstraction. Specic 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, nite state machines, and context-free grammars.
Recommended Citation
Howard, Brian, "CSC 296A&B Tps:Algorithmic Foundations of Computation Howard Fall 2024" (2024). All Course Syllabi. 719, Scholarly and Creative Work from DePauw University.
https://scholarship.depauw.edu/records_syllabi/719
COinS
Student Outcomes
Students will be able to understand programs and solve problems with a functional programming language Students will be able to solve various graph-oriented problems, including using search algorithms, using minimum-spanning tree algorithms, and using shortest paths algorithms Students will be able to recognize and apply standard models of computation, including nite state machines, context-free grammars, and recursive functions.