<p>Code a lot and practice past questions.</p>
<p>What does the Collegeboard provide for the Multiple Choice and FR parts? Is there an Appendix of the Case Study methods?</p>
<p>^you get that on the day of the test</p>
<p>is this basically the same as the A test reference materials? I found the link to the ones designed for the A test, but I couldn't open the file.</p>
<p>does anyone know where on the Collegboard website I can find the FRQs of last year?</p>
<p>Also, 5 Steps to a 5 and Barron's seem to contradict each other on what's a heap. 5 Steps claims that heap have the higher value of roots whereas Barron's says it's the reverse way. Can some please clarify definition of a heap? thanks</p>
<p>regards</p>
<p>70 - 100 = a 5, so go for 25/30 on MC/FRQ and you're good.</p>
<p>BTW I don't see what's so hard about barron's if you know your A material really well...</p>
<p>Go to "Sample Questions and Scoring" on the page where you can download the course description (on Collegeboard, NOT AP central)</p>
<p>How important is it to do the Analysis Questions and Exercise Sets for the MBCS? Do similar questions show up as FRQ's?</p>
<p>
<p>regards
There are two types of Heaps:</p>
<p>A MIN HEAP is when your roots have smaller values than its children. A MAX HEAP is when you have higher values in the roots. So basically, the smallest number is at top in a MIN HEAP, and the largest number is at top in a MAX HEAP. 5 Steps to a 5 seems to use max heaps, and Barron's min heaps. </p>
<p>Either way, they usually tell you what type of heap their references in a problem.</p>
<p>i know this thread is titled baron's ap comp sci, but i have princeton review and im curious. i took the AB practice test today, and got a raw score 28 out of 40, and that includes the 2 points i lost for deductions. but, the test seemed kinda easy, so does anybody know how PR's AB practice test mathces up with the ap exam?</p>
<p>The differences in definition can be very confusing though--especially when it comes to doing the heap sort. Barron's does a completely different method compared to 5 Steps.</p>
<p>i don't have barron's so i do'nt know how they do heapsort, but it's really not that hard. just write a for loop and copy everything over to a heap (PriorityQueue most likely). then remove everything from the heap and put it back in the original array. as far as the add method goes for the heap, its not too bad.</p>
<p>good work, sk33. If you can get at least 7 points per free response then you should be good for a 5.</p>
<p>Thanks Feez for the clarification.</p>
<p>Yeah, I took the Princeton one too and it seemed easy.</p>
<p>I just found out that there are a couple of changes to the A test this year (compared to previous years...with a new edition of Java or something?). Do you guys know what these changes are? I heard they're pretty minor, but I still want to know.</p>
<p>All I know is that there's a new for loop that's included in the java subset, the for-each loop. There might be more but that's all I know. =/</p>
<p>Yeah, I think it's just Java 5 additions. The for-each loop is one of them, but that's really easy to use and it's pretty handy.</p>
<p>wow...i think i'm so .... =(....
can anybody plz clarify the application of Big O notation...i mean i get that
2x^2=x^2 run time...but can someone tell me how do we get the equation 2x^2 just by looking at the code??? =( omG....am i lost =(</p>
<p>^ <a href="http://www.apcomputerscience.com/apcs/misc/BIG-O.pdf%5B/url%5D">http://www.apcomputerscience.com/apcs/misc/BIG-O.pdf</a></p>
<p>Check that out. It might help.</p>
<p>Ah, its tomorrow. Anybody else feeling a little screwed?</p>
<p>yeah i definitely am, didnotfaillife</p>