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

    8
    ReputationRep:
    Hey guys Im about to start doing past papers for D1 now.

    Just wondering, there was a spec change in 2009 which meant that we can only do past papers for FP1 from 2009 onwards.

    From looking at past papers, it seems the same happened for D1. Can anyone confirm if Im right in saying that the D1 papers from Jan 2009 onwards are okay to do? The past papers before that will be different?

    Thanks
    Offline

    14
    ReputationRep:
    (Original post by GarlicBread01)
    Hey guys Im about to start doing past papers for D1 now.

    Just wondering, there was a spec change in 2009 which meant that we can only do past papers for FP1 from 2009 onwards.

    From looking at past papers, it seems the same happened for D1. Can anyone confirm if Im right in saying that the D1 papers from Jan 2009 onwards are okay to do? The past papers before that will be different?

    Thanks
    The ones before Jan 2009 included Simplex, flows in networks and the planarity algorithm. These topics are now in D2. The other questions on the papers for 2001 to 2008 are on the same topics as the current papers.
    • Thread Starter
    Offline

    8
    ReputationRep:
    (Original post by tiny hobbit)
    The ones before Jan 2009 included Simplex, flows in networks and the planarity algorithm. These topics are now in D2. The other questions on the papers for 2001 to 2008 are on the same topics as the current papers.
    Okay, Ill do the ones after Jan 2009

    Thanks ^_^
    Offline

    2
    ReputationRep:
    Guys, could someone please explain how to construct a scheduling diagram without drawing a Gantt chart?
    Offline

    2
    ReputationRep:
    ^ for this question specifically
    Attached Images
     
    Offline

    14
    ReputationRep:
    (Original post by techfan42)
    ^ for this question specifically
    In order to finish in a time of 30 or with a restricted number (2) of workers?
    Offline

    1
    ReputationRep:
    Does anyone know where to find the definitions we need for the exam
    • Community Assistant
    Offline

    18
    ReputationRep:
    Community Assistant
    (Original post by nathanbilli)
    Does anyone know where to find the definitions we need for the exam
    Last page.

    http://www.waldomaths.com/docs/edex/..._6689_Spec.pdf
    Offline

    1
    ReputationRep:
    Thanks
    Offline

    8
    ReputationRep:
    For question 7 (g) of the January 2013 paper, how would you know what the minimum number of workers are, what would be your thought process?
    • Community Assistant
    Offline

    18
    ReputationRep:
    Community Assistant
    (Original post by Glavien)
    For question 7 (g) of the January 2013 paper, how would you know what the minimum number of workers are, what would be your thought process?
    Draw a line or just use your ruler where most of the boxes on the gantt chart overlap, the number of activites that lie on that line is the min number of workers.
    Offline

    8
    ReputationRep:
    (Original post by NotNotBatman)
    Draw a line or just use your ruler where most of the boxes on the gantt chart overlap, the number of activites that lie on that line is the min number of workers.
    Thanks!
    Offline

    8
    ReputationRep:
    Can someone explain question 3 (b) of the January 2013 paper I don't understand the MS. Do you look at the given matching and see if there is a match for each person? What would be the simplest way of approaching the question?
    • Community Assistant
    Offline

    18
    ReputationRep:
    Community Assistant
    (Original post by Glavien)
    Can someone explain question 3 (b) of the January 2013 paper I don't understand the MS. Do you look at the given matching and see if there is a match for each person? What would be the simplest way of approaching the question?
    Look at the matches for each activity and notice that activity 5 and 1 can only be done by G, since G can't do more than one activity, a complete matching is not possible.
    Offline

    8
    ReputationRep:
    (Original post by NotNotBatman)
    Look at the matches for each activity and notice that activity 5 and 1 can only be done by G, since G can't do more than one activity, a complete matching is not possible.
    Ohhh, got it thank you.
    Offline

    8
    ReputationRep:
    For question 4 of the June 2013 R paper, how come you need to rearrange the list in order to use the binary sort algorithm for part (a) and (b)?

    If part (b) did not ask you to use the list obtained in (a), could you still use the binary search to obtain Lydia? Or, does the binary search always require a list in order first?

    Thanks in advance!
    Offline

    10
    ReputationRep:
    Does anyone else think that cascade charts/scheduling diagrams are worth more than 4 marks? Literally it takes me 10-15 minutes to draw them!
    Offline

    14
    ReputationRep:
    (Original post by Glavien)
    For question 4 of the June 2013 R paper, how come you need to rearrange the list in order to use the binary sort algorithm for part (a) and (b)?

    If part (b) did not ask you to use the list obtained in (a), could you still use the binary search to obtain Lydia? Or, does the binary search always require a list in order first?

    Thanks in advance!
    Yes your list must be in order before you use a binary search.

    Think about it: if you can only look at one letter at a time (which is what the binary search is doing), how would you know whether H is before or after the middle letter in this list?
    c y u p w h t a g
    Offline

    8
    ReputationRep:
    (Original post by tiny hobbit)
    Yes your list must be in order before you use a binary search.

    Think about it: if you can only look at one letter at a time (which is what the binary search is doing), how would you know whether H is before or after the middle letter in this list?
    c y u p w h t a g
    So, for c y u p w h t a g wouldn't you just choose w as your middle letter and discard c-w as h is to the right of w, then carry on the algorithm. I'm guessing that is incorrect because the list is not in order, but it still works right?
    Offline

    2
    ReputationRep:
    Yes a binary search requires the list to be in order before you can start the procedure
 
 
 
  • 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
    Brussels sprouts
  • 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.