CS 374
Spring 2017 Part of Term 1
Jan 17-May 3
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: CS 225; MATH 225 or MATH 415.
| CRN | Type | Section | Time | Day | Location | Instructor | Section Details | |
|---|---|---|---|---|---|---|---|---|
|
65088
|
Lecture
|
AL1
|
11:00AM
-12:15PM
|
TR
|
Electrical & Computer Eng Bldg
|
Chekuri, C
|
|
|
|
65090
|
Discussion/
Recitation |
AYB
|
10:00AM
-10:50AM
|
WF
|
Siebel Center for Comp Sci
|
Chekuri, C
|
|
|
|
65091
|
Discussion/
Recitation |
AYC
|
11:00AM
-11:50AM
|
WF
|
Siebel Center for Comp Sci
|
Chekuri, C
|
|
|
|
65092
|
Discussion/
Recitation |
AYD
|
12:00PM
-12:50PM
|
WF
|
Siebel Center for Comp Sci
|
Chekuri, C
|
|
|
|
65093
|
Discussion/
Recitation |
AYE
|
1:00PM
-1:50PM
|
WF
|
Siebel Center for Comp Sci
|
Chekuri, C
|
|
|
|
65094
|
Discussion/
Recitation |
AYF
|
2:00PM
-2:50PM
|
WF
|
Siebel Center for Comp Sci
|
Chekuri, C
|
|
|
|
65095
|
Discussion/
Recitation |
AYG
|
3:00PM
-3:50PM
|
WF
|
Siebel Center for Comp Sci
|
Chekuri, C
|
|
|
|
65096
|
Discussion/
Recitation |
AYH
|
1:00PM
-1:50PM
|
WF
|
Siebel Center for Comp Sci
|
Chekuri, C
|
|
|
|
65097
|
Discussion/
Recitation |
AYJ
|
2:00PM
-2:50PM
|
WF
|
Siebel Center for Comp Sci
|
Chekuri, C
|
|
|
|
65098
|
Discussion/
Recitation |
AYK
|
3:00PM
-3:50PM
|
WF
|
Siebel Center for Comp Sci
|
Chekuri, C
|
|
|
|
65835
|
Discussion/
Recitation |
AYL
|
4:00PM
-4:50PM
|
WF
|
Siebel Center for Comp Sci
|
Chekuri, C
|
|