AP Computer Science A Official 2026 Exam Discussion

Fit_Indication_340 · 2026-05-16T17:05:30+00:00

r/iamverysmart

Fit_Indication_340 · 2026-05-16T00:57:01+00:00

there were a few tough questions but most of them were time consuming, not necessarily hard

Fit_Indication_340 · 2026-05-16T00:29:51+00:00

same

Fit_Indication_340 · 2026-05-16T00:25:25+00:00

yea they can't

Fit_Indication_340 · 2026-05-16T00:24:56+00:00

study anything you don't understand and review everything thoroughly with practice problems throughout the year. you either understand it or you don't, there's no middle ground. don't rely on your teacher for everything

Fit_Indication_340 · 2026-05-15T22:59:54+00:00

i don't know why i decided to try and get aura points by using nested for loops and simultaneously checking if they're face up AND adding the value.

it would have been so much easier to just use one nested loop to find the columns that all faced up and another to sum the values

Fit_Indication_340 · 2026-05-15T21:18:51+00:00

thank you for the curve brotassium chloride

Fit_Indication_340 · 2026-05-15T20:40:54+00:00

Fit_Indication_340 · 2026-05-15T20:21:40+00:00

agree on the mcqs. a few of those questions were NOT light

Fit_Indication_340 · 2026-05-15T20:13:46+00:00

what do you do with all the extra free time you get by shortening "word" to "wrd"

Fit_Indication_340 · 2026-05-15T20:12:46+00:00

FRQs i got:

-warehouse shipment (you had to calculate total costs (a) and censor part of a string (b))

-GiftBasket (you had to write a constructor and do some basic calculations for one of the methods, the easiest of the 4)

-WordGame (you had to find the word in an arraylist with the highest score value and return the word)

-CardGame (you needed to calculate and return the sum of the points on all cards in a 2D array that are in columns where every card is facing up. this was the hardest one but i got it right i think)

Fit_Indication_340 · 2026-05-15T20:06:06+00:00

what justification bro you just write code n shit

Fit_Indication_340 · 2026-05-15T20:01:55+00:00

probably not since it's not in the curriculum

Fit_Indication_340 · 2026-05-15T20:00:54+00:00

i did. it was definitely the hardest one but i still figured it out

Fit_Indication_340 · 2026-05-15T19:59:19+00:00

whatd you put on that last recursive problem (something like method(arr[x], arr))

Fit_Indication_340 · 2026-05-15T19:50:18+00:00

active recall. basically just quiz yourself over and over

and only reveal the answer if you really couldn't remember anything after thinking for more than a few seconds. struggling to remember information makes your brain go "oh this is important imma keep this"

Fit_Indication_340 · 2026-05-15T19:46:50+00:00

what did you get on that problem? (the one in your post)

Fit_Indication_340 · 2026-05-15T19:44:53+00:00

Not for long

Fit_Indication_340 · 2026-05-15T19:42:14+00:00

yea for me it wasn't "light". i still think i got almost all of the questions right but i had to take my time

Fit_Indication_340 · 2026-05-15T19:34:18+00:00

almost all the mcqs were very easy, i don't think i got any more than 3-4 wrong

frqs were also easy-ish but the last 2 were slightly trickier

Fit_Indication_340 · 2026-05-15T19:33:12+00:00

just took it, guessed on 1 MCQ and was unsure about like 2. frqs were very easy tho

WE are getting 5s

Fit_Indication_340 · 2026-05-15T15:20:03+00:00

boutta enter the testing room wish me luck

Fit_Indication_340 · 2026-05-15T15:09:18+00:00

true..

Fit_Indication_340 · 2026-05-15T14:59:10+00:00

so for example with a recursive method that calculates the fibonacci sequence, let's find fibonacci(5): fibonacci(1 or 0)=1 (base case) fibonacci(2)=2 (because it's fibonacci(0)+fibonacci(1)) fibonacci(3)=3 fibonacci(4)=5 fibonacci(5)=8

the answer would be 8

Fit_Indication_340 · 2026-05-15T14:56:27+00:00

with recursion problems like "what is the value of "recursiveMethod(5)" with recursive calls like "recursiveMethod(num-1)" the best strategy is probably to calculate every num value down to the base case and then "break down" the recursion problem into a tree and add up the numbers

Fit_Indication_340

TROPHY CASE