Exams

First page of the exam

PDF

Exams from previous semesters

  • Several topics were only taught in some of the semesters.
    • Linear programming (LP)
    • Randomized algorithms (RA)
    • Approximation algorithms (AA)
    • String matching (KMP)
  • Before 2006, our course was known as "Efficiency of Computations" and the syllabus was a bit different. In particular, it included $\mathcal{P}$ vs. $\mathcal{NP}$, which nowadays is taught in Computational Models. Feel free to ignore any such question.
Year Semester Moed Date Exam Comments
2016 Spring Bet 19/9/2016 PDF
2016 Spring Aleph 10/7/2016 PDF
2015 Both Bet 25/9/2015 PDF
2015 Spring Aleph 9/7/2015 PDF Q3: LP
2015 Fall Aleph 10/2/2015 PDF Q5: LP
2014 Both Bet 29/9/2014 PDF Q4: LP.
2014 Spring Aleph 2/7/2014 PDF Q5: KMP
2014 Fall Aleph 22/1/2014 PDF
2013 Spring Aleph 10/7/2013 PDF Q5: LP.
2013 Fall Aleph 31/1/2013 PDF Q3: LP.
2012 Spring Bet 9/9/2012 PDF Q2: LP.
2012 Spring Aleph 11/7/2012 PDF Q5: KMP.
2012 Fall Aleph 9/2/2012 PDF placeholder
2011 Spring Bet 23/10/2011 PDF Almost identical to fall semester's moed beth exam.
2011 Spring Aleph 23/6/2011 PDF Q3: KMP.
2011 Fall Bet 23/10/2011 PDF Q3: should be $k\le|E|$; Q5: LP.
2011 Fall Aleph 28/1/2011 PDF Q4: LP.
2010 Both Bet 6/9/2010 PDF Q5: assume $w$ is monotone.
2010 Spring Aleph 24/6/2010 PDF placeholder
2010 Fall Aleph 29/1/2010 PDF Q5: RA, both (a) and (b).
2009 Both Bet 25/9/2009 PDF Q4: KMP.
2009 Spring Aleph 2/7/2009 PDF Q2: KMP.
2009 Fall Aleph 6/3/2009 PDF placeholder
2008 Both Bet 24/10/2008 PDF Q5: KMP.
2008 Spring Aleph 31/7/2008 PDF Q5: KMP.
2008 Fall Aleph 4/4/2008 PDF placeholder Q2: don't look for a linear solution.
2007 Both Bet 15/10/2007 PDF placeholder
2007 Spring Aleph 12/7/2007 PDF placeholder
2007 Fall Aleph 2/2/2007 PDF placeholder Q6: LP.
Unless otherwise stated, the content of this page is licensed under Creative Commons Attribution-ShareAlike 3.0 License