Computer Science 570:

Analysis of Algorithms (3.0 units)

Explores fundamental techniques such as recursion, Fourier transform ordering, dynamic programming for efficient algorithm construction. Examples include arithmetic, algebraic, graph, pattern matching, sorting, searching algorithms.
  • Note: Register for lecture and discussion.
SectionSessionTypeTimeDaysRegisteredInstructorLocationSyllabusInfo
30101D048Lecture6:40-9:20pmWednesday329 of 331Shahriar ShamsianSGM123notefeesession datesbook list
30102D048Lecture6:50-9:30pmThursday242 of 243Shahriar ShamsianSGM124notefeesession datesbook list
29911R048Discussion9:00-9:50amFriday
57 of 57
Jeffrey MillerVKC100session dates
29912R048Discussion11:00-11:50amFriday56 of 57Michael ShindlerTHH212session dates
29915R048Discussion9:00-9:50amFriday
58 of 58
Michael ShindlerGFS101session dates
29928D048Discussion1:00-1:50pmFriday
57 of 57
Michael ShindlerVKC100session dates
30000R048Discussion12:00-12:50pmFriday
57 of 57
Shahriar ShamsianTHH114session dates
30107R048Discussion12:00-12:50pmFriday57 of 58Jeffrey MillerVKC100session dates
30199R048Discussion11:00-11:50amFriday
57 of 57
Jeffrey MillerSOSB46session dates
30204R048Discussion1:00-1:50pmFriday
58 of 58
Shahriar ShamsianOHE100Dsession dates
30271R048Discussion10:00-10:50amFriday56 of 57Michael ShindlerTHH212session dates
30399R048Discussion10:00-10:50amFriday
58 of 58
Jeffrey MillerSOSB46session dates
30099D034Lecture6:50-9:30pmThursday17 of 20Shahriar ShamsianDEN@Viterbinotefeesession datesbook list
30253R034Discussion1:00-1:50pmFriday17 of 20Shahriar ShamsianDEN@Viterbisession dates
Information accurate as of 9/23/2014 4:03 PM.