Course - Design and Analysis of Algorithms HT23

Created: January 14, 2023

---

“This core course covers good principles of algorithm design, elementary analysis of algorithms, and fundamental data structures. The emphasis is on choosing appropriate data structures and designing correct and efficient algorithms to operate on these data structures”.

• Course Webpage
• Related course: [[Course - Imperative Programming I and II HT23]]^U
• Predecessor to: [[Course - Algorithms and Data Structures HT24]]^U
• Other courses this term: [[Courses HT23]]^U

Notes

• [[Notes - DAA HT23, Asymptotic notation]]^U
• [[Notes - DAA HT23, Breadth-first search]]^U
• [[Notes - DAA HT23, Depth-first search]]^U
• [[Notes - DAA HT23, Disjoint sets]]^U
• [[Notes - DAA HT23, Divide-and-conquer]]^U
• [[Notes - DAA HT23, Dynamic programming]]^U
• [[Notes - DAA HT23, Fast Fourier Transform]]^U
• [[Notes - DAA HT23, Graphs]]^U
• [[Notes - DAA HT23, Greedy algorithms]]^U
• [[Notes - DAA HT23, Heaps]]^U
• [[Notes - DAA HT23, Matroids]]^U
• [[Notes - DAA HT23, Maximum segment sum]]^U
• [[Notes - DAA HT23, Minimum spanning trees]]^U
• [[Notes - DAA HT23, Order statistics]]^U
• [[Notes - DAA HT23, Shortest paths and relaxation]]^U
• [[Notes - DAA HT23, Sorting]]^U
• [[Notes - DAA HT23, Strongly connected components]]^U
• [[Notes - DAA HT23, All the algorithms]]^U

Problem Sheets

• Sheet 1 (answers to select problems)
• Sheet 2 (answers to select problems)
• Sheet 3 (answers to select problems)
• Sheet 4 (answers to select problems)

Lectures

• [[Lecture - DAA HT23, I]]^U
• [[Lecture - DAA HT23, II]]^U
• [[Lecture - DAA HT23, III]]^U
• [[Lecture - DAA HT23, IV]]^U
• [[Lecture - DAA HT23, V]]^U
• [[Lecture - DAA HT23, VI]]^U
• [[Lecture - DAA HT23, VII]]^U
• [[Lecture - DAA HT23, VIII]]^U
• [[Lecture - DAA HT23, IX]]^U
• [[Lecture - DAA HT23, X]]^U
• [[Lecture - DAA HT23, XI]]^U
• [[Lecture - DAA HT23, XII]]^U
• [[Lecture - DAA HT23, XIII]]^U
• [[Lecture - DAA HT23, XIV]]^U
• [[Lecture - DAA HT23, XV]]^U
• [[Lecture - DAA HT23, XVI]]^U

---

Related posts

• [[Notes - DAA HT23, Divide-and-conquer]]^U

  (incoming)
• [[Notes - DAA HT23, Graphs]]^U

  (incoming)
• [[Notes - DAA HT23, Disjoint sets]]^U

  (incoming)
• [[Notes - DAA HT23, Order statistics]]^U

  (incoming)
• [[Notes - DAA HT23, Strongly connected components]]^U

  (incoming)
• [[Course - Imperative Programming I and II HT23]]^U

  (incoming)
• [[Notes - DAA HT23, Heaps]]^U

  (incoming)
• [[Notes - DAA HT23, Shortest paths and relaxation]]^U

  (incoming)
• [[Notes - DAA HT23, Depth-first search]]^U

  (incoming)
• [[University Notes]]^U

  (incoming)
• [[Notes - DAA HT23, Dynamic programming]]^U

  (incoming)
• [[Notes - DAA HT23, Sorting]]^U

  (incoming)
• [[Notes - DAA HT23, Asymptotic notation]]^U

  (incoming)
• [[List of algorithms to memorise for DAA]]^U

  (incoming)
• [[Courses HT23]]^U

  (incoming)
• [[Notes - DAA HT23, Matroids]]^U

  (incoming)
• [[Course - Algorithms and Data Structures HT24]]^U

  (incoming)
• [[Notes - DAA HT23, Greedy algorithms]]^U

  (incoming)
• [[Notes - DAA HT23, Breadth-first search]]^U

  (incoming)
• [[Notes - DAA HT23, All the algorithms]]^U

  (incoming)
• [[Notes - DAA HT23, Minimum spanning trees]]^U

  (incoming)
• [[Notes - DAA HT23, Fast Fourier Transform]]^U

  (incoming)
• [[Lecture - DAA HT23, IV]]^U

  (sim: 0.631)
• [[Courses HT25]]^U

  (sim: 0.63)
• [[Lecture - DAA HT23, XII]]^U

  (sim: 0.623)