ECE374-B Archive: Home

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.

Dedication

One of the most important things I've learned teaching a large course is that one's success is predicated on the abilities of the company he/she keeps and I have been very lucky to have great company. In particular, I would like to thank Sariel Har-Peled and Andrew Miller for being great co-instructors. Most of all, I would also like to thank my amazing graduate and undergraduate teaching assistants that have shown so much dedication to the students and helped prop me up even when I was completely overwhelmed. Teaching assistants make or break the course and these guys definitely made it.

News

August 26, 2025
I am back teaching ECE374B in the Fall 2025 semester! I am blessed to be teaching this course again in Fall 2024 with my excellent teaching assistants. I hope we all (students+instructors) have a productive, enjoyable semester!
February 01, 2025
Award-winning TA, Mr. Sumedh Vemuganti’s discussion section recordings are now available to view! Sumedh’s passion for teaching and computer science is unmatched and I highly recommend his recordings!

Older posts…

Schedule Quicklinks