Princess Sumaya University for Technology
Design & Analysis of Algorithms

Course Material

Quick Links

[slides] [exercises] [previous exams] [previous quizzes] [interview-prep] [optional-material]

Detailed Links

• Graphs

  • Introduction [slides (short)] [slides (long)] [code]
  • Graph Traversals (BFT & DFT) [slides (short)] [slides (long)]
  • Topological Sort [slides] [code]
  • Shortest Paths [slides (short)] [slides (long)] [code]
  • Minimum Spanning Trees [slides] [code]
  • [optional-material]

• Asymptotic Notation [slides (short)] [slides (long)]
  [solved exercises] [extra exercises]
  [math cheatsheet] [interview-prep] [optional-material]

• Recurrence Equations

  • Introduction [notes]
  • Recursion Tree Method [notes + exercises][solutions]
  • Master Method [slides] [exercises] [optional-material]
  • Iterative Substitution [notes]

NOTE: The material below this line is still under construction.

• Backtracking & Branch and Bound
  [code] [exercises] [slides] [interview-prep] [optional-material]

• Divide & Conquer

  • Introduction + Merge Sort [slides]
  • Quick Sort [slides (short)] [slides (long)]
  • Selection [slides (short)] [slides (long)]
  • [exercises]
  • [optional-material]

• Dynamic Programming

  • Introduction [slides]
  • 0-1 Knapsack [slides]
  • Weighted Activity Selection [notes] [slides (long)] [slides (short)]
  • Longest Common Subsequence [notes]
  • [exercises]
  • [optional-material]

• Greedy Algorithms [slides] [exercises] [optional-material]

• P vs. NP [slides] [exercises] [optional-material]