<p>yeah, around 75% is a 5 on comp sci… it is a pretty harsh curve</p>
<p>took the AB this year… started studying for it two days ago, so i thought i’d be screwed
skipped two on the MC, but probably missed a few as well (should have skipped more!)
but i think i did okay on the frq… so expecting a 4 to 5. good luck to all :)</p>
<p>oh, and you A testers need to quit worrying… you’ll get your 5s in the mail soon…</p>
<p>i took AB and it was “okay” for me… still tough…everybody else in my class said the test was damn easy…maybe it was the last gift from AB cs test makers</p>
<p>What would a 50/80 and a 55/80 be (for Comp Sci A) and what do you think the overall performance across the nation was (like will the curve be harsh or easy or like last year)?</p>
<p>Thanks guys, you’re giving me confidence!</p>
<p>FYI guys: </p>
<p>Computer Science A:
60-80: 5
45-59: 4
33-44: 3
25-32: 3
0-24: 1</p>
<p>from <a href=“http://talk.collegeconfidential.com/1062365260-post106.html[/url]”>http://talk.collegeconfidential.com/1062365260-post106.html</a></p>
<p>I have no idea how accurate it is, though. Does anyone know?</p>
<p>Anyone know if it’s accurate? ^^^</p>
<p>That seems fairly accurate. I’m almost positive the 4 and 5 ranges are correct (without accounting for yearly fluctuation)</p>
<p>im taking the B version of the comp sci A test…</p>
<p>could anyone hook me up with a practice test or something cause i haven’t even gotten a practice multiple choice question from my school.</p>
<p>Thanks</p>
<p>My Barrons book said 70-100 is a 5? Is that accurate?</p>
<p>thats probably for that version of the test</p>
<p>and Barrons tests are like ridiculous - they have so much unncessary things</p>
<p>Barron’s score ranges are accurate. Barron’s are awesome for Comp because they work you so hard that when you get to the test, you’re like, “Oh. That was easy”
xP</p>
<p>yep 
agree with computergeek173</p>
<p>It has been 48 hours since the test was distrbuted. We can discuss FRQs freely now!</p>
<p>My Question: On the board game FRQ, did you guys have super long if statements?</p>
<p>
I can’t believe how hard it was for me to recall, but YES. More specifically, I just had a ton of really redundant if statements. If I was on a computer, I could have easily copied/pasted, but yeah…</p>
<p>I didn’t like the GWCS question, but that was more because I had resigned myself to failure and yet <em>hopefully</em> did really well on the other 3, plus the fact that I never really studied GW.</p>
<p>yeah, the if statements were longer than the width of the page!
The GWCS took some time for me to figure out, but i think i got it… hopefully</p>
<p>I don’t remember any long if statements. Did you guys take the A exam? I took AB. All seemed fairly concise as I wrote it.</p>
<p>Yeah, section A. Question 4 to be specific.</p>
<p>hey guys we should post parts of problems. ill start.
heres my solution to 1a.
by the way the questions are already posted on the ap central site
<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;
public static int getCubeTosses(NumberCube cube, int numTosses)
{
int tosses=new int[numTosses];
for(int j=0;j<numTosses; j++)
{<br>
tosses[j]=cube.toss();
}
return tosses;
}</p>
<p>someone post the solution to 1b!!! and then keep the ball rolling!
this way we can see how we did without waiting 2 monthes
ps. im allowed to do this right? post the solutions? link to them?cause if im not ill edit it immediately</p>
<p>1b was like getLongestRun right?</p>
<p>i did this:</p>
<p>public static int getLongestRun(int values){
int longestRun = 0, currentRun = 0;
boolean inRun = false;
for(int i = 0; i < values.length - 1; i++){
if(values* == values[i + 1])
if(!inRun){
inRun = true;
currentRun = i;
}
} else{
if(inRun){
inRun = false;
if((i - currentRun) > longestRun)
longestRun = i - currentRun;
currentRun = 0;
}
}
if(longestRun == 0)
return - 1;
return longestRun;
}</p>
<p>U used a boolean for the longestRun one? </p>
<p>Anyways here is wat i did for the gridworld one</p>
<p>public stockPileCritter extends Critter(){
int stockPile;</p>
<p>public stockPileCritter(int s){
stockPile=s;
}</p>
<p>for(int i=stockpile; i>0; i–){
super(act);
setstockPile();
}
if(stockPile==0){
removeSelfFromGrid();
}</p>
<p>public void setStockPile(){
ArrayList<getneighbors>Neighbors=getNeighbors(); //NOT ACCURATE, BUT U GET WAT I AM DOING?</getneighbors></p>
<p>stockPile+=Neighbors.length();
}</p>
<p>}</p>
<p>P.S. I’ve struggled with CompSci this whole year, so i doubt if this is accurate.</p>
<p>oooh…that doesnt look like what i did</p>
<p>ur supposed to override the processActors werent u?
heres mine</p>
<p>public StockpileCritter extends Critter
{ private int stockpiled=0;
public void processActors(ArrayList<actor> actors)
{ for(Actor actor: actors)
{
actor.removeSelftFromGrId();
stockpiled++; }
}
public Location selectMoveLocation(ArrayList<location> locs)
{ stockpilled–;
if(stockpilled=0)
{ removeSelfFromGrid(); return null;}
else super.selectMoveLocation(ArrayList<location> locs)
}
}</location></location></actor></p>
<p>anyway i think im right about the process actors but i wasnt sure about what other
method to override. and it was supposed to eat rocks as well right?</p>