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.

Forum (Piazza) Submit HWs (Gradescope) Gradebook (Canvas)

News

Older posts…

Schedule Quicklinks

August SunMonTueWedThuFriSat 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31
September SunMonTueWedThuFriSat 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30
October SunMonTueWedThuFriSat 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31
November SunMonTueWedThuFriSat 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30
December SunMonTueWedThuFriSat 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31

People

Faculty

Nickvash Kani
Abhishek Kumar Umrawal

Graduate Teaching Assistants

Sung Woo Jeon
Sindhu Vydana
Sandhya Perumenki
Sumedh Vemuganti
Weiyang Wang
Ziheng (Jack) Chen
Yueyi Shen
Haoyuan You
Hongbo Zheng

Undergraduate Teaching Assistants

Ayu Seiya
Qing Wang
Mike Montano
Hamza Husain
Keerthana Nallamotu
Raghav Pramod Murthy
Raghav Pramod Murthy
Ved Eti
Brian Kim
Brian Kim
Owen Xu
Anirudh Kumar
Siddhant Nanavati
Chris Deng
Ifesi Onubogu

Alumni Teaching Assistants

Sarthak Kamboj
Max Shepherd
Kaifeng Lin
Zikui Wang
Jeep Kaewla
Kevin Lim
Nicholas Bampton
Rubin Zou
Gautham Varma