Hey there! Sign in to join this conversationNew here? Join for free
    • Thread Starter
    Offline

    15
    ReputationRep:
    I'm stuck on a few of the questions on D1:

    The diagram shows the time, in minutes, for a traffic warden to walk along a network of roads, where x>0



    a) Explain why a section of roads from A to E has to be repeated

    b) The route ACE is the second shortest route connecting A to E. Find the range of possible values of x.

    c) Find, in terms of x, an expression for the minimum distance that the traffic warden must walk and write down a possible route that he could take.

    d) Starting at A, the traffic warden wants to get to F as quickly as possible. On Figure 1 use Dijkstra's algorithm to find, in terms of x, the minimum time for this journey, stating the route that he should take. (I know how to use Dijkstra's algorithm but not with x values)
    • Thread Starter
    Offline

    15
    ReputationRep:
    *bump*
    Offline

    2
    ReputationRep:
    for 1) what properties of graphs do you know?

    for 2) consider other paths that take you from A to E
    Offline

    2
    ReputationRep:
    Also I'm pretty sure you haven't wrote the full question out, since part a) makes no sense without reading the later parts
    Offline

    12
    ReputationRep:
    Not sure if these are right, but I hope it helps...

    a) The section of roads must be repeated to make the graph traversable keeping to the minimum distance starting and ending at A as possible.

    b) ACE is 20+2x, its the second shortest route and I assume the shortest route would be ABE (14+12=26), therefore solve 20x+2>26

    c) Just do the route inspection algorithm, add up all the terms and it should be in terms of x.

    d) I think all you have to do is use Dijkstra's algorithm and from part (b) you should know the value of x, not too sure but I'll see if I can do it.

    btw, Im sort of confused why EF is 16 and the repeat of EF is 13+x
    • Thread Starter
    Offline

    15
    ReputationRep:
    aaah sorry forgot a little bit at the top....
    • Thread Starter
    Offline

    15
    ReputationRep:
    (Original post by ForGreatJustice)
    for 1) what properties of graphs do you know?

    for 2) consider other paths that take you from A to E
    x > 0
    • Thread Starter
    Offline

    15
    ReputationRep:
    (Original post by Sai4)
    Not sure if these are right, but I hope it helps...

    a) The section of roads must be repeated to make the graph traversable keeping to the minimum distance starting and ending at A as possible.

    b) ACE is 20+2x, its the second shortest route and I assume the shortest route would be ABE (14+12=26), therefore solve 20x+2< or = 26

    c) Just do the route inspection algorithm, add up all the terms and it should be in terms of x.

    d) I think all you have to do is use Dijkstra's algorithm and from part (b) you should know the value of x, not too sure but I'll see if I can do it.

    btw, Im sort of confused why EF is 16 and the repeat of EF is 13+x

    for b) shortest is A to D to E which is 25.5, so i got x can range from 2.75 to 3. Which one is route inspection algorithm? is that Kruskal's one?
    Offline

    12
    ReputationRep:
    (Original post by EternalDoom)
    for b) shortest is A to D to E which is 25.5, so i got x can range from 2.75 to 3. Which one is route inspection algorithm? is that Kruskal's one?
    No, another name for the Route inspection algorithm is Chinese Postman algorithm, the one where you find the shortest route starting and ending at the same vertex.
    • Thread Starter
    Offline

    15
    ReputationRep:
    (Original post by Sai4)
    No, another name for the Route inspection algorithm is Chinese Postman algorithm, the one where you find the shortest route starting and ending at the same vertex.
    Haven't done that in class yet XD

    So I'll try and do it with Kruskal's or Prim's
    Offline

    12
    ReputationRep:
    Oh, if you haven't done that yet, you won't be able to answer this question
    • Thread Starter
    Offline

    15
    ReputationRep:
    (Original post by Sai4)
    Oh, if you haven't done that yet, you won't be able to answer this question
    Awesome, gotta love teachers!
    Offline

    12
    ReputationRep:
    Yeah, The route inspection algorithm is the longest algorithm in D1 I think, really easy to make mistakes.
    • Thread Starter
    Offline

    15
    ReputationRep:
    (Original post by Sai4)
    Oh, if you haven't done that yet, you won't be able to answer this question
    I just did it with Kruskal O.o

    10 + 12 + 12.5 + 13 + 13 + x
    = 60.5x

    One possible route is A - D - E - F - E - C - B - C - E - D - A

    Is this wrong?
    Offline

    0
    ReputationRep:
    hi has anyone got the june 2010 paper for ocr decision maths (D1)
    thanks
 
 
 
  • 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
    Did TEF Bronze Award affect your UCAS choices?
    Useful resources

    Make your revision easier

    Maths

    Maths Forum posting guidelines

    Not sure where to post? Read the updated guidelines here

    Equations

    How to use LaTex

    Writing equations the easy way

    Student revising

    Study habits of A* students

    Top tips from students who have already aced their exams

    Study Planner

    Create your own Study Planner

    Never miss a deadline again

    Polling station sign

    Thinking about a maths degree?

    Chat with other maths applicants

    Can you help? Study help unanswered threads

    Groups associated with this forum:

    View associated groups
  • 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

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