<p>I'm not going to give out the actual question or something, because that's cheating, but it was sooo hard!</p>
<p>Anyone else think the same?</p>
<p>Yes.</p>
<p>I did answer them all, but for 2 of them I think my algorithm was a little shoddy.</p>
<p>Well, I thought 3 of them were fairly simple but the other one I completely bombed. I'll say more when we get our green packets back.</p>
<p>I liked the FRQ, it wasn't bad, but I was taking the A so maybe that's why. The AB didn't sound too bad.</p>
<p>Two of the questions were reasonable, one was tough, the last remaining was next to impossible. I had NO idea.</p>
<p>I'd agree with that statement.</p>
<p>is this for ap calc ab?</p>
<p>Nope, AP Computer Science AB.</p>
<p>And they were pretty challenging.</p>
<p>The general consensus I have heard is that the FRQ were fairly hard, so I'm looking at a possible curve increase this year.</p>
<p>The FRQs for 2006 were even harder. Or at least one was. What was the curve for that year?</p>
<p>idk. i didnt think the frq was very hard. they were all pretty straitforward. especially since the case study question didn't have anything to do with writing a new fish class or anything.</p>
<p>I thought the case study question was easy, but looking back at the frq, I don't recall doing part B of that question at all... I remember looking at it but I think I went back to fix something in 3 and just forgot about it... which really sucks because its a simple problem...</p>
<p>The FRQ were just plain not fair. We took part of last year's test in my CS class and this year's FRQs were WAY harder! I answered all of them, but I couldn't figured out how to do the producing random stuff - I think I made up a new method from the Math class. :)</p>
<p>If you used Math.random (), then you are fine; else you would have to use the RandomNumGenerator</p>
<p>Math.random() is good, but i think my cs teacher said that they didn't want you to use that for some reason. im pretty sure that RandomNumGenerator is actually a class that is only used in the MBCS. Otherwise, you just use a Random object. To create a random number from 0-9, you would do something like this.</p>
<p>Random rand = new Random();
int num = rand.nextInt(10);</p>
<p>However, my guess is that you won't lose points if you use Math.random() correctly. Something like this.</p>
<p>int num = ((int)Math.random() * 10);</p>
<p>^ I did that whole part wrong. I used Random rand = new Random(); but then I forgot about the next line. And since the randomnumgenerators were used for 2 or 3 questions, I got them all wrong. :(</p>
<p>Oh, and for number 1 part c and d, did we have to give reasons for the bigO notation? It never said to explain, just give the run times...</p>
<p>i dont think it explicity said that you had to give reasons, but i did just for thoroughness. i think it might have been one of those things where an explanation was implied.</p>
<p>On question 1 part c and d where it asked for the big-O of the constructor. Does anyone know the answer? If you need to look at the questions go to apcentral.collegeboard.com and then on the left under the exams click exam questions then navigate to APCSAB. thanks.</p>
<p>Yea, I asked that and some other guys said:
c) O(n^2)
d) O(n)</p>
<p>part 1 was O(n^2). The first part, where the elements are added to the array does not affect the run-time, because it is not in the main loop. It is O(n^2) because the loop makes it O(n) and the remove method within the loop is also O(n). The second part is O(n) because the remove part is modified to make it run in O(1) time.</p>