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.
    29934D901Lecture12:00-2:50pmMWTh33 of 240Victor AdamchikSGM124feesession dates
    29935R901DiscussionTBATBA33 of 240OFFICEsession dates
    29936R901QuizTBATBA33 of 240OFFICEsession dates
    29940R902Lecture2:00-4:50pmTuWTh106 of 240Shahriar ShamsianSGM124feesession dates
    29941R902DiscussionTBATBA106 of 240OFFICEsession dates
    29942R902QuizTBATBA106 of 240OFFICEsession dates
    30340D909Lecture12:00-2:50pmMWTh2 of 25Victor AdamchikDEN@Viterbifeesession dates
    30341R909DiscussionTBATBA2 of 25DEN@Viterbisession dates
    30342R909QuizTBATBA2 of 25DEN@Viterbisession dates
    30039D910Lecture2:00-4:50pmTuWTh10 of 25Shahriar ShamsianDEN@Viterbifeesession dates
    30040R910DiscussionTBATBA10 of 25DEN@Viterbisession dates
    30041R910QuizTBATBA10 of 25DEN@Viterbisession dates
    Information accurate as of September 23, 2020 11:00 am.
    The Fall 2020 semester will begin with fully remote instruction, with limited exceptions for clinical education. Faculty will contact students to provide information to login to classes. Read more.