Computer Science 570:

Analysis of Algorithms (4.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
    29958D634Lecture1:00-3:25pmTuWTh55 of 70Victor AdamchikOHE136feesession dates
    30063D634Lecture1:00-3:25pmTuWTh11 of 70Victor AdamchikWPHB27notefeesession dates
    29959R634DiscussionTBATBA66 of 140OFFICEsession dates
    29960R634QuizTBATBA66 of 140OFFICEsession dates
    29961D586Lecture1:00-3:25pmTuWTh4 of 20Victor AdamchikDEN@Viterbifeesession dates
    29962R586DiscussionTBATBA4 of 20OFFICEsession dates
    29963R586QuizTBATBA4 of 20OFFICEsession dates
    30331D901Lecture1:00-3:50pmMTuW36 of 40Shahriar ShamsianOHE100Cfeesession datesbook list
    30042R901DiscussionTBATBA36 of 40OFFICEsession dates
    30049R901QuizTBATBA36 of 40OFFICEsession dates
    30164D909Lecture1:00-3:50pmMTuW10 of 20Shahriar ShamsianDEN@Viterbifeesession datesbook list
    30171R909DiscussionTBATBA10 of 20DEN@Viterbisession dates
    30165R909QuizTBATBA10 of 20DEN@Viterbisession dates
    Information accurate as of September 7, 2017 5:01 pm.