Course - Design and Analysis of Algorithms HT23

Created: January 14, 2023 | Updated: September 30, 2025 | Read markdown | About these notes | View in context | Study these flashcards

---

“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 HT22^U

Notes

• Notes - Design and Analysis of Algorithms 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 - Design and Analysis of Algorithms 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 - Imperative Programming HT23, Maximum segment sum^U
• Notes - DAA HT23, 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, The Algorithms^U, List of algorithms to memorise for DAA^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 - Design and Analysis of Algorithms HT23, I^U
• Lecture - Design and Analysis of Algorithms HT23, II^U
• Lecture - Design and Analysis of Algorithms 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

• Prelims^U

  (incoming)
• University Notes^U

  (incoming)
• Part A^U

  (sim: 0.684)
• Course - Algorithms and Data Structures HT24^U

  (incoming)
• Courses HT25^U

  (sim: 0.702)
• Course - Imperative Programming I and II HT23^U

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

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

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

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

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

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

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

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

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

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

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

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

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

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

  (incoming)
• Lecture - Design and Analysis of Algorithms HT23, III^U

  (sim: 0.769)