Syllabus

• Algorithms II - syllabus 2015 (pdf)

Special Office Hours: Aug. 1, 2018. 1000 - 1200

---

Reading Material

• MHT of two trees (postscript)
• Alphabet Independent 2-d Pattern Matching (postscript)

Transparencies

• Maximum Homeomorphic Agreement Subtrees
• Proof of the Bandelt and Dress theorem
• Bin Packing Approximation
• Bin Packing PTAS
• Linear Programming
• LP forms
• LP duality
• Online Algorithms
• Proof that LRU is k-competitive
• Karger's Randomised Min-cut Algorithm
• KMP Algorithm
• Witness Table Pattern Matching Algorithm
• The Text Scanning Dueling Algorithm
• The Convolutions Method for Pattern Matching
• Two Glass Balls and a Tower
• Indexing Problem
• Weiner's Suffix Tree Construction Algorithm
• Berkman's LCA Algorithm
• Introduction to Parallel and Distrinbuted Algorithms
• Introduction to Streaming Algorithms
• NP-completeness (michlalot)

Exam Results

• moed Alef 2008(pdf)
• moed Bet 2008(pdf)
• moed Alef 2009(pdf)
• moed Alef 2010(pdf)
• moed Alef 2010 - error codes(pdf)
• moed Alef 2011(pdf)
• moed Bet 2011(pdf)
• moed Alef 2012(pdf)
• moed Bet 2012(pdf)
• moed Alef 2013(pdf)
• moed Bet 2013(pdf)
• Error codes problems 1 and 3 moed Alef 2014 (pdf)
• Error codes problems 1 and 2 moed Bet 2014 (pdf)
• Error codes problems 2 and 3 moed Gimmel 2014 (pdf)
• moed Alef 2015(pdf)
• Error codes moed Bet 2015(pdf)
• moed Alef 2016(pdf)
• Error codes moed Alef 2016(pdf)
• Error codes moed Bet 2016(pdf)
• Error codes moed Bet 2017(pdf)
• Error codes moed Alef 2018(pdf)
• Error codes moed Bet 2018(pdf)
• Solution and Error codes moed Alef 2019(pdf)
• Error codes moed Bet 2019(pdf)