amycm
Badges: 2
Rep:
?
#1
Report Thread starter 2 years ago
#1
I can't seem to find anywhere that is talking about this exam so I'll try and start a thread lol.

How did you find it??
0
reply
morrissies
Badges: 1
Rep:
?
#2
Report 2 years ago
#2
pretty bad. (by pretty bad I mean I dont think I got 85 ums which is what i was aiming for)
a ..weird paper, I think.
question 2 was such an annoyance. I wrote paragraphs but I think it was all nonsense.
q3 algorithm seemed too easy so i think i've done it wrong.
dijkstras and chinese postman was done in a strange, convoluted way which is a shame because those are my favourite topics but I think I made some mistakes.

overall, not ideal. ¯\_(ツ)_/¯
1
reply
anonymousm3
Badges: 13
Rep:
?
#3
Report 2 years ago
#3
Omg! I've been looking for this thread too xox

I found it ok.
What answer did you get for Q 7i and anything else?
What was that Dijkstras question though???

Someone start an unofficial mark scheme.....
0
reply
eryk_laroche
Badges: 2
Rep:
?
#4
Report 2 years ago
#4
i think i did terrbile. jesus christ lol
0
reply
haikyuu4
Badges: 0
Rep:
?
#5
Report 2 years ago
#5
It was so horrible. I honestly think I didn't even pass. I hate OCR. I can't even get a decent grade in my other subjects because of this stupid exam board.
0
reply
Alodia
Badges: 7
Rep:
?
#6
Report 2 years ago
#6
Anyone else feel like there was too much writing and not enough actual working out on that paper? x
3
reply
eryk_laroche
Badges: 2
Rep:
?
#7
Report 2 years ago
#7
I did the algorithm question badly so i had to recreate my tables on a continuation sheet . is this fine ?
0
reply
eryk_laroche
Badges: 2
Rep:
?
#8
Report 2 years ago
#8
(Original post by Alodia)
Anyone else feel like there was too much writing and not enough actual working out on that paper? x
yeah man too much
0
reply
eryk_laroche
Badges: 2
Rep:
?
#9
Report 2 years ago
#9
;/
0
reply
Bigzy
Badges: 2
Rep:
?
#10
Report 2 years ago
#10
For graph theory question, I don't think any questio asked you to even draw a graph if I can remember from the top of my head. Feel its a bit controversial. Lol
1
reply
CheeseIsVeg
Badges: 22
Rep:
?
#11
Report 2 years ago
#11
Was a funky paper, hated having to explain stuff :lol: but was ok.
Lol at their mistake.
:shakecane: Y u no bin pack OCR?
1
reply
Bigzy
Badges: 2
Rep:
?
#12
Report 2 years ago
#12
For the feasible regions question, what did it mean by minimum feasible point? Did it mean the coordinates that gave the lowest output of 3x+13y?
0
reply
KulawiT
Badges: 10
Rep:
?
#13
Report 2 years ago
#13
It was ****ing confusing. Even the feasible region question wtffff

i thought you had to make it = 0 turns out you had to just pick a random value and thats what i did at first but it gave such weird coordinates i back-tracked. I think i lost like 15 marks or something.....

Any thoughts
0
reply
Inker
Badges: 13
Rep:
?
#14
Report 2 years ago
#14
completely messed up linear programming. didnt attempt the questions about k. goodbye A grade in maths.
0
reply
79387591327
Badges: 1
Rep:
?
#15
Report 2 years ago
#15
What an absolute joke of a paper that was😑
1
reply
morrissies
Badges: 1
Rep:
?
#16
Report 2 years ago
#16
(Original post by Bigzy)
For the feasible regions question, what did it mean by minimum feasible point? Did it mean the coordinates that gave the lowest output of 3x+13y?
yeah that's what I did.
I think the answer i got was 25 at point C.

then for part iii. where the constraint of x<4 was removed I got a weird fraction that = about 23.6 something or other (from equating the two lines with a negative gradient)

