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
    29940D184Lecture12:00-2:30pmMTuWTh46 of 70Victor AdamchikOHE132feesession dates
    29941R184DiscussionTBATBA47 of 70OFFICEsession dates
    29942R184QuizTBATBA47 of 70OFFICEsession dates
    29943D554Lecture12:00-2:30pmMTuWTh3 of 20Victor AdamchikDEN@Viterbifeesession dates
    29944R554DiscussionTBATBA3 of 20DEN@Viterbisession dates
    29945R554QuizTBATBA3 of 20DEN@Viterbisession dates
    29946D902Lecture2:00-4:50pmMTuW40 of 70Shahriar ShamsianOHE136notefeesession datesbook list
    29947R902DiscussionTBATBA40 of 70OFFICEsession dates
    29948R902QuizTBATBA40 of 70OFFICEsession dates
    29949D910Lecture2:00-4:50pmMTuW13 of 20Shahriar ShamsianDEN@Viterbifeesession datesbook list
    29950R910DiscussionTBATBA13 of 20DEN@Viterbisession dates
    29951R910QuizTBATBA13 of 20DEN@Viterbisession dates
    Information accurate as of February 15, 2019 2:46 pm.