<p>@smeagle:</p>
<p>If you trace the stack, you’ll see:</p>
<p>(each ‘-’ is a recursion level)</p>
<p>4
-3
–2
—1
—1
–2
-3
4</p>
<p>Hence, 43211234 is printed.</p>
<p>Well what the method is doing is putting the remainder numbers on the beginning and end of print, so 4 would be printed in the beginning and end. Then,mystery takes in a value of 123, for which the remainder is 3. This is then stuck after and before the 4’s. so it would be 43…34. The program keeps doing it until it reaches the base case which is when it ends at 1, resulting in 43211234</p>
<p>@fa, not much. It’ll help save money in college as you won’t have to take the class and therefore u can have more time to focus on your major; you don’t even have to send ur scores to the college if ur unhappy with it.</p>
<p>Don’t think of it as stuck between the 4s. In the second recursion level, the second 4 isn’t even printed yet. (look at my stack diagram to see what I mean)</p>
<p>First 4 is printed, then 3, then 2, then 1, then 1, then 2, then 3, then 4.</p>
<p>@matt, the == operator checks to see if two “point” at the same reference whereas the equals method checks to see if the two objects being compared have the same content. So if two string objects are exactly the same but do NOT point to the same reference, then == returns false. The equals method will say they’re the same though.</p>
<p>I see what you mean but I usually try to find a pattern in the code after two or three recursions and it was clear to me that the first run of the method produced 4… 4 where the last 4 would eventually be printed regardless cause the x value in the first run doesn’t change, you can do it many different ways though so I think yours would be a more easier approach to look at!</p>
<p>I got this from someone else and I was looking for it everywhere too, but go crash the servers. :)</p>
<p>[2009</a> computer science A.pdf](<a href=“File sharing and storage made simple”>2009 computer science A)</p>
<p>Anyway, does anybody know if the recent exams are going to be like the Barron’s one? They were somehow really different, I had at least 10+ wrong compared to the 2008 practice exam and I’m aiming for a 5, so with the low curve and all this is really discouraging. -___-</p>
<p>@elyvine - Alright thanks for that. So, I suppose that the equals reference would be better in most cases if you are comparing two integers or two strings.</p>
<p>@avg1000
I love you so much right now.</p>
<p>will javadoc be on the exam?</p>
<p>@matt</p>
<p>In addition to what elyvine said, == will check for value for value types (i.e. int)</p>
<p><a href=“http://■■■■■■■■■■■■/17PW40xS[/url]”>http://■■■■■■■■■■■■/17PW40xS</a></p>
<p>NOTE how iInt == cInt is true. This is because java does some integer caching under the hood:
<a href=“Java gotchas - OWASP”>Java gotchas - OWASP;
<p>@matt, np and yes it would!</p>
<p>Alright, oh and what do we need to know regarding the concepts of Bounded and Unbounded grids in GridWorld?</p>
<p>@avg, the Apcs is way easy when compared to Barron’s. don’t stress out if you didn’t do that well on the Barron’s; I bought Princeton and the practice mc feel just like the actual exam mc.</p>
<p>Don’t think bounded and unbounded will be tested, it’s mostly just bugs, critters, actors, grid, location and the bugs and critter subclasses</p>
<p>@elyvine Did you take it after 2011? Do you know if the questions are more conceptual based or applied based? Really, I’m not ready for a conceptual test. ><</p>
<p>Basically, it’s mostly just a bunch of code asking you to find out the resultant printing. So it’s more applied based, lots of recursions,arrays and arraylists , ect.</p>
<p>So pretty much tracing code for the mc? that’s kinda what i’m expecting</p>
<p>Yeah, if u look at released exams, it’s mostly finding what the code spits out</p>
<p>@danebrick:
You are given the quick reference for the free response:
<a href=“Supporting Students from Day One to Exam Day – AP Central | College Board”>Supporting Students from Day One to Exam Day – AP Central | College Board;