<p>Hey bco09 – thanks for posting. Looking through your answers, I have to say, we did each program EXACTLY the same way. =D Hopefully those will be the right answers.</p>
<p>haha sweet anjoola, np. that’s what i’m hoping too :P</p>
<p>/sigh too late to edit.</p>
<p>idk which way i did on the actual test (i’m retyping all of these from memory – not based on my green booklet), but the lines of code from #1 b that read</p>
<p>
TreeNode temp1 = new TreeNode(current.getLeft());
TreeNode temp2 = new TreeNode(current.getRight());
should really be
TreeNode temp1 = current.getLeft();
TreeNode temp2 = current.getRight();
</p>
<p>The AB free response questions are on APCentral, but does anybody know when they post the answer key to those questions?</p>
<p>They don’t decide the point distributions until grading time, so probably around then.</p>
<p>@rj42492:</p>
<p>I don’t know how to wait that long.</p>
<p>BTW, I did the same thing that you did in parts 4a and 4b with re-writing code. However, I think we will only lose one point, because the rubric probably awards one point for calling the method from part a, and that’s it. The AP doesn’t really care if your code is inefficient; they just want you to call already written methods, and even if you don’t, it’s only like a 1 point deduction.</p>
<p>Judging from bco09’s answers, I think I’ve nailed this FRQ 
Now, if APUSH and Biology weren’t so difficult…</p>
<p>@bco09: you realize that you set both TreeNode’s children as right children? >_> (the way you typed it, I mean, by putting both the nodes in the 3rd parameter of the constructor). And also, you realize that you didn’t have to retype the whole methods every time, like in the growTreeHelper (or w/e it was called) method, and in the case study (where you retyped the makeMove method). you could’ve just used super.w/e. lol. i’m sure it’s not a big deal, but it’s a lot more writing.</p>
<p>oh, and you needed to check to see if this was inside of the set for 4b… so like, if (a.contains(this)) a.remove(this); or something. >.< oh, and on 1b, it would’ve been a lot easier to do a post-order traversal:</p>
<p>while (current != null)
{
growTreeHelper(current.getLeft());
growTreeHelper(current.getRight());
if (current.getValue() == val)
expandNode();
}</p>
<p>or w/e, something like that.</p>
<p>Oh, and lol, it was probably unnecessary, but I used like ListNodes for question 3. it worked the same, but i was just kinda thinking they’d want some sorta AB topic in there, heh.</p>
<p>hey, ya good call for 1a. I know for a fact that i had the parameters right on the test, i just messed it up here lol.</p>
<p>Edit: oh and i see what you mean about having to check for this… though that seems dumb since i may want to add myself as a contact (at distance 0). /sigh. well maybe 7-9 on each FRQ for me. should that put me in good shape for a 5?</p>
<p>And i agree post-order traversal would have been better for 1b. In fact, my solution is actually pretty horrible memory-wise to do recursively (i think) since I create two extra pointers on every method call. But whatever. if it is true that they don’t care about efficiency of the code, then i should be fine. lol.</p>
<p>Don’t forget that you had to remove the intial person from the contact set before returning. It expressly said “not including the original Person” or something like that.</p>
<p>Yea, I remember that, was about to post on it.</p>
<p>for mine(using a set named allContacts)</p>
<p>I just did a </p>
<p>allContacts.remove(this);</p>
<p>before returning it</p>
<p>That’ll work right? took me forever to think of how to get rid of the current person when there was no instance variable representing him</p>
<p>Other than that I thought the multiple choice was relatively hard, but the Free Response was easy peasy, me and the other kid who self studied it at my school finished the test 50 minutes early…and then just slept</p>
<p>Yeah, we finished waaaay early, too. My friend almost wrote a checkers game using a gridworld grid in his answer book, lol. He almost finished it, and had it all inside a block comment so it wouldn’t be graded.
/*
*
*
*/
and whatnot. I thought it was pretty funny.</p>
<p>@bco: Yeah, don’t worry about it, it’s fine. My friend told me that they grade on the fact that something works, not how it works (like abstractions).
@manyman: yeah that’d work. I just did an if statement because I wasn’t thinking at the time whether a set would let you remove something if it wasn’t there in the first place - I just checked, and apparently you can.</p>
<p>and yeah, lol, i finished the free response an hour beforehand. XD however, in the AP Lit essays, I finished with 10 seconds left >_> you can see where my strengths and weaknesses are. 
i’m actually getting credit for AP CS next year, tho (not lit), so I really didn’t care as much.</p>
<p>I took AB. Out of curiosity, is computer science AB one of the easier or one of the harder AP classes in existence?</p>
<p>Just for comparison.</p>
<p>really depends on your skill set and interests.
do you like computer programming in general?
i love it and found it to be an incredibly easy self-study
in general, it’s relatively easy but some people find it to be the hardest one.</p>
<p>I’ve already taken it (exam and all). I found it easy, but is it just an easy AP?</p>
<p>By any chance, does anybody have the Comp Sci A answers?</p>
<p>I have my ap comp sci final coming up(may 24-25) and was wondering if anyone had any previous MC they could email me?
<a href="mailto:nic.smitzi@yahoo.com">nic.smitzi@yahoo.com</a></p>