<p>I think one reason this is hard is because there havent been many released exams in this area...also...im so screwed lol, i tried doing litvins but it is ridicolous, how close is that to the real thing!?</p>
<p>ahdidnotfaillife, thanks!...yea i figured it out in school also =D...but yea...i think i'm screwed...the barrons questions are really really hard....so not joking...comp sci ab is probably one of the hardest aps...or did i just procrasinated so badly...that it seems like so...</p>
<p>AP Computer Science A taker
what to do about free response</p>
<p>yup, I concur with darkhope...APCS is hard. Unlike AP exams like AP bio, APCS requires so much logical application. The free responses to the MBS thing are hard! >= /</p>
<p>How accurate is the Litvin test?</p>
<p>I took the Barron's AB test and I did extremely bad. On the multiple choice, I got over half wrong! I'm screwed for the test unless it's really easy.</p>
<p>also, which tests are most accurate?</p>
<p>Eh it's a matter of preference. I've become so used to the algorithms from A that the AB free response is a joke to me.</p>
<p>Barron's +5 on both parts (before weighting) is most accurate for your actual AP score. If you can get a 25/30 on Barron's tests then you should get an easy 5 on the exam.</p>
<p>You mean 25/40?^^</p>
<p>is that for compsci A?</p>
<p>Wow, i feel like I'm gonna fail. The MC portion isn't that bad, but wow, the FRQ is hard. x-x</p>
<p>Recursion on the FRQs eats me alive.</p>
<p>My teacher assured us that they won't ask you to write recursions on the AP exam, only evaluate them. Is this true?</p>
<p>The 15 sample Multiple Choice questions are located on Pgs. 73-85 of the PDF.
<a href="http://www.collegeboard.com/prod_downloads/ap/students/compsci/52435%20APCompSci-Locked.pdf%5B/url%5D">http://www.collegeboard.com/prod_downloads/ap/students/compsci/52435%20APCompSci-Locked.pdf</a></p>
<p>May someone explain questions 5, 12, 13 and 15 to me?</p>
<p>Lucidity, not true.
Most likely if you have a FRQ dealing with a TreeNode, you will have to do something with recursion.</p>
<p>There's only 10 pages in that link.</p>
<p>Sorry, I updated it in my original post.</p>
<p>Oh wait ... I'm only taking the A exam lol. I guess that would make a difference. =P</p>
<p>Man, I'm going to fail the multiple choice with my 10 billion stupid mistakes.</p>
<p>Hopefully I'll do good on the FR, and that'll bring my score up. Compared to USACO, FR doesn't sound too bad, lol.</p>
<p>Whao, on the sample questions, 12 and 13 don't make sense to me. By "dominate", does it mean "what takes up the most time"? In that case wouldn't 13 be A because every time an element is added to a priorityqueue it has to be reheaped?</p>
<p>I now understand 13. 13 would be B, because removing an element in an ArrayList is O(n) while it is O(log n) in a Priority Queue assuming it is implemented as a min-heap.</p>
<p>12 still does not make any sense to me.</p>