<p>Im taking the Compsci AB Exam in a lil over a week.</p>
<p>1).
We have been doing multiple choice exams from the Barrons. My scores are pretty low (We take around 36 question tests...and I end up getting in the 11-14 range :( ).</p>
<p>In terms of the FR, I can say I'd be getting around 5-6ish on each question.</p>
<p>Should I be intimidated by my low score on the Multiple Choice?</p>
<p>2).
In terms of what I know:</p>
<p>I understand the IDEA behind the different structures (Queues, Linked Lists, Tress, etc), pretty much how they work. I am going to review the code and maybe write one more program.</p>
<p>We did some practice on the Marine Biology, I got that fairly quickly.</p>
<p>My weakness seems to come from sorting. Especially stuff like Hashing and the big Os.</p>
<p>How should I review for the next couple of days (I'm not craming ,I have been studying)?</p>
<p>Im taking the AB exam. My prep is going to be writing all the sorts; merge,quick, bubble, insertion, tournament, and then I am hoping this will make me remember them and there big O I will get form that.
I didnt do much stuff on hashing, so I cant really help you there.
The rest of today I am going to be recoding the stuff on hashing and priority ques.
Is there a lot of the Big O stuff on there, because I didnt think it was that much. It seemed pretty easy, especially since you dont have to write effecient code for the OR.</p>
<p>The stuff I am rewriting is how to print out a tree
in,post,pre,by level (top down and bottom up)
Post/Pre notation as far as 2 4 * = 8 stuff like that</p>
<p>I think the max that you get off a question is like .5/9 if you interchange semi colons and colons or forget (). Most questions dont require you to declare new variables.</p>