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.
    SectionSessionTypeTimeDaysRegisteredInstructorLocationSyllabusInfo
    30331D901Lecture10:30-12:10pmMTuWTh51 of 75Shahriar ShamsianOHE132feesession datesbook list
    30042R901DiscussionTBATBA51 of 80OFFICEsession dates
    30049R901QuizTBATBA52 of 100TBAsession dates
    30032D909Lecture10:30-12:10pmMTuWTh5 of 20Shahriar ShamsianDEN@Viterbifeesession datesbook list
    30043R909DiscussionTBATBA5 of 20DEN@Viterbisession dates
    30050R901QuizTBATBA4 of 20DEN@Viterbisession dates
    30159D558Lecture2:30-5:20pmTue, Thu14 of 40Jeffrey Miller,Michael ShindlerRTH109feesession dates
    30160R558Discussion1:30-2:15pmTue, Thu14 of 40OHE122session dates
    30161R558Quiz1:00-2:50pmWednesday14 of 40KAP156session dates
    Information accurate as of 7/27/2015 2:19 PM.