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

    15
    ReputationRep:
    (Original post by Fortitude)
    I've always thought it was first fit.
    Huh, why do you have to do 2 types? I'm so confused :confused:
    • Welcome Squad
    Offline

    16
    ReputationRep:
    Welcome Squad
    (Original post by posthumus)
    I don't quite get what you mean ?
    He meant that after you've found some full bins what do you do with the rest of the numbers, do you apply first-fit or first-fit decreasing.
    • Welcome Squad
    Offline

    16
    ReputationRep:
    Welcome Squad
    (Original post by posthumus)
    Huh, why do you have to do 2 types? I'm so confused :confused:
    You don't do two types, usually or as we've learnt you just apply the first-fit but in 1 paper it seems like they did first-fit decreasing but if you see one of my previous posts I don't think it matters. I'd just stick w/ first-fit though.
    Offline

    15
    ReputationRep:
    (Original post by Fortitude)
    He meant that after you've found some full bins what do you do with the rest of the numbers, do you apply first-fit or first-fit decreasing.
    Oh how sillly of me damn it, I haven't come across full bin packing yet in past papers... but would have thought first fit

    Oh and thanks !
    • Thread Starter
    Offline

    1
    ReputationRep:
    (Original post by Fortitude)
    I've looked at the mark scheme again & I think we will get the mark because 2 marks are for the 2 full bins & then it states "2A1: A 4 bin solution found." so yeah I don't think it really matters or else they would have specified.
    Perfect cheers.

    Just got 68/75 on June 2009 so very happy 1 more A*! Only just but right now I am being super strict with my Marking, Removing ALL EASY ERRORS!!!!

    Hahaha looking forward to this Exam.

    Then onto revision for my other Exams.
    • Thread Starter
    Offline

    1
    ReputationRep:
    (Original post by Fortitude)
    You don't do two types, usually or as we've learnt you just apply the first-fit but in 1 paper it seems like they did first-fit decreasing but if you see one of my previous posts I don't think it matters. I'd just stick w/ first-fit though.
    Fortitude one last question.

    What is the definition of a Graph ironically it's the only definition I'm confused about now.

    2009 Papers are odd. I just want to get it confirmed.
    • Thread Starter
    Offline

    1
    ReputationRep:
    I find it funny how suddenly all the Crammers have jumped to the Forum Loooool.

    There is no way you can Cram D1. C3 and C4 if you are super focused. But not D1.

    Attachment 216187
    Name:  D1 Boundaries.PNG
Views: 51
Size:  19.4 KB
    And I'm not saying that just to be an idiot. See the D1 June Grade Boundaries, they are on average lower than the January Exams.

    People who sit it in January are usually more prepared.

    There is at times a 5-6 Mark Difference which is huge.
    Offline

    9
    ReputationRep:
    (Original post by Better)
    I find it funny how suddenly all the Crammers have jumped to the Forum Loooool.

    There is no way you can Cram D1. C3 and C4 if you are super focused. But not D1.
    What do you mean by a crammer? Also definition of a graph I use:
    A finite amount of verticies/nodes which are connected by edges/arcs


    Posted from TSR Mobile
    • Thread Starter
    Offline

    1
    ReputationRep:
    (Original post by Westeros)
    What do you mean by a crammer? Also definition of a graph I use:
    A finite amount of verticies/nodes which are connected by edges/arcs


    Posted from TSR Mobile
    That's what I do too but it's not correct in the Jan 2009 Markscheme.
    Offline

    9
    ReputationRep:
    (Original post by Better)
    That's what I do too but it's not correct in the Jan 2009 Markscheme.
    I don't see a question asking the definition of a graph in the Jan 09 Paper? Can you help me with this linear programming question
    Name:  ImageUploadedByStudent Room1368649595.970097.jpg
Views: 83
Size:  216.9 KB
    I need to Minimise C = 500x+800y
    how do I do this?
    (Summer 2010 Paper Q7)


    Posted from TSR Mobile
    • Thread Starter
    Offline

    1
    ReputationRep:
    (Original post by Westeros)
    I don't see a question asking the definition of a graph in the Jan 09 Paper? Can you help me with this linear programming question
    Name:  ImageUploadedByStudent Room1368649595.970097.jpg
