UPDATE: I PASSED! Details posted in the comments
Holy jeez. My PhD thesis defense is in one hour: “Effective Algorithms for Discovering Degree Constrained Spanning Trees in Sparsely Connected Graphs”
It’s just like American Idol, only it’s four Simons and no Paulas — and I’ve been perfecting the same routine for the 7+ eight years.
The talk is an hour, then Q&A, private Q&A, and then the committee discusses things amongst themselves. By about 2:30 I’ll know if I’ll be allowed to submit my thesis or if I’ll utter the famous words of Bluto Blutarsky.
Wish me luck!