D1 help
http://www.ocr.org.uk/Images/65005-question-paper-unit-4736-01-decision-mathematics-1.pdf
4iv
Suppose that, instead, Simon wants to find the shortest route that uses every arc, starting from A andending at H.(iv) Which arcs does Simon need to travel twice? What is the length of the shortest route that he canuse?
What's the method to even do that?
4iv
Suppose that, instead, Simon wants to find the shortest route that uses every arc, starting from A andending at H.(iv) Which arcs does Simon need to travel twice? What is the length of the shortest route that he canuse?
What's the method to even do that?
Original post by Parallex
http://www.ocr.org.uk/Images/65005-question-paper-unit-4736-01-decision-mathematics-1.pdf
4iv
Suppose that, instead, Simon wants to find the shortest route that uses every arc, starting from A andending at H.(iv) Which arcs does Simon need to travel twice? What is the length of the shortest route that he canuse?
What's the method to even do that?
4iv
Suppose that, instead, Simon wants to find the shortest route that uses every arc, starting from A andending at H.(iv) Which arcs does Simon need to travel twice? What is the length of the shortest route that he canuse?
What's the method to even do that?
Original post by holly30
I had a look but I'm really not sure. I'd really appreciate the help too, please 
This is a daft question, it's essentially trial and error. Try and only repeat the arcs which have the shortest lengths.
Original post by holly30
Ah, I thought it'd be one of those daft ones to be honest. That'd be one that I'd skip and come back to at the end if I had time.
Thanks
Thanks
My thoughts exactly.
Stupid that questions like this even make it into a MATHS paper. It's trial and error like you said, no maths involved. :/
Original post by holly30
Ah, I thought it'd be one of those daft ones to be honest. That'd be one that I'd skip and come back to at the end if I had time.
Thanks
Thanks
Original post by Parallex
My thoughts exactly.
Stupid that questions like this even make it into a MATHS paper. It's trial and error like you said, no maths involved. :/
Stupid that questions like this even make it into a MATHS paper. It's trial and error like you said, no maths involved. :/
It's a bit like question 1-iii) on this paper I'm doing at the moment... although with my question you can use a bit of mathematics! Still a huge waste of time.
Original post by Crozzer24
These are the questions I hate on D1! And oh finding immediate predecessors from a precedence table! Why is knowing that you should put down the tablecloth before you place a drink on the table is classed as maths I will never know
I had a critical path analysis question on a past paper, about making breakfast... which activity should be started at the latest possible time?
Answer: Making coffee. So it doesn't get cold.
The examiners must be laughing when they set these.
Original post by Parallex
Suppose that, instead, Simon wants to find the shortest route that uses every arc, starting from A andending at H.(iv) Which arcs does Simon need to travel twice? What is the length of the shortest route that he canuse?
Suppose that, instead, Simon wants to find the shortest route that uses every arc, starting from A andending at H.(iv) Which arcs does Simon need to travel twice? What is the length of the shortest route that he canuse?
**** off Simon you lazy ****, just turn on GPS on your phone and use Google Maps
Original post by Parallex
What's the method to even do that?
Original post by lizard54142
This is a daft question, it's essentially trial and error. Try and only repeat the arcs which have the shortest lengths.
If you're starting at A and ending at H, then it doesn't matter that these two nodes have odd order. If it helps add an additional path going directly from A to H and assign it a high value - 1000 would do in this case - so that it would only be travelled once.
Now do the Chinese Postman again. But this time it's trivial, there are only two vertices of odd order, and the shortest route between them is 3.5. So add that to the total weigth of 67.5 and you're done.
You can discard the AH path you added since it would be part of one of two loops going through A, and you can order the loops so that that path would have been the last. So instead of traversing it, you stop at H as required.
(edited 8 years ago)
Quick Reply
Related discussions
- D1 scholarship from England
- Application Competition Form for Provisional
- What units do I need for Edexcel IAL or IAS Further Maths
- Applying to American Uni as a international student
- How to have my school allow year 12 to choose a math subject for year 13.
- Further Maths 2023/2024!!!
- Isaac physics: Underwater Ridge
- Edexcel IAL Math and Further Math formulas
- Further Pure 1
- Decision Maths or Statistics
- FM module?
- Using pencil to fill table in answer booklet for alevel further maths decision exam
- Deciding Edexcel IAL FM Cash-in Unit Combinations
- University of Surrey Accommodation Band D subclasses
- as edexcel further maths tips (D1/FP1)
- tips to self study Further maths
- Grade requirements and results day
- yr 12 mock resit
- What are the names of legit modelling agencies in UK?
- AS level further maths modules
Latest
Trending
Last reply 3 days ago
Did Cambridge maths students find maths and further maths a level very easy?Last reply 2 weeks ago
Edexcel A Level Mathematics Paper 2 unofficial mark scheme correct me if wrongMaths
71
Trending
Last reply 3 days ago
Did Cambridge maths students find maths and further maths a level very easy?Last reply 2 weeks ago
Edexcel A Level Mathematics Paper 2 unofficial mark scheme correct me if wrongMaths
71
