Monday, November 12, 2012

11/12/12 Quiz bowl

This has been a very busy week for me, and we did not learn a new topic this week because we had a test. Today I will not teach you something new, but I will talk about the computer science questions that I did or did not get at a quiz bowl tournament this weekend. You can find the stats of the tournament here, and my stats here and here.

Computer science dose not come up very often in quiz bowl, but in a tournament there are normally about 4 questions. The first was a bonus question about data structures. The answers were array, stack, and red black tree. I got array correct, but confused heaps and stacks. For the last part I answered binary tree, and I was prompted but I did not know what a red and black tree was, so I also missed that part. This was probably one of my weakest computer science questions that day. 

Next was a java question. I would have gotten this question if our opponent was anyone but St. Johns A, the players of which just memorize certain key words to answers, which allows them to get questions very early with out knowing very much. Because of this they got the question on the second word, while I would probably have got it about a sentence later.

The third question was a search algorithm question. I was able to get this one when they were talking about big O notation, which can tell you how much time it takes for a search algorithm to run. I knew that the answer was eater going to be search or sort from the start of the question, but I was not sure which until the big O clue.

I am sorry that I did not talk teach you anything new about java, but last week we just studied and took a test on logic, loops, and arrays. Also, I am sorry if this post did not make much sense to you, but I had to miss school on Friday for the tournament and I need to do all my homework today. Just to give you some context, here is an example quiz bowl question:

The next version of this language has the designation 0x (zero x). One important part of this language is templates and it supports references. One can manage memory in it by using the delete and new operators. In it, one can print to the standard output using cout. Unlike its ancestor, this language supports classes. For 10 points, name this programming language whose name reflects that it is a step up from its predecessor, C.

Answer: c++

No comments:

Post a Comment