<p>What did you guys thing of the test? I did not end up finishing the last two multiple choice questions. Did anyone else have this problem (I was surprised, since i finished the Barrons Tests very early)?</p>
<p>I didn’t think the multiple choice was that hard. I ran out of time on one of the questions so that was my only guess. The free response, though, wasn’t too hard, but I still struggled with it a lot for some reason. My brain just stop functioning… :(</p>
<p>I thought it was pretty similar to the Barron’s tests I did in terms of difficulty, but I thought the MC was a bit more tedious than the Barron’s tests, so I ended up taking quite a bit longer than I expected to as well. The FR was pretty much exactly what I was expecting.</p>
<p>I finished early on both sections. I thought the multiple choice were definitely tedious, but not hard. Free responses were a bit more difficult. #4 was tricky in its wording, and I didn’t override a method I should have for #2, but I think I did well overall :)</p>
<p>MC wasn’t bad… </p>
<h1>4 on the FRQ seemed pretty far out there. i found the GridWorld one to be a little more challenging than i hoped.</h1>
<p>overall it was pretty decent.</p>
<p>laurora, which methods were we supposed to override?</p>
<p>@etennis12 - Totally missed your initial question lol. I was reading your post from my phone :P. I can’t remember the last two, but I know I initially had issues with the very last one. It was definitely a harder one, so don’t feel bad.</p>
<p>@Rahful - Agreed. & we had to override processActors so that it would have the critters move closer to the AttractiveCritter, and also getActors (I’m not sure that’s exactly what it’s called; it’s the one that gives you an ArrayList of Actors) so that it would include all of the Actors around the AttractiveCritter rather than just the adjacent ones. Forgot about the latter . I may have forgotten more than just that, but I think that was it. I included a constructor too. Can’t remember what else. Am I missing anything?</p>
<p>I found this exam to be very easy. There was one, maybe two multiple choice questions that gave me some hassle. I feel confident about my FRQ answers, but it’s always hard to tell without a compiler. #4 really required a bit of thought on my part but I ended up using what I thought was a decently elegant solution. I’ll attempt to rewrite my solutions and post them here after 48 hours!</p>
<p>Oh, that test made me happy… I actually felt wonderful about it.
The Barron’s MC tests that we took in class were MUCH harder.
On the other hand, my brain partially shut down for some stupid reason on the FR part. Luckily the first one (sound waves) took literally 5 minutes. Also, the Grid World question was easier than expected. (Default constructor for that, yes?)
Then I struggled on the last two but had enough time left that I finished. The third one, fuel tanks, wasn’t that bad but I for some reason couldn’t think. The last one was kinda difficult. Luckily they did the scrambling for you. I had like 10 minutes left to do part b on that so I just wrote down a first impression solution that seems passable, at least for a few points. Overall, could have been much worse.</p>
<p>Three questions??</p>
<p>What did you think about #3 the problem about the robot that gets the fuel tanks and the index of the one witht the lowest value below the threshold??</p>
<p>For the second part of that problem what it you do when it asked you to move the index so that it would match up to the locIndex??</p>
<p>What did you do for number four with the dual matrix??</p>
<p>ahh ok laurora, i overrode (is that the correct word, lol?) those two. even knowing that those two were the correct ones to override, i still thought it was a challenge… if i recall correctly, i used the getOccupiedLocations method (please note I can’t recall the exact methods by name) to make an array list of locations, and then used a for each loop to traverse that arraylist and create a new one of actors (to be returned) with like the .get(Location) method to get the objects rather than the locations. </p>
<p>uhh… yeah, i don’t know. for my response to the gridworld frq, i used just the one page that had the question on it and found that i left like 2 more blank that were available to continue writing… so i don’t know if i missed a lot or what… i didn’t make a constructor, were we supposed to? i thought it just was the default constructor of the actor class…i know i don’t have functional code for #2 and #4 but a definitely feel i did some things that will give me partial credit. </p>
<p>i feel farily confident for 1 and 3…</p>
<p>how did you do part B of the first one where you had to make a shorter array that has the initial 0’s removed? more specifically, how did remove only the first 0s and not all of them? i did something like…</p>
<p>int pos = 0;
while(array1[pos] == 0)
pos++</p>
<p>//and then made a new array
int[] array2 = new array[array1-pos]</p>
<p>hopefully that makes sense?</p>
<p>^ i had a variable that counted amount of zeros, then set the array to songs(or whatever it was called).length minus numzeros
Then I set all the 0 values in the first array to null
and then just a simple while loop != null, it would add the values to the new array, and ofcourse had it set up so it wouldn’t be an infinite loop.</p>
<p>i didnt have time to do like 6 MC ._. , are we allowed to discuss the MC or no?</p>
<p>@DannyNobel
Nope, technically never.
But I mean, you can hint at some…
I’d say computer science is the test where it matters least.
There’s only a limited amount of content that they test you on, so it’s basically just variations on the same thing.</p>
<p>@ Newton
For the robot least value one -
index i = 0; FuelThing lowest; int min; int j;
for(FuelThings ft : thatArrayList){
if(ft.getFuel < min)
lowest = ft;
j = i;
i++;
}
</p>
<p>That gave you the the lowest fuel value, the tank, and the index of the tank.</p>
<p>@ thes1tuation -
Your solution doesn’t work because int cannot be null.</p>
<p>thes1tuation- i dont see how your approach would avoid the 0s located in the middle of the array as opposed to solely the ones at the beginning</p>
<p>dannynobel- in the past, people have made chatrooms to talk to others… you can imagine what the topic of conversation would be… however, AP makes the request that their questions not be discussed, so on a public message board would not be the ideal venue.</p>
<p>I did something pretty different than thes1tuation. </p>
<p>Mine was kind of weird in counting the zeros, but it worked. I used a for loop and had a variable named count and boolean named done (or something like that). Boolean done was initially false. That was how I made sure it didn’t go on to count a bunch of other zeros. I think really strangely…but my loop was something like:</p>
<p>for(int x=0;x<array.length;x++)
{
if(array[x]==0 && !done)
{
count++;
}
else if(array[x]!=0 && !done)
{
done=true;
}
}</p>
<p>After using that loop, I created a new array with a length minus array’s length, and used another for loop to fill it. Something like: </p>
<p>for(int x=0;x<newArray.length;x++)
{
newArray[x]=array[x+count];
}</p>
<p>And then I finished with:</p>
<p>array=newArray;</p>
<p>would you guys estimate a 70%+ = 5 curve?</p>
<p>@SuperCuber - I don’t mean to post again immediately, but would it be okay if you just immediately returned the first index of the threshold? I normally don’t do that, but I was trying to be quick in coding. So mine was something like</p>
<p>for(int x=0;x<whateverItWasCalled.length;x++)
{
if(whateverItWasCalled[x]==threshold)
{
return x;
}
}
return filler.getIndex();
…or whatever the method was.</p>
<p>…P.S. I really need to start reviewing calculus, not think about the already-over cs exam hahahah :P</p>
<p>Guys use
tags when posting - much easier to read.
@ laurora - Unfortunately, no. That's what I did at first. However, the specifications said specifically to return only the LOWEST fuel values under the threshold. </p>
<p>And you mean: </p>
<p>if(whateverItWasCalled[x]<=threshold)</p>
<p>not </p>
<p>if(whateverItWasCalled[x]==threshold), right?</p>
<p>laurora- yup i had about the same thing. i think our code accomplishes the same thing. </p>
<p>for 1, part A, i had something like</p>
<p>int changes = 0;
for(int i = 0; i < array.length; i++)
{
if(array* > threshold && array* > 0)
{
array* = threshold;
changes++;
}
else if(array* < (threshold * -1) && array* < 0)
{
array* = (threshold * -1);
changes++;
}
}
return changes;</p>
<p>how about you fellas?</p>
<p>For the sound one I did something like:</p>
<p>int count = 0;
while(count < samples.length && samples[count] == 0) {
count++;
}</p>
<p>int[] newarray = new int[samples.length - count];
for(int i = count; i < samples.length; i++) {
newarray[i-count] = samples*;
}</p>
<p>For the GridWorld one I overrode getActors() and processActors()…were we supposed to override any others?</p>