(then for iv. where the minimum had to be whole numbers the coordinate they gave you resulted in a higher number than 25, so the answer was the minimum point is still 25 @ C)
(but honestly this could all be wrong lol)
2
reply
morrissies
Badges: 1
Rep:
?
#17
Report 2 years ago
#17
for the kruskal/minimum route/k question I think for the last part you also had to combine your answer with what you got for the previous part
so I got
9<k<11 (not sure about the numbers, but i am confident that you had to combine the inequalities because the question said that k wouldn't be involved in the minimum spanning tree, but was involved in the shortest cycle from A. hence combining both)
0
reply
Bigzy
Badges: 2
Rep:
?
#18
Report 2 years ago
#18
(Original post by morrissies)
yeah that's what I did.
I think the answer i got was 25 at point C.

then for part iii. where the constraint of x<4 was removed I got a weird fraction that = about 23.6 something or other (from equating the two lines with a negative gradient)

(then for iv. where the minimum had to be whole numbers the coordinate they gave you resulted in a higher number than 25, so the answer was the minimum point is still 25 @ C)
(but honestly this could all be wrong lol)
I got 310/3 as a x/y coordinate when constraint of x<4 was removed. Lol. So this meant my original value/coordinates was still lowest, but oh well. You could be right.
0
reply
KulawiT
Badges: 10
Rep:
?
#19
Report 2 years ago
#19
Guys can we try make a sensible estimate of the boundaries, I really think this was harder than the 2016 June paper...
0
reply
0xFFFFail
Badges: 15
Rep:
?
#20
Report 2 years ago
#20
(Original post by Inker)
completely messed up linear programming. didnt attempt the questions about k. goodbye A grade in maths.
the simplex threw me off so hard I'm sure I lost every mark in it, why did OCR decide to give me everything and make me do the second iteration, my only chance of doing it was if we formulated the equations

I'm in the same boat as you tbh, goodbye A in maths and goodbye firm uni.

(Original post by morrissies)
yeah that's what I did.
I think the answer i got was 25 at point C.

then for part iii. where the constraint of x<4 was removed I got a weird fraction that = about 23.6 something or other (from equating the two lines with a negative gradient)

(then for iv. where the minimum had to be whole numbers the coordinate they gave you resulted in a higher number than 25, so the answer was the minimum point is still 25 @ C)
(but honestly this could all be wrong lol)
up till part 4 I got the exact same stuff as you so fingers crossed it's correct!

(Original post by morrissies)
for the kruskal/minimum route/k question I think for the last part you also had to combine your answer with what you got for the previous part
so I got
9<k<11 (not sure about the numbers, but i am confident that you had to combine the inequalities because the question said that k wouldn't be involved in the minimum spanning tree, but was involved in the shortest cycle from A. hence combining both)
I wrote them out separately sucks to lose easy marks as simplex algorithm was horrific for me.
0
reply
X

Quick Reply

Attached files
Write a reply...
Reply
new posts
Back
to top
Latest
My Feed

See more of what you like on
The Student Room

You can personalise what you see on TSR. Tell us a little about yourself to get started.

Personalise

University open days

  • University of Suffolk
    Undergraduate Open Day - Ipswich Main Campus Undergraduate
    Mon, 9 Dec '19
  • University of Hertfordshire
    All Subjects Undergraduate
    Wed, 11 Dec '19
  • University of Lincoln
    Undergraduate Open Day Undergraduate
    Wed, 11 Dec '19

Which party will you be voting for in the General Election?

Conservatives (112)
19.24%
Labour (296)
50.86%
Liberal Democrats (75)
12.89%
Green Party (30)
5.15%
Brexit Party (7)
1.2%
Independent Group for Change (Change UK) (3)
0.52%
SNP (13)
2.23%
Plaid Cymru (3)
0.52%
Democratic Unionist Party (DUP) (0)
0%
Sinn Fein (6)
1.03%
SDLP (0)
0%
Ulster Unionist (3)
0.52%
UKIP (8)
1.37%
Other (4)
0.69%
None (22)
3.78%

Watched Threads

View All
Latest
My Feed

See more of what you like on
The Student Room

You can personalise what you see on TSR. Tell us a little about yourself to get started.

Personalise