Mar 15 2008
Georgia Tech to make up game against Virginia on March 3
ATLANTA: Georgia Tech and Virginia will face each other March 3, making up a game that was postponed because of a leaky roof at Alexander Memorial Coliseum.
The game was supposed to be played Thursday night, but torrential rain was too much for the domed roof of the 52-year-old arena to handle. The game was delayed at first, then called off when the maintenance crew couldn't guarantee the leaks would stop.
The Yellow Jackets (11-13, 4-6 Atlantic Coast Conference) have lost three straight games and four of the last five.
Virginia (12-12, 2-9) was coming off a five-point win Sunday at Boston College that stopped a seven-game losing streak.
The 7 p.m. makeup game will be played at the beginning of the final week of the regular season.
Tags: alexander, coliseum, memorial
8 Responses to “Georgia Tech to make up game against Virginia on March 3”
That’s a great catch
Well, I should have said I’m not a CS under/graduate as I dropped out of school when I was half-way through.
Thank you for posting this. Great reading.Can you recommend books/articles or anything containing interesting programming problems? I’m not a CS major so I will really appreciate some pointers, thanks.
Wow, I thought this was some silly person misremembering the title of smashing the stack for fun and profit. Instead it was an original digest/presentation of interesting material by someone who’s been teaching me handy tricks for years.Thanks,-dtb
U applies only for complement operation and applies to both algorithms.complexity of dense/sparse:union:for every element in set Aadd to result set Rfor every element in B test presence in R add to result unless present=O(#A+#B)intersection:for every element in set A test presence in B add to result R if present=O(#A)complement:for every element in Utest presence in Aadd to R unless present=O(#U)Bitset (64 bits per word):union:for all elements (blocks of 64 at a time) R = A | B=O(#A/64)intersection:for all elements (blocks of 64 at a time) R = A & B=O(max(#A,#B)/64)complement:for all elements in U (64 at a time)R = ~U=O(#U/64)Of course, formally, all these operations for both algorithms are O(n) since constants are not considered.But locality of reference and cpu instructions favor the bitset algorithm
Horribly obvious. This is the sort of quiz you’d ask a retarded kid in an interview so he could feel good about getting something correct.
Great article. Thanks!
Ya’ll must have a high IQ. Too long; didn’t read. So what the heck does this article give us? I barely could understand it. And how does it make a connection to fun and profit?