Views: 83
Size:  216.9 KB
    I need to Minimise C = 500x+800y
    how do I do this?
    (Summer 2010 Paper Q7)


    Posted from TSR Mobile
    I could be wrong because I haven't had done that Paper in a while now; but I don't remember any of my Feasible Regions looking like that.

    Secondly your best of writing in Pencil.

    Thirdly just use your Objective Line ---- and stop at the earliest point you hit.

    But anyway time for me to do Physics. Don't think I'll go to school tomorrow, they go way to slowly in Chemistry and Physics. It is annoying. Will stay in and do D1 and Chemistry revision!
    Offline

    9
    ReputationRep:



    How do you do part b? I tried log6/log2 but that doesnt round to 15 :/
    Offline

    9
    ReputationRep:
    (Original post by Westeros)
    I don't see a question asking the definition of a graph in the Jan 09 Paper? Can you help me with this linear programming question
    Name:  ImageUploadedByStudent Room1368649595.970097.jpg
Views: 83
Size:  216.9 KB
    I need to Minimise C = 500x+800y
    how do I do this?
    (Summer 2010 Paper Q7)


    Posted from TSR Mobile
    You are minimising so you are looking for the first intersection if you do the ruler method.
    Offline

    9
    ReputationRep:
    (Original post by Better)
    I could be wrong because I haven't had done that Paper in a while now; but I don't remember any of my Feasible Regions looking like that.

    Secondly your best of writing in Pencil.

    Thirdly just use your Objective Line ---- and stop at the earliest point you hit.

    But anyway time for me to do Physics. Don't think I'll go to school tomorrow, they go way to slowly in Chemistry and Physics. It is annoying. Will stay in and do D1 and Chemistry revision!
    I checked the mark scheme and my graph is correct, so if i use the ruler method, the first point I hit is (11.2,6) and this works out £10400, but the mark scheme says (11,7) with a cost of £11100
    AH! I hate Linear Programming.
    Good Luck with your revision If you can look at this question tomorrow it would be much appreciated
    Offline

    15
    ReputationRep:
    (Original post by Westeros)
    I don't see a question asking the definition of a graph in the Jan 09 Paper? Can you help me with this linear programming question
    Name:  ImageUploadedByStudent Room1368649595.970097.jpg
Views: 83
Size:  216.9 KB
    I need to Minimise C = 500x+800y
    how do I do this?
    (Summer 2010 Paper Q7)


    Posted from TSR Mobile
    You have to move the objective line across and see which point it hits first (minimum)... you can achieve this by first aligning your ruler with the objective line then moving it across, the idea is to keep the gradient the same There's a technique where you can also use a set square to help you keep the rule consistent with objective lines gradient.

    However like in most cases I think here it's obvious that the "minimum" point is where the lines y=6 & 5x+4y=80 intersect

    You can find the x & y values by using simultaneous equations technique. When you have the co-ordinates, x & y .... sub them into your objective function
    Offline

    15
    ReputationRep:
    (Original post by QwertyG)



    How do you do part b? I tried log6/log2 but that doesnt round to 15 :/
    No you use the log thingy for finding how many iterations in binary search

    In this case use this: n/2 (n-1)

    therefore 3 x 5 = 15
    Online

    13
    ReputationRep:
    (Original post by posthumus)
    No you use the log thingy for finding how many iterations in binary search

    In this case use this: n/2 (n-1)

    therefore 3 x 5 = 15
    Ive never been taught the log thingy, what is it?
    Offline

    15
    ReputationRep:
    (Original post by Nitrogen)
    Ive never been taught the log thingy, what is it?
    To find the number of iterations in binary search, it came up in January (had no bloody clue how to do it), so I really don't think it will come up again.

    the most common way is actually to half it, and see how many times you half it...

    Another way is to use this

    2n = x

    where n is the number of iterations and x is the number of variables In QwertyG's case if it were binary search:

    2n = 6

    therefore : n = log26
    which equals = 2.6

    therefore 3 iterations are possible... I'll use the common method to confirm this:

    6/2 = 3
    3/2 = [1.5] = 2
    2/2= 1
    Offline

    1
    ReputationRep:
    Can I just clarify that Hamilton cycles are not in this spec?????


    Posted from TSR Mobile
    Offline

    15
    ReputationRep:
    (Original post by Flounder1)
    Can I just clarify that Hamilton cycles are not in this spec?????


    Posted from TSR Mobile
    Nope, it's not !
 
 
 
  • 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
    Would you rather give up salt or pepper?
  • 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

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