Ashvin, I'm not sure what you're saying with your posts but it is pretty ridiculous for a professor to cover that kind of material in an OS class. It would have been much more believable if he had claimed he read it in an article or something, but even then, not much more in his case. Also I want to address:
"-The entire point of clues like "a description of Kruskal's algorithm" is to buzz on them and say "trees". I believe that either Sriram or I did exactly that."
Saajid wrote:Given a well-quasi-ordered preorder on sigma, the preorder on these structures of a homeomorphic embedding of sigma is well-quasi-ordered according to Kruskal’s theorem about these structures. A data structure of this type uses an associative array on integer keys to point to substructures with square root of n elements, which helps that type of these structures achieve log log n running times for search and deletion; that type of these structures is named for (*) van Emde Boas. Rotations are used to maintain the invariants of a data structure of this type that is usually implemented as “left-leaning” and colors nodes. A recursive definition usually consists of either a value or more of these structures. A connected graph with no cycles is one of these structures. For 10 points, name these structures that come in B and red-black types, groups of which are called forests.
ANSWER: trees [prompt on “graphs”]
What are you talking about? At no point does it cover Kruskal's algorithm. It covers Kruskal's theorem, which is something completely different! Also, if it really did describe Kruskal's algorithm like you claimed, why didn't you buzz in and say "minimum spanning tree" because who the fuck writes a tossup on "trees" and lead-ins with the minimum spanning type at this level?
Powering trees on the description of Kruskal's algorithm
I was thinking graph - they said a lot of familiar language to graph theory but then I believe they said graph in the question and thats when I buzzed in with tree - I could be mistaken there were a lot of questions yesterday.
Well yeah you are mistaken, neither the phrases pre-order, homoemorphism, sigma, or well-quasi-ordered applies to graph theory specifically - they apply to more general concepts. In fact the first word that refers to graph theory specifically is either rotations or nodes, but those clues come after the power mark. Of course, I'm only posting this because at this point I want you to blame the moderator next for giving you fifteen points when you only deserved 10.
I mean look at some of the things you say:
"furthermore in order to map a structure this massive what else could it have been? Really think about that. It had to be mapped using light and a lot of it."
Also a professor once told me if it has h-bar in it it is quantum mechanical in nature, if it has c in it it is relativistic
My professors would have never told me "if it has h-bar in it, it is quantum mechanical in nature" you know why? Because they don't assume their students are that dim-witted dipshits. This is the equivalent of saying "if it involves economics it must deal with money - " what professor is ever going to tell you that?
Steven Hines wrote:http://en.wikipedia.org/wiki/Network_ad ... ranslation
Understand networking before you post mindless shit, that will be believed by anybody without real networking knowledge.
PLUS If i were to cheat, I would have used a fucking VPN or torr, or any variety of anonymity.
You see the quizbowl community is being nice to you today! Normally, this would entail a ban or a warning for telling people how to post, but we are using our gifts of kindness!