<p>Anyone have a copy of the 2009 MC? I feel the Barrons is too hard and isn’t an accurate indicator.</p>
<p>You’ll get them on both sections, according to collegeboard.</p>
<p>That makes me feel much better, thanks.</p>
<p>Here’s a little something that you guys should glance over before the test (credit to DarkEyes):
<a href=“http://img4.imageshack.us/img4/9769/javaquickreview.jpg[/url]”>http://img4.imageshack.us/img4/9769/javaquickreview.jpg</a>
You never know when a random question pops out!
If you have any similar charts, why not share them?</p>
![http://img4.imageshack.us/img4/9769/javaquickreview.jpg[/url]](http://img4.imageshack.us/img4/9769/javaquickreview.jpg%5B/url%5D){kind=link}
<p>EDIT: And you guys might want to review De Morgan’s Law (google it). It’ll probably help with at least one question.</p>
<p>AP CS A is the easiest AP exam imo, so do well guys</p>
<p>Meh, WH is a bit of a joke too. I self-studied a 4 without doing any actual studying.</p>
<p>We’ll see about CS come July.</p>
<p>Does anyone have access to the AP Computer Science A and AB prep book by Susan Horwitz (Pearson Education). I got a 28/40 for the MC for the first practice test, but for the Barrons, I only got a 21/40. Can anyone confirm that the Barrons is much harder than the Pearson or I just got lucky?</p>
<p>@rymd, I prefer doing extensive programming problems over multiple choice exams, with short FRQs, and 15% of the questions based on an arbitrary course study, so it is harder than I’d like. </p>
<p>Ideally it’d be programming to solve problems, and they would grade it on functionality, efficiency, and style.</p>
<p>I’m probably just worried like I was for Calc and Physics, but I’m just hoping I don’t get a 4.</p>
<p>^ Agreed, it tests too much theory and not enough actual programming skill.</p>
<p>I felt the barrons was definitley tougher (mainly they tried to trick you a lot) while the released exam was more straightforward. Plus, Barron’s is known to have a ton of extraneous material, so if you’re cramming you might want to save that for later.</p>
<p>
Where is this exam of which you speak?</p>
<p>
Hehe, I love their “optional topic” indicator. I just skipped those sections.</p>
<p>I found that Barron’s explains the concepts really well even tho its Qs are ridiculously hard… xD</p>
<p>I don’t know what you guys are talking about. I got a 5 easy with Barron’s, now I just took one on college board course description and missed so many!!! The Barron’s FRQs are so much easier too! Ah, I’m freaking out, wat do I do?!</p>
<p>Question: on the FRQ, are we supposed to rewrite the method header (even though its given), or can we just start with the implementation? (surrounded by braces)</p>
<p>I would rewrite the header as a just-in-case. I highly doubt they will take off points for including it, and they might take off points for not including it.</p>
<p>Yeah, I’m going with the assumption that if typed verbatim what we write, that it would need to work, so I’ve been putting the method headers, but leaving out any comments. (It would be silly for us to copy the comments).</p>
<p>This test should be fairly easy…but then again I did do Computer Science UIL and was president of computer science club…</p>
<p>If anyone has questions feel free to pm me.
Do not worry about gridworld so much you will have quickreference materials on the test you just need to know how to use them.</p>
<p>Good Luck to everyone tommorow</p>
<p>Technically we don’t have to have the method headers (we had a grader speak to us), but it can’t hurt to rewrite them, it’ll remind us what we are supposed to be doing.</p>
<p>Barron’s does explain things well, but it does contain extra material. After the Barron’s and this other practice test we did from an online course thing, the actual released exam was that much easier.</p>
<p>My teacher had the 2004 exam sent to us, and we reviewed the 2009 one live online (I’m taking the course virtually).</p>
<p>Comments don’t count, even if you write them, unless your code is otherwise impossible to understand, the AP graders have been instructed to disregard them completely. </p>
<p>@phxfire You have a computer science club? That’s pretty cool, my school doesn’t even offer the course.</p>
<p>Good Luck Everyone! =]</p>
<p>ok, so if we don’t rewrite the method header we still need braces, right? and no points off if we do rewrite the method header? I’m slightly confused…</p>
<p>Hey, can someone post a quick review for Insertion sort vs Selection sort and their Big-O running time? Cheers!</p>
<p>selection sort is always n^2. insertion sort is best case n, worst and average cases of n^2. selection sort works by finding the smallest (or largest) element and swapping it to the front of the array, then finding smallest or largest of the rest of the array (a[a.length-1]). I’m going to review insertion sort again…</p>