mrry (Happy New Year)
Blog Computing Science - DAS4 23/May/2005

For the majority of examinees, today was the last time Peter Dickman would have been able to make them suffer. Since I'm going to be working for him this summer, I'm not sure, if he ever reads this, whether he'll take perverse satisfaction in setting a difficult exam, or just give me a clip round the ear.

As ever, the nimble Mr. Miller has beaten me home and posted an in-depth summary. So that leaves me to expound on my personal bêtes noire.

Question 1 I did last, as advised. The coding example was relatively fiendish compared to some that I have seen, requiring at a minimum two interfaces and a class with four methods. There was little time for comments, and no time at all to write some helper classes that seem to be mandatory for full marks (although one might wonder if this requirement has been relaxed as the coding question has gone from 15 to 12 marks). The remainder of the question was fairly similar to the 2004 paper, concentrating on clocks and message reordering. Not entirely pleasant.

Question 2 started off with some relatively easy questions about spanning trees and leader election. There followed a short question on diffusion trees which was straightforward enough, but difficult to explain precisely. There then followed a nasty sting, regarding the traversal of or wave through an N-by-M torus. Nasty because the algorithm isn't the same as the one I had learned for an N-by-N torus, and I didn't have enough time to come back and correct my answer sufficiently. There were some marks to be had, though, for discussing wave and traversal algorithms in general, and hopefully these should be had.

Question 3 was a no-go area for me, though I gather that it was quite popular. A stunning 23 marks went for a discussion of distributed file systems. Now, if you knew that lecture like the back of your hand, then that would be fair enough—I felt that I only knew it well enough to answer direct questions like in the 2004 paper, and there was no way that I could think of 23 things to say on the topic. As if to add insult to injury, the remaining 7 marks were for discussing continuous media systems, in what might have been a sting. If distributed file systems was my least-secure topic, continuous media ran it a close second. There was no way I was approaching this question (thereby throwing the coding question into play—bugger).

Question 4 was an interesting one. Essentially, it did for tuplespaces what question 3 did for DFSs, but in a manner that was more conducive to giving technical details, rather quantity of details. The first part dealt with using tuplespaces for workflow, which was touched upon briefly in the notes, and had turned up in the past. The second part was a slight sting, asking about leader election in a tuplespace under two scenarios. I reckon that I got the shared-tuplespace scenario, but didn't have time to come back to the second part, which I suspect would be carried out along the same lines as a spanning-tree leader election (I think I got as far as writing, "The second case first uses spanning tree constructio—"). A three facts/three marks question on Byzantine behaviour in a tuplespace system seemed fair enough, though required a bit of thought. Finally, there were 7 marks for discussing informally why there is no k-Byzantine-robust consensus protocol for k ≥ N/3. Now, I had written in my notes that examinability ended long before this was discussed, but I nevertheless studied that "proof" as it had appeared in previous years. Happily, I had a moment of clarity which might have improved my answer to this question by a mark or two.

I guess that sounds like a pretty mixed bag, so why am I whining? I'd have liked a few more minutes to complete the answers that I didn't get a chance to complete, and the coding question seemed trickier than usual (though at least, mercifully, without the use of the bizarre, pre-Java2 KeyedCollection class). It was a bit of a beast, and certainly the most difficult exam so far this year in terms of thinking. But then, I took a Peter Dickman course—what else should I expect?




Derek said:
I should note, for those wanting to find something adorable, that I marked the non-examinability by an XML-style </Examinability> tag at the bottom of slide six.

Neil said:
I actually also had it marked as non examinable.. while revising I interpreted that as meaning that the formal proofs were not examinable but being able to describe an intuitive proof was.

I did Q 2,4,3 (in that order, natch). As with Gary I knew I couldn't get 23 things for that DFS question but I know I could get ten or so. The Torus question was a bit of a sting.. I admit I didn't actually even take into account the MxN difference. *shrug*. Also forgot a few simple definitions along the way so spraffed out my own ones. Always a risk.

I also found it better than Algs.. probably as I'm just more in tune with the stuff in DAS in general. Didn't ace it by any means but any exam I come out of thinking I got a D or above is a success these days ;)

I spent some time the other night mullling over why I actually took DAS... It is definitely one of the hardest modules but also the most enjoyable (certainly of any I took) and useful in 'The Real World'. I don't regret taking the module at all but I do wonder if, grad point wise, I'd have been better taking something else. I may have gotten a better mark, sure, but I wouldn't be as able a programmer as I am now. I guess what I'm trying to say is: third years, don't let us scare you off DAS. It's a challenge and it may knock your GPA down a bit but it's likely worth it just to have done the module. Gave me plenty to spraff about in interviews.

Gary Fleming said:
Maybe I just remained blissfully unaware of the nastier stings (of which I'm sure there were some), but it wasn't that bad. I was expecting something absolutely terrible and got something, while not easy, wasn't terrible.

I opted for question 3 because, although I didn't know 23 things about distributed filesystems, the 10 or so things I did know seemed more worthwhile than doing a coding question I had no hope of finishing in time. Plus the bonus question on isochronous media allowed me to use some NCT based spraff.

As for the Byzantine impossibility results, it shouldn't have been marked as not examined. The only section in that lecture that was not examinable was the code for the General Broadcast (although the concepts behind that were to be understand).

All in all, not great, but far less bad than Grid and possibly also Algs. Dickman, you're going soft.





Please enter the number 2127 in the box below:

CommentsTell a friend about this page

Your Name

Your E-Mail

Your friend's E-Mail


< # Scottish Blogs ? >
Technorati Profile
Listed on BlogShares

Subscribe to the mrry RSS feed
More about RSS.
Trackback URL for this article: