Lectures

You can download the lectures here (in PDF format). I will try to upload lectures prior to their corresponding classes.

🆕 For students who have signed up to take notes, please use this LaTeX template in overleaf for the notes(zip version also available here. You can either edit in overleaf or download MikTeX and TeXStudio on your computer. I recommend the latter. Please make sure you edit what is needed in main.tex and session.tex. Please remove any image/codefile/… you are not using. When you are done, please share your notes through an overleaf project, or send me a zipped version of the TeX files along with the PDF.

Notes collected so far can be found here (last update: 4/30/2021)

• Genome Project
  

  [video]
• Lecture 30 - Quantum Computing
  Note Taker: سهند نظرزاده
  

  [slides] [ext slides] [video] [link1] [link2] [link3] [link4]
• Lecture 29 - Coping with NP-Completeness - TSP Dynamic Programming, Apporximation Algorithms
  Note Taker: امین ثانی
  

  [slides] [ext slides] [video] [link1]
• Lecture 28 - Coping with NP-Completeness - Independent Set in Tree + Backtracking + LocalSearch
  Note Taker: ملیکا احمدی رنجبر
  

  [slides] [ext slides] [video]
• Lecture 27 - National Holiday - Eid Fetr
  
• Lecture 26 - Coping with NP-Completeness - Special Case - 2-SAT
  Note Taker: هادی شیخی
  

  [slides] [ext slides] [video]
• Lecture 25 - NP-Complete, SAT-Solvers
  Note Taker: نگین درخشان
  

  [ext slides] [video]
• Lecture 24 - P, NP, Reduction, NP-Complete
  Note Taker: مجتبی نافذ
  

  [slides] [ext slides] [video]
• Lecture 23 - Linear Programming - Simplex
  Note Taker: ستایش کولوبندی
  

  [slides] [ext slides] [video] [link1]
• Lecture 22 - Linear Programming - Duality
  Note Taker: غزل زمانی‌نژاد
  

  [slides] [ext slides] [video]
• Lecture 21 - Linear Programming
  Note Taker: فاطمه امیدی
  

  [slides] [ext slides] [video]
• Lecture 20 - Network Flow Applications + MeasureIt
  Note Taker: فاطمه احمدی
  

  [slides] [ext slides] [video]
• Lecture 19 - Network Flow, Edmond Karp Algorithm
  Note Taker: آرمین غلام‌پور
  

  [slides] [ext slides] [video]
• Lecture 18 - Network Flow
  Note Taker: مصطفی رستم‌خانی
  

  [slides] [ext slides] [video]
• Lecture 17 - Efficient Suffix Tree + Review of Advanced Module
  Note Taker: هستی کرمدل
  

  [slides] [ext slides] [video]
• Lecture 16 - Efficient Suffix Array + LCP Array
  Note Taker: زهرا حسینی
  

  [slides] [ext slides] [video]
• Lecture 15 - Efficient Suffix Array Construction
  Note Taker: صدرا خاموشی
  

  [slides] [ext slides] [video]
• Lecture 14 - KMP Algorithm
  Note Taker: امید میرزاجانی
  

  [slides] [ext slides] [video]
• Lecture 13 - BW Trasnform and Pattern Matching
  Note Taker: شایان موسوی‌نیا
  

  [slides] [ext slides] [video]
• Lecture 12 - Suffix Trees, Pattern matching and BW Trasnform
  Note Taker: متین مرجانی
  

  [ext slides] [video]
• Lecture 11 - String Algorithms - Trie, Suffix Tree
  Note Taker: مسیح بهمنی
  

  [slides] [ext slides] [video]
• Lecture 10 - National Holiday
  
• Lecture 9 - A* Search
  Note Taker: علی فراهت
  

  [slides] [ext slides] [video] [link1]
• Lecture 8 - Minimum Spanning Tree
  Note Taker: سهراب نمازی
  

  [ext slides] [video]
• Lecture 7 - University Closed
  
• Lecture 6 - Negative Cycles - Bidirectional Dijkstra
  tl;dr: We first found the negative cycle in a simple example, using the Bellman-Ford algorithm. Next, we wrote the pseudocode for it. Next, we explained how we can find all nodes reachable through a negative cycle (infinite arbitrage). Finally, we developed the bidirectional dijkstra algorithm.
  Note Taker: ملیکا نوبختیان
  

  [slides] [ext slides] [video] [video2] [link1]
• Lecture 5 - Graph - Shortest Paths BellmanFord and Negative Cycles
  tl;dr: We analyzed the computational complexity of Dijkstra, Bellmanford, proved their correctness and finally explained how we can find negative cycles.
  Note Taker: یاسمن لطف اللهی
  

  [slides] [ext slides] [video] [link1] [link2]
• Lecture 4 - Graph - Shortest Paths Dijstra and BellmanFord
  tl;dr: We developed the Dikjstra and Bellmanford algorithms.
  Note Taker: پریسا علایی
  

  [slides] [ext slides] [video] [link1] [link2]
• Lecture 3 - National Holiday
  
• Lecture 2 - Graph - Shortest Paths
  tl;dr: We gave an overview of shortest path algorithms (BFS, Dijkstra, BiDirectional Dijkstra, A*). Then we explained the details of the BFS algorithms.
  Note Taker: نگار زین‌العابدین
  

  [ext slides] [video] [link1] [link2]
• Lecture 1 - Introduction
  tl;dr: We went over changes to the course structure and reviewed the course syllabus.
  

  [slides] [video]