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

Reply 100

porkguy69

4

Original post

by solid_lava

Do u mean right or left left is the easier one

Wait you needed to do both???

Reply 101

rnssxd

3

Original post

by good-surface

i just skiped section b and section d last question. also the trace table. am i cooked??

i found that trace really difficult tbh i think i probably got 3 or 4 out of 6 but i found it really hard to manage all the recursion and coming back out of it.

Reply 102

rnssxd

3

Original post

by good-surface

$ is zero or one

thats question mark

Reply 103

porkguy69

4

Original post

by rnssxd

Dollar sign means end of line and i said it signified the string its matching against must end after that set of digits so I'm hoping. I also skipped that question because I was not interested ! but i think it was basically just saying how many ways can you rearrange 5 but the 2 operators have to be between the numbers so i found it quite complicated

Could I say end of a regular expression

Reply 104

rnssxd

3

Original post

by porkguy69

Could I say end of a regular expression

im not sure because i guess if you had a string that had a new line in the middle like over 2 lines then its not the end of the regex its the end of that line ? idk im rlly not sure...

Reply 105

porkguy69

4

Original post

by rnssxd

i found that trace really difficult tbh i think i probably got 3 or 4 out of 6 but i found it really hard to manage all the recursion and coming back out of it.

I mean if u got to Traverse(7,7) at some point u probably got it right

Reply 106

rnssxd

3

Original post

by porkguy69

I mean if u got to Traverse(7,7) at some point u probably got it right

i did but i didnt know how to like recursively work back out of that to get back into the ispath function or whatever it was. Did you not need to start incrementing j inside of ispath?

Reply 107

Username2727

10

What was the expression that wouldn’tt work with evaluate RPN was it /0

Reply 108

rnssxd

3

Original post

by porkguy69

Wait you needed to do both???

you needed to do right precedence, but it said you get the majority of the marks (so maybe only dropping 2 or 3?) if you do left. left was easy but i had no idea how to change it to use right. i think you needed to check if there was another variable afterwards and pop it if you were using an exponent

Reply 109

rnssxd

3

Original post

by Username2727

What was the expression that wouldn’tt work with evaluate RPN was it /0

i said this yes

Reply 110

porkguy69

4

Original post

by rnssxd

you needed to do right precedence, but it said you get the majority of the marks (so maybe only dropping 2 or 3?) if you do left. left was easy but i had no idea how to change it to use right. i think you needed to check if there was another variable afterwards and pop it if you were using an exponent

I think you just swap the thingies in Math.Pow

Reply 111

porkguy69

4

Original post

by rnssxd

i did but i didnt know how to like recursively work back out of that to get back into the ispath function or whatever it was. Did you not need to start incrementing j inside of ispath?

I just wrote the subroutine calls in reverse order and returned true cuz Traverse(AL[start], end) = true was a base case for isPath

Reply 112

porkguy69

4

Did anybody say that selection statement in evaluaterpn was to check that the result of performing an operator with two numbers is an integer

Reply 113

Rucha_A

6

Original post

by porkguy69

Did anybody say that selection statement in evaluaterpn was to check that the result of performing an operator with two numbers is an integer

yeah

Reply 114

porkguy69

4

Does anybody know what they put for the BNF

Reply 115

Razzywazzy

2

Do you lot think grade boundaries will decrease this year especially considering a lot of people did bad in paper 1? If so how many marks will you reckon it drops by

Reply 116

porkguy69

4

Original post

by Razzywazzy

Do you lot think grade boundaries will decrease this year especially considering a lot of people did bad in paper 1? If so how many marks will you reckon it drops by

Maybe low 70s for an A* and a low 60 or high 50 for an A?

Reply 117

rnssxd

3

Original post

by porkguy69

Maybe low 70s for an A* and a low 60 or high 50 for an A?

I think that's quite optimistic since is it not normally around 79 for an A*?

Reply 118

porkguy69

4

Original post

by rnssxd

I think that's quite optimistic since is it not normally around 79 for an A*?

No idea I was comparing with the 2023 grade boundaries cuz that one was a bit difficult

Reply 119

rnssxd

3

Original post

by porkguy69

Does anybody know what they put for the BNF

I think I made a bracketopen, bracketclose, opn = operator number and then a bracketopen number opn bracketclose something like that

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

Quick Reply

Related discussions

Articles for you

How The Student Room is moderated