Lecture. A systematic study of the design and efficiency analysis of algorithms. Coverage of fundamental techniques of algorithms such as greedy, divide-and-conquer, dynamic programming, graph techniques, probabilistic, and parallel. An introduction to computational complexity theory: problem reduction, NP-complete problems, and other complexity classes. Prerequisites: CS 3100 and MATH 2300. (Spring)
| Updated1 | Course Id | Units | Day | Time | Room | Location | Instructor | Additional Course Fees |
Availability2 |
|---|---|---|---|---|---|---|---|---|---|
| 3/26/2026 1:01 PM | CS 4440 001 | 3 |
TR |
2:00P - 3:15P |
DBH 165 |
TURLOCK |
Liang, Xuejun |
$0.00 | WAIT |