The Student Room Group

AQA A-level Computer Science Paper 1 - 11th June 2025 [Exam Chat]

Scroll to see replies

Reply 40

Original post
by thevingetsthewin
I said 99 cause if the list was fully reversed, once you have the second smallest sorted, the smallest item is sorted automatically cause it is swapped to the start

I said the same

Reply 41

Original post
by thevingetsthewin
I am actually so grateful they didn't make us code in bracket support
But I wasted SO much time trying to make the exponentials read right to left but then I only read the question fully later and saw that I would get most of the marks if I kept it as left to right

you will still get 5/6 / 7, the only change was to add a and precedence[currentoperator] != 5 (or whatever u gave to ^ operator), in the precedence[operators[^1]] == precedence[currentOperator] line. Found this solution by accident when i deleted my old one .

Reply 42

what was a second requirement for a set, obvs all elements are unique, i guessed that all elements had to be of the same type
(edited 9 months ago)

Reply 43

Original post
by cdinsley7
I got -49

me too

Reply 44

Was the bubble sort 100 item thing 100^2? Because thats the time complexity? Or na?

Reply 45

What was the question about sets actually asking? Did I misread?

Reply 46

Original post
by Username2727
What was the question about sets actually asking? Did I misread?

just 2 requirements for a set that are not requirements of a list

Reply 47

Original post
by dwdwadawdwadaw
just 2 requirements for a set that are not requirements of a list
Ah I messed that up I read it as two requirements of a set that meant it can’t be stored as a list

Reply 48

section A was pretty good, section B i absolutely bottled because i didn't have a clue how to implement a 2D array in C# ☹️. section C was okay, a few weird ones, and section D the first two questions were good, other two I couldn't figure out as i was running out of time so I just put random stuff that kinda made sense, hoping to scrape a few marks...

hoping for a miracle in paper 2

Reply 49

My solution for B was to use nested loops

So I concatenated strings such that each string contained letters in the string for every nth character where n is the number of columns and i changed where the starting point was

Reply 50

Original post
by King24
I got - 48 or sum

what was question 9 again i forgot :<

Reply 51

why was this thread so hard to find, had to ask OCR takers lmao

this was a pretty decent paper so now i’m scared for paper 2, no OOP was a surprise, thought it would be in section A or B, didn’t know how to do B so moved on after about 30mins so glad that i was able to get through A super quick because i really sat there and typed every possible combination of expressions for the brute force coding question

Reply 52

Original post
by seost45
what was question 9 again i forgot :<

the one where the score goes down by 5 if in Target[2] and 10 if in Target[1], a lot of people read the question wrong cause it was badly worded ngl, i think i got in the -20s

Reply 53

Original post
by acting-earthquak
the one where the score goes down by 5 if in Target[2] and 10 if in Target[1], a lot of people read the question wrong cause it was badly worded ngl, i think i got in the -20s

Its 10 more than whatever the value of Target[1] was by the way so if Target[1] was 6 it would be -16 and then the minus 1 after so -17

Reply 54

Original post
by acting-earthquak
the one where the score goes down by 5 if in Target[2] and 10 if in Target[1], a lot of people read the question wrong cause it was badly worded ngl, i think i got in the -20s

i got -22 for that i think

Reply 55

Original post
by acting-earthquak
the one where the score goes down by 5 if in Target[2] and 10 if in Target[1], a lot of people read the question wrong cause it was badly worded ngl, i think i got in the -20s

is it not target[1] and target[0] because of 0 based indexing. i also checked and seemed to match the examples they provided by using target[1] and target[0]

Reply 56

Original post
by cdinsley7
Its 10 more than whatever the value of Target[1] was by the way so if Target[1] was 6 it would be -16 and then the minus 1 after so -17

yes but there were numbers in both 1 and 2 for Target so it gets compounded, i got -22

Reply 57

Original post
by acting-earthquak
yes but there were numbers in both 1 and 2 for Target so it gets compounded, i got -22
It was the training game which you end up with getting 23 in the first spot so then 23 + 10 = 33
33 + 5 = 38
38+1 = 39
and you already had -10
so its -49

Reply 58

Original post
by Mcfc23
is it not target[1] and target[0] because of 0 based indexing. i also checked and seemed to match the examples they provided by using target[1] and target[0]

maybe? it thought about that but wasn’t sure cause it didn’t show the ‘game over’ message that would be shown if it reached index 0

Reply 59

Original post
by cdinsley7
It was the training game which you end up with getting 23 in the first spot so then 23 + 10 = 33
33 + 5 = 38
38+1 = 39
and you already had -10
so its -49

I agree with you pal

Quick Reply

How The Student Room is moderated

To keep The Student Room safe for everyone, we moderate posts that are added to the site.