CSE 40113 Design/Analysis of Algorithms, Spring 2023

General Information

For course policies, please see [logistics].

For online Q&A and discussion, please go to [slack].

For assignment submission, please go to “Gradescope” on Canvas.

For office hours, please see [schedule].

For some preliminaries, please see [preliminaries].

Visualization of various sorting algorithms [link].

All the source files/solutions etc. will be shared with any faculty/teachers (whether ND or not) upon request.

Exams

Sample examsSupplementary materialsSolution
Midterm-2022Guide
Collaboration Doc
solution

Assignments

AssignmentSupplementary materialsSolutionDeadline
(11PM by default)
WA01 on GradescopeN/AOn GradescopeJan 20th
WA02latex sourcesolutionJan 27th
WA03latex sourcesolutionFeb 3rd
WA04latex sourcesolutionFeb 10th
WA05latex sourcesolutionFeb 17th
WA06latex sourcesolutionFeb 26th
WA07latex sourcesolutionMar 3rd
WA08latex sourcesolutionMar 24th
WA09latex sourcesolutionMar 31st

Lectures

DateLecture #TopicPPTExtra NoteCLRS to read
01/17
TUE
01Intro. to Algorithmsppt
01/19
THU
02Complexity Analysispptnotepp 16-29, 43-52
01/24 TUE03Complexity/Correctness Analysispptpp 24-38
01/26 WED04Divide and Conquerpptnote
01/31 TUE05Divide and Conquer 2pptpp 88-93
02/02 WED06Randomized Algorithmspptpp 114-124
02/07 TUE07Quicksortpptpracticepp 170-181, 191-193
02/09 THU08Linear Time Algorithmspptpp 194-204, 220-222
02/14 TUE09Heapspptpp 151-166
02/16 THU10Hash Tablespptnotepp 253-260
02/21 TUE11Dynamic Programming 1pptnotepp 359-369
02/23 THU12Dynamic Programming 2pptrunning example
02/28 TUE13Dynamic Programming 3ppt
03/02 THU14Greedy Algorithm 1pptnotepp 414-421
03/07 TUEExamppt
03/09 THU15Greedy Algorithm 2ppt
03/21 TUE16Amortized Analysis 1pptpp 451-462
03/23 THU17Amortized Analysis 2pptpp 465-471
03/28 TUE18Amortized Analysis 3 & Fib-Heap 1ppt

https://wheelofnames.com/cmd-7zj