<p>@ssgupta CollegeBoard isn’t trying to create an exam that matches what is done in real life, but matches what is done in college. College exams are … well, just as unrealistic. </p>
<p>@foolish @terrapin45 The method I referenced in a nonstatic context was for the scramble FRQ. I think I did word.scrambleWord() instead of scrambleWord(word). I’m not entirely sure but I probably did.</p>
<p>Again, not knowing the problem (none of us do until tomorrow at 4pm, right? 
) … something like that is certainly a deduction. Probably you end up losing the one point on the rubric that corresponds with what that line of code is attempting to do.</p>
<p>For the last one with the Trio class, I just said the price is the sum of the drink + the sandwich. I noticed that in the list given, the drinks and sandwiches were all more expensive than the side. Do you guys think this was okay to do?</p>
<p>They probably wanted it generalized to more than just the example menu.</p>
<p><a href=“AP Computer Science - Wikipedia”>AP Computer Science - Wikipedia;
<p>I’m not worried at all, the distributions are such that so long as you didn’t bomb it, there’s a pretty good chance you got a 3 or better - which is all I need for the college I’m going to. </p>
<p>@Fantasysia I though of doing that at first, but then I realized that the list it provided was just an example, and the program should have applied to all possible scenarios. You will probably lose one point for doing that. No big deal.</p>
<p>@mac135 There was one blank page for the entire class though, I get that the method would have been short, but I feel as though they just wanted to test you on implementing an interface and actually defining the methods.</p>
<p>Generalizing the getPrice() method wouldn’t be extremely longer, its only 3 if statements (how i did it).</p>
<p>@Fantasysia I’m pretty sure it was to account for all possible scenarios of prices. The space they gave was really quite small - I’m sure that was their main goal, but you’ll probably just lose a point for doing that.</p>
<p>@pthep2 Honestly I think it won’t make too big of a difference like you said. The other fr’s were straightforward and fairly easy. Although the MC’s were very rough for me</p>
<p>I had the most trouble with the first FRQ. It said something like, “If there are two consecutive letters containing an A followed by a letter that does not contain an A, the two letters must be swapped.” I was a little unsure how to interpret this. What did everyone else think of this?</p>
<p>@Fantasysia Yeah the MCs seemed to be pretty rough for everyone. Analyzing pages of code line by line wasn’t fun.</p>
<p>@student001 I used charAt for that one, idk if we were allowed to tho</p>
<p>@student001 I used String.indexOf(), that was in the appendix as well.</p>
<p>@mac135 Hmm I just checked to see if the word was longer than 1 character, then i had a counter and checked to see if the element at the counter was A, and if the element at counter + 1 wasn’t A. I swapped the two then incremented counter by 2 (to not touch those elements again). I did this until count was counter was length-2</p>
<p>@Fantasysia @mac135 I actually used both of those methods, but how did you ensure that the post condition (no letter can be swapped twice) was met as well? I created an array of Boolean variables, but idk if that was correct. Also, how did you actually do the swapping of two letters?</p>
<p>@student0011 I incremented my counter by 1 in the for loop, but if the conditions were met, i increased the counter again by 1. That way, it would skip from the A to the element that is after the element after the A. I think that makes it so that neither the A nor the letter following it would be touched after the swap.
For the actual swapping, I set the A to the element after it, then just set the element after the A to an A.</p>
<p>The way I made sure that you only swap the letter once was is if the condition was met, increment +2, else, increment +1. I was scared to use non subset code, otherwise what I would have done is convert the word into a char array, the work from there. Instead I used tons of word.substring lines, which I’m sure I messed up.</p>
<p>I actually did it recursively, sorting the first instance of “A”, then splitting the word, then sorting the section that was split off.</p>