And naturally, instead of revising...

[davidn]

Algorithm: GraphsAndAlgorithmsExam

Input: An exam paper consisting of vague and impenetrably-worded
questions, E
A time in which to answer them, T

Output: An array of confused and mostly wrong answers dressed up
to make them seem more valid, A

Method:

Initialise counter x := 0
While (time < T && !Dead)
     While (Clueless)
          Attempt to read question from E[x]
          If understood
               Clueless := false
     String answer := Waffle + Answer(Twaddle) + Waffle
     A[x] := answer
     Increment x
Sign paper
Go(Home)
Go(Bed)

Comments

[ex-gh232.livejournal.com]

Yes, but what's the space and time complexity of your algorithm when taken in the context of a sparse, acyclic, undirected graph on the fourth Tuesday of the month, running on a Windows 3.1 machine in a spacecraft traveling at 3x10^8 m/s? Show all working. [863 marks]

I'm so screwed.