Author: :cirno-avatar: Taimingwang Liu

60% Exam ( 📄with a 2 sided hand-written A4 paper!) + 40% CW

Summary of Exam Questions by ChatGPT

Syllabus & Teaching Plan

Lecture01 - Computational Complexity

Lecture02 - Divide and Conquer

Lecture03 - Data Structures 1

Lecture04 - Data Structures 2

Lecture05 - Dynamic Programming

Lecture06 - Greedy Algorithms

Lecture07 - Graph Theory

Lecture08 - Minimum Spanning Tree and Shortest Path

Lecture09 - String Matching

Exam Summary

Q1: Time Complexity Analysis

Q2: Heap & Tree (AVL) [no red-black tree in Final Exam!]

Q3: Dynamic Programming

Q4: MST & Shortest Path & Flow Network

Q5: String Matching

Q6: NP-Completeness