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
    29934D901Lecture1:00-3:50pmTuWTh40 of 80Victor AdamchikSGM123feesession dates
    29935R901DiscussionTBATBA40 of 80OFFICEsession dates
    29936R901QuizTBATBA40 of 80OFFICEsession dates
    29940D902Lecture1:00-3:50pmMTuW121 of 140Shahriar ShamsianSGM123notefeesession dates
    29941R902DiscussionTBATBA121 of 140OFFICEsession dates
    29942R902QuizTBATBA121 of 140OFFICEsession dates
    29937D909Lecture1:00-3:50pmTuWTh3 of 20Victor AdamchikDEN@Viterbifeesession dates
    29938R909DiscussionTBATBA3 of 20OFFICEsession dates
    29939R909QuizTBATBA3 of 20OFFICEsession dates
    29943D910Lecture1:00-3:50pmMTuW17 of 25Shahriar ShamsianDEN@Viterbifeesession dates
    29944R910DiscussionTBATBA17 of 25OFFICEsession dates
    29945R910QuizTBATBA17 of 25OFFICEsession dates
    Information accurate as of November 12, 2019 5:45 pm.