CS/ECE 374 covers fundamental tools and techniques from theoretical computer science, including design and analysis of algorithms, formal languages and automata, computability, and complexity. Specific topics include regular and context-free languages, finite-state automata, recursive algorithms (including divide and conquer, backtracking, dynamic programming, and greedy algorithms), fundamental graph algorithms (including depth- and breadth-first search, topological sorting, minimum spanning trees, and shortest paths), undecidability, and NP-completeness. The course also has a strong focus on clear technical communication.
News
-
August 22, 2024
I have returned to teaching ECE374B! I want to thank everyone that wished me well during my hiatus and am excited to be teaching this course again in Fall 2024 with my excellent teaching assistants and my co-instructor Ivan Abraham. I hope we all (students+instructors) have a productive, enjoyable semester!
