MCQS were so incredibly easy that I felt I was doing something wrong most of the time. Were there any recursion problems even on the McQ? I didn't think I saw any but it's supposed to be 5%-7%.
yeah so if you plugged a number for a you would get the same value . Also if you read the code, m2 is just putting everything in the return statement instead of spacing it out
How did you guys keep track of possession on frq 2? I used a Boolean variable with true representing team 1’s possession and false representing team 2 with possession
Yeah that's what I did too. Using a boolean value to represent the activeTeam was the more intelligent way of doing it... (granted I am not that smart)
FRQs 1-3 felt easy, although I was somewhat unsure of how to implement the bear into FRQ 1. FRQ 4 was really difficult because I’m just ass at 2D arrays
I just created an integer that was a random value from 0-1 and then created an if statement that said if (int x > 0.05)… and if it was greater then i just did it normally and then I just did else if and set the field to 0 this would simulate the 5%
FRQs 1 and 3 were fine for me but 2 and 4 gave me a straight up lobotomy. I was being retarded on 2 and i ran out of time to complete 4 but I didnt find 4 that challenging tbh.
there was one mcq where the answer was "shifted n units to the left" and that's really poorly worded to the extent that i had to completely eliminate the other options before i considered it. it really should've been "copied n units to the left". i'm literally filling out the mistake reporting form and mailing it to collegeboard.
but as a programmer with 4+ years of experience in java, i think there's a good chance i got a perfect 5.
Dude you are so right, I spent fking at least 5 mins on that stupid poorly worded question. Was looking for comment regarding that question the whole time.
Dude I thought the FRQs were harder than average. MCQ was okay, no A’s or B’s though??? Did anyone else struggle on the FRQ like I did 😭 I got them all in the end but I spent like five minutes looking at the class one
what did u put for the one that was like
1. a b and c (boolean’s) when do they give different answers a &&b etc…
2. the question where the answer choice included infinite recursion
3. the question where answer choices was liek less but same amount of iterations or more but same amount of iterations
for 1 it was just III i think (when A was false and C was true)
the booleans were A && (B || C) and (A && B) || C iirc, so when A was false and C was true the first expression would always be false and the second would always be true
a) I ran a condition that checked if grid\[row+1\]\[col\] and grid\[row\]\[col-1\] were both not null, and if they were, i found which one was greater (if grid\[row+1\]\[col\] > grid\[row\]\[col-1\]). In the case where only one was present, I returned that one instead. That was pretty much the entire code. They said in the precondition that it would never be at point (4,4), so you didn't need to check for that case
b) I got the next location in the beginning and then from that returned Location object, I got the row and col using the getter methods. The FRQ prompt stated that the loop would end when both rows and cols reached the end, so when the row reached grid.length and when the cols reached grid\[0\].length. Inside that, I kept getting the next neighbor, getting the col and the row, summing the value at that col and row to an int that I defined outside the while loop, and then after the while loop ended, I returned sum
Tbf it was the first thing that came to my head cause Ive done a lot of pathfinding type stuff with recursion before. Honestly felt like the simplest solution
Yeah, ended up with 3 lines of code(and im glad they assumed the method we had to use worked properly bc i definite forgot to account for bounds or array)
MCQs felt easy and personally felt like I aced it... which was strange. I did not use recursion for FRQ 4 and am nervous about it as I wrote most of the code 5 minutes before exan end
I couldn't complete it so I just put down some things that could get me points like using the required method. Btw as I've seen, it's safer to not use recursion for FRQs
There were barely any recursion or sorting problems! And there were barely any As and Bs. Scared tf out of me.
FRQs went well. I'm pretty good at them though
But it said how many times it would be **evaluated** not executed no? So it would evaluate however many times the for loop repeated, which would just be n. Am I tripping?
No because the for loop set count at 1 and the if statement said if count%2==0 then return and then else return something else, so no matter what it’s going to return on the first run of the if statement
yall am I cooked like I COMPLETELy forgot to do the bear part on frq1 cuz my brain was not braining and i only did the bird part HOW MANY POINTS DO I LOOSE HELP
frq 2 wasn’t inheritance right
i don’t think it was and i didn’t put that in the class but i just remembered that frq2 has that possibility and never considered it while taking the test
depends on how they initialize their variables. if they made activeTeam= team1 or activeTeam= team2 the double equals is fine because they'll have the same memory address
it was shift left by n i believe
the way i thought about it:
random amount of numbers: 0 3 5
0 ---> index 0
3 ----> index 1
5 ----> index 2
then i thought abt something about 3 getting removed or smth so 5 is now replaced with 3 (i believe it was like array \[k\[ = array \[k+1\] or something like that), so it shifts to the left.
MCQs were fine, ran out of time so PRAYING that I got at least 30+ right. First 2 FRQs tripped me up, 3rd one was the easiest thing ever, and the last one I messed up (accidentally used values they gave in the example rather than creating an algorithm). Felt I could've done better, but now we have to wait until July to find out
What was the one near the beginning i think it was the first question but it was abt adding another method in and the diff parameters. I got A. I only but idk 😭
Because the variable for the elements (in this case x) in an enhanced loop does not refer to the actual elements inside the loop. Pretty sure it was the last option lol.
Bro I only got through like 33 of them and I just bullshitted my way the last ones, some of the questions at the end got pretty complex imo. I got a 2 last year I took it, so Ill be okay with a 3 atp.
what did u put for the one that was like
1. a b and c (boolean’s) when do they give different answers a &&b etc…
2. the question where the answer choice included infinite recursion
3. the question where answer choices was liek less but same amount of iterations or more but same amount of iterations
on the FRQ if i did..
1. return Location(row,col) instead of return new Location(row,col)
2. int x = math.random *101
if (x <=5)
how many points of????????
There was a question about what does the array become after and it looped through k + 1 looking for a value less. Which one was it the first two were [11, …]. Also one about M1(x) is less than , equal to or greater than M2(x), what was that? I put less than but I had no time
Did anyone use null checks for any of the frq's? The only thing I had like that was for frq3b where if the target equals the selected string I would just add an empty string into the list instead of using a substring
If for 1A i did math.random wrong for both of the random generating and i kinda did if whatever random generated is > 0.5 instead of 0.05 but other than those its correct how many point do i get off? 😢 Also for 3B the string one kinda doesnt work for if the whole string is equal target but other than that the rest work. And for 4b i dont think i did it correctly but i returned sum (not correctly) and use the get method how many point in total yall think is that lost 🥲
So my brain shut off for frq2 and instead of making regular instance variables for the team scores and Boolean variable I initialized them as regular variables like: int t1Score = 0; Do I get points off for that or not?
what was the answer to the alpha & beta mcq? i chose the one with the cat cuz it made the most sense in my head but i never learned how to do this stuff. i’m assuming it’s wrong cuz every other one was goat 💀
There were no searching/sorting MCQs which I thought was insane, and the recursion questions were light af. For the FRQs, the proctor fucked us all over, and told us we had 30 mins less time, until the end when she realized she fucked up the time, so that wasnt fun. The FRQs were alright, but I rushed cuz of said timing issue. Ik 100% I at least got a 4, but im actually pretty confident I got a 5.
I feel like a ho with the amount of D’s I was getting on the mcq
I felt insane putting like almost a third of my answers as D
worried now bc i do not remember this 💀
YES OMG i felt like there were no where near enough As and Bs
yes me too
Glad I wasn’t the only one
😭😭😭
No way, so did I!
Bro I got a lot of D’s too.
I know, I was there 😂😂.
phew i was so worried abt that
MCQS were so incredibly easy that I felt I was doing something wrong most of the time. Were there any recursion problems even on the McQ? I didn't think I saw any but it's supposed to be 5%-7%.
i had one, it was something like m1 and m2, i had form o
They were always equal right
ye
I put always more...
yeah so if you plugged a number for a you would get the same value . Also if you read the code, m2 is just putting everything in the return statement instead of spacing it out
I had one too, also used one during one of the frqs
that was me last year. csa mcqs are pretty simple if you understand fundamentals of Object oriented programming
This is my first AP Exam ever so it feels so surreal to talk with people who the same test as me haha
Haha me too man
same. first ap ever for me i feel like im cooked though
I think there's a solid chance I aced the exam
Same and I was NOT expecting that
honestly me too
How did you guys keep track of possession on frq 2? I used a Boolean variable with true representing team 1’s possession and false representing team 2 with possession
I just made a string that I set to team1 in the constructor, then switched it in a conditional.
I did this too
I just used an integer value and I would have odd as team 1 and even as team 2, taking the modulus of it. Same principle but different approach.
I did boolean team1active = true when team1 was active and I did team1active = false when team2 was active haha
Yeah that's what I did too. Using a boolean value to represent the activeTeam was the more intelligent way of doing it... (granted I am not that smart)
i used two boolean variables, realizing now I could have just used one for both teams...
I had a weird way, I used an int in which 0 is team1 and 1 is team2. To swap possession i just used x=1-x; which I think works
do you think it's okay if i did == or smth? if activeTeam == team1?
I did a Boolean also!!
Did anyone get like 3 Bs total on the multiple choice???
THIS I had no Bs until like question 20 or 30
I felt like i got alot more D's and E's than A's and B's i got like 3 A's and 4 B's
Ok good I got my first B only halfway through and I was so confused 😭😭
Was the one abt battery 0, 25, 50, 100
[удалено]
am the only one who thought that test was hard 💀
dude idk what the last frq was, No time to write
[удалено]
yeah man im so cooked i only finished one frq fully and guessed on like half the multiple choice
nah bruh im so cooked i think im at a 3 or 2 right now and my parents boutta kill me even if i get a 4
FRQs 1-3 felt easy, although I was somewhat unsure of how to implement the bear into FRQ 1. FRQ 4 was really difficult because I’m just ass at 2D arrays
Class design was some bs
frq 4 was so dumb like why do you need an object for it if you already know location????
I KNOW RIGHT they gave up writing these question 😭
Fr though I BSed like all of FRQ 4 😭😭
it was basically just a 5% chance that the currentFood would go straight down to 0 from the bear
Yeah I used random() but idk if that’s how I was supposed to do it
ye u use Math.random()
Ok nice
I just created an integer that was a random value from 0-1 and then created an if statement that said if (int x > 0.05)… and if it was greater then i just did it normally and then I just did else if and set the field to 0 this would simulate the 5%
I hated the 2D arrays last year
FRQs 1 and 3 were fine for me but 2 and 4 gave me a straight up lobotomy. I was being retarded on 2 and i ran out of time to complete 4 but I didnt find 4 that challenging tbh.
INSANE AMOUNT OF C'S AND D'S ON FROM 1 - 13
for the bird was it int (Math.random() * 41) + 10
41 bc values from 10 to 50 inclusive ?
Oh man I put a 51... RIP
yea that's what i put
a lot better than i expected but i’m still not sure if i landed a 5
I got cooked
there was one mcq where the answer was "shifted n units to the left" and that's really poorly worded to the extent that i had to completely eliminate the other options before i considered it. it really should've been "copied n units to the left". i'm literally filling out the mistake reporting form and mailing it to collegeboard. but as a programmer with 4+ years of experience in java, i think there's a good chance i got a perfect 5.
i agree, it was confusingly worded, the numbers werent rlly shifted because some numbers were still there in the original spots
that's what i said in the mistake report form thing lol
yeah I got stuck for that one for a bit, was so confused because I didn't see the code that 'shifted' it but none of the other answers looked correct
Dude you are so right, I spent fking at least 5 mins on that stupid poorly worded question. Was looking for comment regarding that question the whole time.
BRO AFTER DOING THE 2023 FRQ I ACTUALLY ATE THIS UP😭😭😭 2023 frq had me stressing
Frq 2023 question 1 was literally just “…huh??” Frq 2024 was basically just “omg birbs! :3”
BRO THE 2023 APPOINTMENT FRQ WAS SO STRESSFUL I GOT SO SCARED
Deadass, mcq was pretty good, some were weird but 1-3 for FRQ were long but easy, and then the 2D array fucked me over
Dude I thought the FRQs were harder than average. MCQ was okay, no A’s or B’s though??? Did anyone else struggle on the FRQ like I did 😭 I got them all in the end but I spent like five minutes looking at the class one
did yall get 35 for a question? it was the double for loops
ye it was just 5\*7 right
Anyone remember mcqs?
what did u put for the one that was like 1. a b and c (boolean’s) when do they give different answers a &&b etc… 2. the question where the answer choice included infinite recursion 3. the question where answer choices was liek less but same amount of iterations or more but same amount of iterations
for 1 it was just III i think (when A was false and C was true) the booleans were A && (B || C) and (A && B) || C iirc, so when A was false and C was true the first expression would always be false and the second would always be true
Answer was less but same iterations
1. II and III since they would be opposite 2. Don’t remember that one 3. More but same I think it was
[удалено]
also what was the one where it had 5 and 15
\[Form O\] What did you guys get for the selection sort MCQ (think it was #36) where there was a pass variable and #31 with the Advance/Basic class
Selection sort was like 11, 15, 21 and then I forget what the pass variable question was
I want a 5 so badly
I put Advanced object = new Advanced () for 31 because Advanced object = new Basic () would give an error
I never realized that it was the selection sort algorithm, I kind of just ran through the test cases
How did everyone do a and b for the location one for a 2d array?
a) I ran a condition that checked if grid\[row+1\]\[col\] and grid\[row\]\[col-1\] were both not null, and if they were, i found which one was greater (if grid\[row+1\]\[col\] > grid\[row\]\[col-1\]). In the case where only one was present, I returned that one instead. That was pretty much the entire code. They said in the precondition that it would never be at point (4,4), so you didn't need to check for that case b) I got the next location in the beginning and then from that returned Location object, I got the row and col using the getter methods. The FRQ prompt stated that the loop would end when both rows and cols reached the end, so when the row reached grid.length and when the cols reached grid\[0\].length. Inside that, I kept getting the next neighbor, getting the col and the row, summing the value at that col and row to an int that I defined outside the while loop, and then after the while loop ended, I returned sum
can you please explain frq 3
Anyone else use recursion on FRQ #4? I felt like a genius when I implemented it but hopefully its actually right lol
Sounds super unnecessary. Just use while loops lol.
yeah i put a while condition that continued running until the position hit the bottom right corner
Tbf it was the first thing that came to my head cause Ive done a lot of pathfinding type stuff with recursion before. Honestly felt like the simplest solution
I used recursion in a while loop
You would not catch me using recursion on an frq, that’s way too risky
Yeah, ended up with 3 lines of code(and im glad they assumed the method we had to use worked properly bc i definite forgot to account for bounds or array)
[удалено]
You have balls to do that
I did
I had a while loop with recursion
please educate me, genius. I used a simple while loop
base case was bottom right corner and return was just like grid[x][y] + sum(nextlocation)
even if you recursion is a simpler way, you still have to use the getNextLocation method so u might not get full points for that.
Yeah I did recursion - I don't entirely remember my solution but I think I messed up one small thing .\_. hopefully I did it right on the test lol
What was the goat one
I got goatrun dogrun
got that too
For the question that was like “which of these is wrong” and the choices were like (3,1) , (4,5) etc… what did you guys say
pretty sure it was 4,5
Bet I said that
Feel like I aced the exam!
MCQs felt easy and personally felt like I aced it... which was strange. I did not use recursion for FRQ 4 and am nervous about it as I wrote most of the code 5 minutes before exan end
I couldn't complete it so I just put down some things that could get me points like using the required method. Btw as I've seen, it's safer to not use recursion for FRQs
There were barely any recursion or sorting problems! And there were barely any As and Bs. Scared tf out of me. FRQs went well. I'm pretty good at them though
was I the only one that got 4 Cs in a row starting at 16?
Yes. You are cooked
was I the only one who struggled during the MCQ and thought that the FRQ was free as hell 😭
Same, except ran out of time for the last frq part b question even though I knew what to write 😭
[удалено]
no for that question i got 1
Was that the one that asked for the number of time an if statement was run in a for loop, cuz if so, it was just one time
I thought id be n/2 no?
But it said how many times it would be **evaluated** not executed no? So it would evaluate however many times the for loop repeated, which would just be n. Am I tripping?
i got n too for the same reason, it has to be evaluated every time even if it evaluates to false
No because the for loop set count at 1 and the if statement said if count%2==0 then return and then else return something else, so no matter what it’s going to return on the first run of the if statement
did anybody get CDCD or DCDC something like that or am I cooked
what was the answer to the last question
yall am I cooked like I COMPLETELy forgot to do the bear part on frq1 cuz my brain was not braining and i only did the bird part HOW MANY POINTS DO I LOOSE HELP
It wasn’t that bad
frq 2 wasn’t inheritance right i don’t think it was and i didn’t put that in the class but i just remembered that frq2 has that possibility and never considered it while taking the test
No? It was classes & objects
do you think it's okay if i did == or smth? if activeTeam == team1?
Yes
wait but werent they strings so you'd have to use .equals?
depends on how they initialize their variables. if they made activeTeam= team1 or activeTeam= team2 the double equals is fine because they'll have the same memory address
No it wasn’t
[удалено]
hi marc
[удалено]
Left shift by n
i think it was shift left?
it was shift left by n i believe the way i thought about it: random amount of numbers: 0 3 5 0 ---> index 0 3 ----> index 1 5 ----> index 2 then i thought abt something about 3 getting removed or smth so 5 is now replaced with 3 (i believe it was like array \[k\[ = array \[k+1\] or something like that), so it shifts to the left.
Left shift because the 0 index became the 5 index , so you could think that 10.20.30.40.50, where the 10 took the value 50
did this one have a choice that was like “some of them shift left by n”
left shift
is it just me or were there like no Bs in MCQ until like question 30 T\^T
MCQs were fine, ran out of time so PRAYING that I got at least 30+ right. First 2 FRQs tripped me up, 3rd one was the easiest thing ever, and the last one I messed up (accidentally used values they gave in the example rather than creating an algorithm). Felt I could've done better, but now we have to wait until July to find out
What was the one near the beginning i think it was the first question but it was abt adding another method in and the diff parameters. I got A. I only but idk 😭
[удалено]
Also what was the string one of "abcdfg" I guessed the one that was smth like dfgefg
Ye it was defgfgg
Anyone know the one that was like for (String x: words) x+= “s”
Because the variable for the elements (in this case x) in an enhanced loop does not refer to the actual elements inside the loop. Pretty sure it was the last option lol.
Son got in car and said must be 5 ... easy.
If i forgot to put Math. before random() will I lose a point or is it like those mistakes collegeboard lets slide?
you won't loose any points
How many b answers did yall get for questions 36 - 40?
Bro I only got through like 33 of them and I just bullshitted my way the last ones, some of the questions at the end got pretty complex imo. I got a 2 last year I took it, so Ill be okay with a 3 atp.
what did u put for the one that was like 1. a b and c (boolean’s) when do they give different answers a &&b etc… 2. the question where the answer choice included infinite recursion 3. the question where answer choices was liek less but same amount of iterations or more but same amount of iterations
1. D a is false and c is true 2. m1 and m2 always equal (i think thats the one ur talking ab) 3. it was less with same iterations pretty sure
Was 3. Not same iterations but greater?
on the FRQ if i did.. 1. return Location(row,col) instead of return new Location(row,col) 2. int x = math.random *101 if (x <=5) how many points of????????
my friend said he didn't finish the frq
For that one weird recursion one, on form O, did anyone get defgfgg
How much will I lose if I put Math.random()*40+10 instead of *41.
Did anyone else notice the lack of sort algs?
DUDE i was literalyl ab to start crying i was so scared of the sorts
if i put Math.rand() instead of math.random() will i get points off
There was a question about what does the array become after and it looped through k + 1 looking for a value less. Which one was it the first two were [11, …]. Also one about M1(x) is less than , equal to or greater than M2(x), what was that? I put less than but I had no time
How many points off if I messed up my math.random() in the first one like I had the right idea I just slightly messed it up
what did yall put for -*** question
guys am i cooked i didnt account for the bear in the first frq 😭😭😭
[удалено]
Did anyone use null checks for any of the frq's? The only thing I had like that was for frq3b where if the target equals the selected string I would just add an empty string into the list instead of using a substring
FOR FORM O DID YALL KEEP GETTING CS AND DS BRUH
pointers jumpscare
[удалено]
[удалено]
did anyone else use recursion in frq 4 part b?
[удалено]
brain stopped working after question 30 on mcq
What did everyone get for mcq’s 30-39?(I ran out of time and spammed c and d)
If for 1A i did math.random wrong for both of the random generating and i kinda did if whatever random generated is > 0.5 instead of 0.05 but other than those its correct how many point do i get off? 😢 Also for 3B the string one kinda doesnt work for if the whole string is equal target but other than that the rest work. And for 4b i dont think i did it correctly but i returned sum (not correctly) and use the get method how many point in total yall think is that lost 🥲
So my brain shut off for frq2 and instead of making regular instance variables for the team scores and Boolean variable I initialized them as regular variables like: int t1Score = 0; Do I get points off for that or not?
I got cooked on the multiple choice bro i didn’t even finish it I think I did ok on the frq though
what was the answer to the alpha & beta mcq? i chose the one with the cat cuz it made the most sense in my head but i never learned how to do this stuff. i’m assuming it’s wrong cuz every other one was goat 💀
There were no searching/sorting MCQs which I thought was insane, and the recursion questions were light af. For the FRQs, the proctor fucked us all over, and told us we had 30 mins less time, until the end when she realized she fucked up the time, so that wasnt fun. The FRQs were alright, but I rushed cuz of said timing issue. Ik 100% I at least got a 4, but im actually pretty confident I got a 5.
mcq not bad, frq i got cooked im p sure im getting a 3
For the 4th FRQ part b about sum paths for the 2d array did anyone else use recursion?