CS 374
Summer 2025 Part of Term SF
May 19-Aug 7
Credit: 4 hours.
Analysis of algorithms, major paradigms of algorithm design including recursive algorithms, divide-and-conquer algorithms, dynamic programming, greedy algorithms, and graph algorithms. Formal models of computation including finite automata and Turing machines. Limitations of computation arising from fundamental notions of algorithm and from complexity-theoretic constraints. Reductions, undecidability and NP-completeness.
Same as ECE 374. Prerequisite: One of CS 173, MATH 213; CS 225.
| CRN | Type | Section | Time | Day | Location | Instructor | Section Details | |
|---|---|---|---|---|---|---|---|---|
|
42186
|
Discussion/
Recitation
Lecture
|
AL1
AL1
|
10:00AM
-11:20AM
ARRANGED
|
TR
n.a.
|
Electrical & Computer Eng Bldg
Location Pending
|
Kani, N
Kani, N
|
|
|
|
42237
|
Online Discussion
Online Lecture
|
OL1
OL1
|
10:00AM
-11:20AM
ARRANGED
|
TR
n.a.
|
n.a.
n.a.
|
Kani, N
Kani, N
|
|