Computer Science A(B)

<p>I still think there was an error on part four, but I can't double check until the 48 hours have elapsed. Have the elapsed today already?</p>

<p>EDIT!</p>

<p>Oh goody, they're up. Well I think the error is on question four of the AB exam. The last page (pg 16), the fourth block of text states that the buildFilter method accepts a list of two or more strings, but the method signature at the bottom of the page shows that the first parameter is "String[] desirable" thus an array. So this is an error, right?</p>

<p>^^ I don't know about that, I pretty much forgot all of comp sci now since the ap test is over :-p</p>

<p>besides that, what did you guys think about the AB test? anyone have any answers for the FRQ's? They're up online by the way:</p>

<p><a href="http://apcentral.collegeboard.com/apc/public/repository/ap08_comp_sci_ab_frq.pdf%5B/url%5D"&gt;http://apcentral.collegeboard.com/apc/public/repository/ap08_comp_sci_ab_frq.pdf&lt;/a&gt;&lt;/p>

<p>oh what'd you guys get for the Big-Oh running times?</p>

<p>Print forward APList : O(n)
Print forward LinkedList : O(n^2)
Print reverse APList : O(n^2)
Print reverse LinkedList : O(n^2) </p>

<p>I hope...</p>

<p>
[quote]
Print forward APList : O(n)
Print forward LinkedList : O(n^2)
Print reverse APList : O(n^2)
Print reverse LinkedList : O(n^2)</p>

<p>I hope...

[/quote]
Yeah, that's what I got.</p>

<p>The Gridworld one really ****ed me off. I actually knew gridworld really well and they threw us some BS that had nothing to do with critters or bugs or any of those. The question was ridiculously easy, too... all you had to do was use the unboundedgrid methods that already existed.</p>

<p>what did you guys do for gridworld questions? I had one where I just called super.get(loc) or something as a guess.</p>

<p>The UnboundedMultiGrid didn't actually extend AbstractGrid or UnboundedGrid, so a call to super.anything would have been useless</p>

<p>for the get, you just return grid.get(loc) because all it's supposed to return is a grid
for put, you need to check if the set already exists
if it does, add to it, if it doesn't, create it
for get neighbors you just call grid.getNeighbors(loc) and then iterate through each set in that array list and add the contents to an arrayList<object><p></p>
</object></p>

<p>Woah, I think I actually got those run times! Considering the fact I basically learned all the ab stuff this weekend, that makes me very happy :D</p>

<p>gridworld, though, uh, no.</p>

<p>Are the FR answers somewhere on the internet?</p>

<p>I've just taken the late version of this test and its free-response questions were much harder than the past free response questions that I've taken under timed conditions. While I think I competently answered the questions, there was this initial overwhelming feeling when trying to process what was going on with the question at first glance.</p>

<p>Hopefully they grade "late versions" fairly.</p>

<p>(I actually had to implement mergesort!)</p>

<p>^</p>

<p>Were you taking the AB or A exam?</p>

<p>I took the APCS AB late test. I thought that the test was pretty easy. There was only one FRQ that was a bit tricky.</p>

<p>SWBluto: There was a simpler way to do that FRQ. I'll explain my method in another 12 hours, when we're "legally" allowed to talk about the FRQ.</p>

<p>Oh, another thing, nothing specific to any APCS test.</p>

<p>Let's assume that they give you a FRQ and they DON'T tell you that you cannot use any other data structures other than the ones given to you, or something similar (basically, they give you no limitation). Does that mean that I can use ANY data structure I want in my answer as long as it meets the postconditions and works as intended?</p>

<p>blddrake44, I was totally asked to implement mergesort in A. </p>

<p>Haha. No, that'd be ridiculously hard. It was AB. </p>

<p>@Loaded: You could look at past AP free response questions and check how much "certain methods" are weighted in the scoring. I don't exactly what you answered, so I can't accurately predict even a range, but about fourth to half the points(Usually) seem to be based on a "specific way" they intend for the student to answer the question. But, then again, they might allow any datastructure to be used: they've asked questions like that before where any datastructure could've been used as long as the postconditions were met. But, on another note, it did seem like they wanted you to "manually" implement the sorting behavior so they might have that in their grading rubric. Oh well, it looks like we may never know. :) </p>

<p>It's kind of sad that they don't post the Late-AP Free Response questions for us to double check(For Computer Science AB), unlike the regularly scheduled AP test so we're left in more doubt on how we "generally did" than most other Comp AB students.</p>

<p>The microeconomics AP seemed to have all the forms available: "Form B" and the regular ones.</p>

<p>It just seemed like this AP test's FR had two questions that required me to draw diagrams to get a hang for what was going on: Almost none of the past Free response questions required that. Oh well, the AP site makes special mention that the difficulty and depth is comparable to the regular AP test.</p>

<p>w00t. I got my 5. :D</p>