For anyone curious, exam in question was one on Software systems -- two related subjects squished into one -- so, Axiomatic reasoning (which is moderately interesting while being wholly tedious) and Concurrency issues in Java. Related? Well, prove why your concurrent Java program will perform as expected and terminate mathematically -- Given precondition P and statements [S1 || ... ||Sn] write a proof to guarantee termination and post-condition Q.
Not so exciting for non-programmers I'm guessing.
Either way, wasn't as difficult as I was expecting, and now -- freedom!