LE/EECS 3101A: Design and Analysis of Algorithms, Winter 2024

Basic Information

Instructor: Aditya Potukuchi

Time: TR 13:00-14:30PM, LSB105

Tutorial: F 13:00PM-14:30PM, LSB103

Office Hours: T 11:00AM-12:00PM or by appointment LAS 3052B

Basic info handout

Schedule

Jan 9: Administrivia, introduction to big Oh; Reading: DPV Ch 0.3.

Jan 11: Introduction to big Oh; Reading: DPV Ch 0.3

Jan 16: Big Oh practice, Introduction to multiplication; Reading: DPV Ch 2.1

Jan 18: Karatsuba's algorithm, recurrence relations; Reading: DPV Ch 2.1, Ch 2.2

Jan 23: MergeSort; Reading: DPV Ch 2.3

Jan 25: BinarySearch, problems; Reading: none (you could check out wikipedia)

Jan 30: Medians; Reading: DPV Ch 2.4

Feb1: Practice problems

Feb 6: Introduction to graphs, graph search; Reading: DPV Ch 3.1, 3.2

Feb 8: Depth First Search, connectivity; Reading: DPV Ch 3.2, 3.3

Feb 13: Topological sort, connectivity; Reading: DPV Ch 3.3

Feb15: Review

Feb27: Topological sort, cycle finding using DFS; Reading: DPV Ch 3.3

Feb29: Breadth First Search; Reading DPV Ch 4.1, 4.2

Mar5: Review of BFS/DFS

Mar7: Dijkstra's algorithm; Reading: DPV Ch 4.4

Mar12: Intro to Dynamic Programing; Reading: DPV Ch 6.1, 6.2, 6.3