AP Computer Science

<p>If you skipped an entire free response section then I doubt you'll get a five o_O</p>

<p>At most a three, but he/she said that only the MBCS problems were not completed, which is 20%. If everything else is correct, a five can be achieved.</p>

<p>Well it all depends on your MC score...I mean, I think I got a 35 - 39 on the MC and yet only a 19 - 23 on the FR...even the worst case scenario puts me at a 5, but we'll just have to see how it goes.</p>

<p>On 1a, I coded it similar to the way NoxLuminis did. I used a while loop, (the condition was something like while num>1...or something like that, so that when dividing by ten resulted in a decimal, the loop would stop evaluating), used the modulus to find the last digit, tested, then divided by ten.</p>

<p>It was along the lines of:</p>

<p>while(num>=1 && num%div == 0)
{
div = num%10;
if(num%div !=0)
return false;
num = num/10;
}</p>

<p>There was a little more to it, I think. But it was pretty simple, only a very few lines of code.</p>

<p>well one free response question is 12.5% if they are weighted equally, so it shouldn't hurt my score that badly</p>

<p>i'm hoping around 60% gets me a 5. anyone know from practice tests if that's realistic?</p>

<p>Well thats assuming you get about a 75% on the MC...otherwise you're a reac hfor a 5 since a 68/100 is the cut off for a 5...</p>

<p>The solution I used for the first question on the A test was:</p>

<p>public boolean isSelfDivisor(int num)
{
int stripped = num;
while(stripped != 0)
{
int thisDivisor = stripped % 10;
stripped /= 10;
if (thisDivisor == 0 || num%thisDivisor != 0)
return false;
}</p>

<pre><code>return true;
</code></pre>

<p>}</p>

<p>Does this look right to you guys?</p>