Exam

During the exam, you can only have with you the following material:

• up to 2 textbooks
• up to 4 two-sided sheets of A4 paper with notes (printed or handwritten),
• an English dictionary

This year’s exams

• Re-exam for TDA384/DIT391 given on 19 December 2017 with solutions.

• Re-exam for TDA383/DIT390 given on 19 December 2017 with solutions.

• Exam given on 28 October 2017 (including sketch solutions).

Past exams

Some previous exams are available below for reference.

• Solutions to some of the following exams are available on this page

• Exams by Carlo Furia

  • March 2017

• Exams by Alejandro Russo

  • October 2015
  • August 2014
  • March 2014
  • March 2013 (with JR)
  • March 2012 (with JR)
  • March 2011 (with JR)

• Exams by K.V.S. Prasad

  • October 2016
  • August 2015
  • March 2015
  • October 2014
  • October 2013
  • October 2012
  Hints to solve the exercises: Q1 : (a) The scenario q1, q2, p1, q1 gives n=0 at the end. The scenario p1, q1, q2, p2, p1, q1 gives n=1 at the end. Q2 : The abbreviated version leaves out p1, q1, p4 and q4. Each state now shows where the program counters of p and q are, and the values of wantp and wantq. Draw the state diagram and show there is no state with p5 and q5. Q3 : (a) The state diagram is on p108 of the text-book (b) the definitions of wait and signal are on p109 and p110. (c) See algorithm 6.8 on p119. Q4 : (a) See p 161. (b). eating(i) becomes true only by executing takeForks(i) completely, or by by being unblocked in releaseForks(i+1) or releaseForks(i-1). In both cases, we have fork[i]. Q5 & Q6 : These are programming problems, not involving formal reasoning. Q7 : (a) the processes can livelock, looping p- to p3 and q- to q3. The invariant is that exactly one of C, Lp and Lq is true, (b) We did this in class, in my 3rd lecture. If p does not progress, Lp must be false. So q must progress, and will then set C to true. Assuming fairness, p must then progress.
  • October 2011, using an old notation
  • Sample questions from 2003, using an old notation
• Exams by others
  • March 2016 by Michał Palka
  • August 2010 (with JR)
  • October 2010 (with JR)
  • October 2009 (with JR)
  • October 2007 (with JR)

More exams?

The list above will give you a pretty good idea what to expect from an exam. Of course, the course has been run by different teachers and each of them has its own style. If you still want more exams, you can get a copy of them from the Studieexpedition. The structure of the exam and the type of questions is not drastically changing throughout the years. It is true that the used programming languages can be different but the problems the past exams asked to solve are likely still relevant.

Only registered students can take the exam

Starting in study period 1 2017, as a decision by Chalmers’ Vice president for undergraduate and master’s education, it is obligatory to register for exams. Students who do not register will not be able to take the exam even if there are free places.