You are Here: Home >< Maths

# AQA Mathematics MD01 Decision 1 – Friday 24th June [Exam Discussion Thread] Watch

1. (Original post by Olsmarto)
On the kruskals question I said it had to be k> or equal to 10, as you could choose either 10 therefore it can still be true if it was equal to 10, or am I wrong?

Posted from TSR Mobile
I wrote this!!

Posted from TSR Mobile
2. (Original post by Olsmarto)
On the kruskals question I said it had to be k> or equal to 10, as you could choose either 10 therefore it can still be true if it was equal to 10, or am I wrong?

Posted from TSR Mobile
Glad I wasn't the only one that did this lol, I also did k ≥ 10
3. (Original post by tajtsracc)
I did this for the semi-eulerian tree
I'm sure it said 5 edges?
4. (Original post by -jordan-)
If there are 2 vertices with order five (I think it was) then there are two vertices that connect to every other vertex in the network, therefore it's impossible that there's one with an order of one because of the two vertices that connects to all the others. It's a hard one to phrase!
I thought it was as well! I put something about the number of odd vertices being even, not sure if it's correct or not.
5. (Original post by fpmaniac)
I put profit as 520. used 2x=y and 2x+y=720? or something like that....
Yeah £520 is correct
6. (Original post by sufiyan1999)
I'm sure it said 5 edges?
It was 5 vertices
7. (Original post by Olsmarto)
On the kruskals question I said it had to be k> or equal to 10, as you could choose either 10 therefore it can still be true if it was equal to 10, or am I wrong?
(Original post by beth000)
I wrote this!!
(Original post by tajtsracc)
Glad I wasn't the only one that did this lol, I also did k ≥ 10
I think the answer is because if was chosen, there would be no guarantee that CD would be included in the tree as CD has a weight of 10 as well.
8. (Original post by sam_97)
I think the answer is because if was chosen, there would be no guarantee that CD would be included in the tree as CD has a weight of 10 as well.
I think they'll accept both. I can just see it saying "Condone x>10" at the side of the mark scheme. Just depends how many people disagreed I guess.
9. (Original post by sam_97)
I think the answer is because if was chosen, there would be no guarantee that CD would be included in the tree as CD has a weight of 10 as well.
I'm fairly sure it didn't specify that CD had to be chosen, just that it was in that case. Therefore x could equal 10 and CD was still chosen.
10. (Original post by -jordan-)
I think they'll accept both. I can just see it saying "Condone x>10" at the side of the mark scheme. Just depends how many people disagreed I guess.
Yeah I agree, they will probably accept either. They don't seem to be too harsh when it comes to inequalities in decision.

(Original post by Lumberjack1)
I'm fairly sure it didn't specify that CD had to be chosen, just that it was in that case. Therefore x could equal 10 and CD was still chosen.
As -jordan- said above, they'll probably accept both.
11. (Original post by sam_97)
The maximum profit for the last question was definitely £520, just checked on Wolfram Alpha. I somehow ended up with £515 in the exam so I'm not too sure where I went wrong there!
Could you send me the equations/the working for the last question please? Need to understand where I went wrong to see how many marks I lost, thanks.
12. (Original post by hi-zen-berg)
any *UMS ideas for 65 raw?
~84
13. (Original post by fpmaniac)
Attachment 556247 The vertex question part ii) was something along these lines where the graph was semi eulerian and had 5 vertices and was a tree
I just did five vertices in a 'W' pattern
\/\/
14. (Original post by Chickenslayer69)
Could you send me the equations/the working for the last question please? Need to understand where I went wrong to see how many marks I lost, thanks.
The equations were:

We had to maximise profit, which was given by .
15. With the Chinese postman problem, i believe you were forced to end your journey at the vertex D. Therefore when choosing the lowest route to repeat, you needed not to have chosen one containing the vertex D. Because the lowest repeating route contained D, you needed to chose the next highest one.
16. (Original post by billdjango99)
With the Chinese postman problem, i believe you were forced to end your journey at the vertex D. Therefore when choosing the lowest route to repeat, you needed not to have chosen one containing the vertex D. Because the lowest repeating route contained D, you needed to chose the next highest one.
That's correct. The vertices B and D needed to have an odd degree, so the shortest route between the other two odd vertices (12) had to be added to the total weight of the edges in the graph. The start vertex was B.
17. 64/63 for A?
18. (Original post by fpmaniac)
Attachment 556247 The vertex question part ii) was something along these lines where the graph was semi eulerian and had 5 vertices and was a tree
I don't think that's a correct tree. A tree is a graph without cyclic routes, and this graph is cyclic
19. (Original post by tajtsracc)
It was not

"Twice as many as x as y". So if y was 50 then x would be 100.
Yeah it was, my mistake. See edit
20. Is there a D2 thread anywhere?

TSR Support Team

We have a brilliant team of more than 60 Support Team members looking after discussions on The Student Room, helping to make it a fun, safe and useful place to hang out.

This forum is supported by:
Updated: June 28, 2016
Today on TSR

### Last-minute PS help

100s of personal statements examples here

### Loneliness at uni

Discussions on TSR

• Latest
• ## 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.

• Poll
Useful resources

Can you help? Study help unanswered threadsStudy Help rules and posting guidelinesLaTex guide for writing equations on TSR

## Groups associated with this forum:

View associated groups
Discussions on TSR

• Latest
• ## 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.

• The Student Room, Get Revising and Marked by Teachers are trading names of The Student Room Group Ltd.

Register Number: 04666380 (England and Wales), VAT No. 806 8067 22 Registered Office: International House, Queens Road, Brighton, BN1 3XE

Reputation gems: You get these gems as you gain rep from other members for making good contributions and giving helpful advice.