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

    0
    ReputationRep:
    i am preparing to absolutely ace D1 and hopefully get high 90's ums, think it will make up for the 30 ill probbably get in c2!!
    Offline

    9
    ReputationRep:
    (Original post by Jammy4410)
    what is the order of difficulty of the chapters of this book?
    My personal opinion (from easiest to hardest):
    7) Matchings
    1) Algorithms
    3) Algorithms on Networks
    2) Graphs and Networks
    4) Route Inspection
    5) Critical Path Analysis
    6) Linear Programming
    • Thread Starter
    Offline

    1
    ReputationRep:
    (Original post by Season One)
    If i don't get an A this time i think i will use prims algorithm to find the shortest route to the nearest tall building then jump off it.
    That is actually hilarious.

    Anyway please can someone help me!!!!

    When you do Integer Solutions for Linear Programming how do you know whether or note your answer is in the feasible region?

    Please see my work this is May 2012. Pardon my Handwriting, I tried to do it in 1hr 15 Mins, to put myself under Exam Style Pressure.

    I don't know how to choose which Integers or rather Test which one is the correct Maximum

    I got this wrong twice now.

    Name:  IMG-20130514-00854.jpg
Views: 100
Size:  268.2 KB
    Offline

    0
    ReputationRep:
    (Original post by Better)
    That is actually hilarious.

    Anyway please can someone help me!!!!

    When you do Integer Solutions for Linear Programming how do you know whether or note your answer is in the feasible region?

    Please see my work this is May 2012. Pardon my Handwriting, I tried to do it in 1hr 15 Mins, to put myself under Exam Style Pressure.

    I don't know how to choose which Integers or rather Test which one is the correct Maximum

    I got this wrong twice now.

    Name:  IMG-20130514-00854.jpg
Views: 100
Size:  268.2 KB
    do you have a copy of the graph?
    • Thread Starter
    Offline

    1
    ReputationRep:
    (Original post by calla_lily)
    do you have a copy of the graph?

    http://www.tomred.org/uploads/7/7/8/..._june_2012.pdf

    Page 13.

    My graph is pretty identical to this one. I can upload it though if you need it to help me out.
    Offline

    0
    ReputationRep:
    (Original post by Better)
    Yeah mate, I'll hit you up on your wall, thanks to the studentroom loads of people are helping me so I'm past paper ready for C3 C4, not D1 yet
    How are you getting help?
    • Thread Starter
    Offline

    1
    ReputationRep:
    Okay the book says:

    "Evaluate the objective function, and most importantly, check that the integer solutions lie in the feasible region,

    *Then they check their integers with EVERY CONTRAINT* "

    Isn't there a faster way to check? That would take long, to check 4 Co-ordinates (or 8 Values) against 4/5 Inequalities.

    So so glad I made that mistake now. Phew! I won't make that mistake on Friday!!!
    • Thread Starter
    Offline

    1
    ReputationRep:
    (Original post by Brunette_Gem)
    How are you getting help?
    I can't even remember making that post. People give tips and help.

    If it wasn't for this Forum my D1 would be looking bad, but I've been here getting tips for like 2 weeks now.

    There are teachers who recommend videos to watch, and give you advice based on past students.

    Exam Technique is crucial.
    Offline

    15
    ReputationRep:
    Just found out you have to "change status" for matching questions -___- *face-palm*

    How did I not know this, so I guess this is where all my accuracy marks went for the matchings questions in the Jan exam
    Offline

    1
    ReputationRep:
    Name:  ImageUploadedByStudent Room1368562103.848938.jpg
Views: 89
Size:  36.6 KBName:  ImageUploadedByStudent Room1368562159.963755.jpg
Views: 85
Size:  65.9 KB

    Hello I was wondering if you guys could tell me if this scheduling diagram is right?? Ignore the crappy shading and the other boxes 😳


    Posted from TSR Mobile
    Offline

    4
    ReputationRep:
    (Original post by Flounder1)
    Name:  ImageUploadedByStudent Room1368562103.848938.jpg
Views: 89
Size:  36.6 KBName:  ImageUploadedByStudent Room1368562159.963755.jpg
Views: 85
Size:  65.9 KB

    Hello I was wondering if you guys could tell me if this scheduling diagram is right?? Ignore the crappy shading and the other boxes 😳


    Posted from TSR Mobile
    Its perfect because you have not broken any dependencies , so your answer is correct
    Offline

    1
    ReputationRep:
    Name:  ImageUploadedByStudent Room1368562742.366565.jpg
Views: 73
Size:  63.0 KB
    Sorry again question e and f are confusing I don't know how to complete e without a gang chart T_T is their a way you can do it without making one?


    Posted from TSR Mobile
    Offline

    4
    ReputationRep:
    (Original post by Flounder1)
    Name:  ImageUploadedByStudent Room1368562742.366565.jpg
Views: 73
Size:  63.0 KB
    Sorry again question e and f are confusing I don't know how to complete e without a gang chart T_T is their a way you can do it without making one?


    Posted from TSR Mobile
    is it okay if you could zoom it a bit , its quite blurry . thanks
    Offline

    15
    ReputationRep:
    Guys,

    You know sometimes after you complete a Dijkstra algorithm and state the quickest route's length.... there's usually another question saying state the shortest route and length if you could not go through letter "X", how do you guys go about doing this ?
    Do you just use your own initiative, or is there some kind of algorithm/ technique that is typically use. I believe its 2 marks and none are allocated to the working out, not too sure

    Thanks in advance as always !
    Offline

    1
    ReputationRep:
    Name:  ImageUploadedByStudent Room1368563136.016516.jpg
Views: 68
Size:  55.3 KBName:  ImageUploadedByStudent Room1368563188.087610.jpg
Views: 70
Size:  65.1 KB
    Sorry here it is again e and f


    Posted from TSR Mobile
    Offline

    4
    ReputationRep:
    (Original post by Flounder1)
    Name:  ImageUploadedByStudent Room1368563136.016516.jpg
Views: 68
Size:  55.3 KBName:  ImageUploadedByStudent Room1368563188.087610.jpg
Views: 70
Size:  65.1 KB
    Sorry here it is again e and f


    Posted from TSR Mobile
    okay for the activities to be happening at day 20 is the answer D, I , J , L ?
    Offline

    0
    ReputationRep:
    guys how do i get the Jan 2013 paper???
    Offline

    4
    ReputationRep:
    (Original post by posthumus)
    Guys,

    You know sometimes after you complete a Dijkstra algorithm and state the quickest route's length.... there's usually another question saying state the shortest route and length if you could not go through letter "X", how do you guys go about doing this ?
    Do you just use your own initiative, or is there some kind of algorithm/ technique that is typically use. I believe its 2 marks and none are allocated to the working out, not too sure

    Thanks in advance as always !
    What I do, is that , I see which alternative path gives the lowest value, so I chose the second lowest value and go from there, its really trial and error, you have to play around with your calculator with the routes to see which value gives you the lowest
    Offline

    4
    ReputationRep:
    (Original post by alex011)
    guys how do i get the Jan 2013 paper???
    here you go

    http://www.studentforums.biz/

    the paper and mark scheme is found on this site
    Offline

    16
    ReputationRep:
    So any revision tips? I just keep making the most silliest mistakes anyone know how to conquer that? e.g. mistakes in bubble sort like missing a number or not having the final pass or something like that.
 
 
 
  • 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 like to hibernate through the winter months?
  • 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.