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!
Schedule Quicklinks
People
Faculty
Nickvash Kani
kani@illinois.edu
Ivan Abraham
itabrah2@illinois.edu
Graduate Teaching Assistants
Sung Woo Jeon
sjeon12@illinois.edu
Sumedh Vemuganti
sumedh2@illinois.edu
Weiyang Wang
weiyang7@illinois.edu
Ziheng (Jack) Chen
zihengc2@illinois.edu
Hongbo Zheng
hongboz2@illinois.edu
Neeraj Gangwar
gangwar2@illinois.edu
Suyuan Wang
suyuan2@illinois.edu
Owen Xu
jinyuxu2@illinois.edu
Tue Ngoc Do
tuedo2@illinois.edu
Undergraduate Teaching Assistants
Ved Eti
vedeti2@illinois.edu
Brian Kim
brianhk2@illinois.edu
Vishesh Prasad
vprasad3@illinois.edu
Anirudh Kumar
kumar67@illinois.edu
Siddhant Nanavati
ssn5@illinois.edu
Chris Deng
zdeng14@illinois.edu
Pratyush Thakur
pthakur3@illinois.edu
Atharva Jain
atharva7@illinois.edu
Shreyas Sriram
ssrir5@illinois.edu
Eric Carl Roth
ericcr2@illinois.edu
William Ou
ou14@illinois.edu
Terence Zeng
terence6@illinois.edu
Skyler Gao
szgao2@illinois.edu
Kyle Chung
kbchung2@illinois.edu
Ben Kim
bdkim4@illinois.edu