||[Apr. 13th, 2006|04:18 pm]
So I had my Oral exam. Going up to it, I was calm as anything, but once I actually got to the exam, I got really nervous, and was shaking inside.
The theorem was really easy. It was proving that "X => Y = X && Y = X" - which I could do in about 2 lines.
The other thing was deriving an algorithm that took an array of 1000 elements and determined if all the elements of it were positive. Basically there were one of two ways to do things to do it, Reduction or Bounded Linear Search, I looked at it and took Reduction.
At the end of it all, he told me why I should have chosen the BLS, but then said "But I haven't taught you about efficiency, but otherwise it was truly masterful".
I like those words. Especially as I've hit on myself quite hard about not getting various academic internships - where my academic work isn't all the obviously up to scratch. So this is quite a perk.