D1 (Decision 1) 17 May 2013 Official Thread

Of course, they are!

I'm worried about making a mistake in the exam, because I know that would be deadly in decision since the following questions always stem from the first (e.g inspection, CPA, Dijkstra's). Especially because I was making silly mistakes in the mechanics exam, but fortunately, I had enough time to check, idenify and correct them.

You know the way I do it, is I start the questions from the end and work my way forward, not from 1st question to last, because I dont know about you but with D1 your brain gets tired more quickly as you are using a lot of energy to check your work and to deal with patterns and cycles. I think linear and critical requires a lot from your brain.

Okay more defintions

define: distance matrix
define: connected graph
define: minimum spanning tree

Hmm, maybe that is a good idea but I want to do all the easy stuff so I feel confident for the more tricky critical path analysis and Linear programming

A distance matrix is a matrix showing the weight on the arcs between vertices.
A connected graph is a graph in which there is a path between every vertex.
A minimum spanning tree is a tree that contains all of the vertices of the graph, such that the total weight on all of the arcs is a small as possible

Ok, I'm going to bed. Good night. :/

can anyone explain scheduling to me? I just can't get my head around it...

thanks

can anyone explain scheduling to me? I just can't get my head around it...

thanks

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.

Can someone help me on Mixed Exercise 1F, Question 2b.

It's a bubble sort question and asks for the maximum number of interchanges needed to sort a list of six pieces of data? How do I work this out? Also what does the term interchanges actually mean?



Posted from TSR Mobile

Can someone help me on Mixed Exercise 1F, Question 2b.

It's a bubble sort question and asks for the maximum number of interchanges needed to sort a list of six pieces of data? How do I work this out? Also what does the term interchanges actually mean?



Posted from TSR Mobile

Take your time and double check before you go onto the next iteration/pass!

have you guys done the solomon, some questions are so challenging and weird?

Solomon Papers are the old specification, so you should ignore questions about simplex networks, the ones with the dotted lines, and planar graphs :-)


Posted from TSR Mobile

But for example this question on Linear programming is quite challenging

http://www.tomred.org/uploads/7/7/8/3/778329/d1_qp_solomon_b.pdf

question 6a)ii
do you know how to do it?

I'm going to make that my first past paper of the day So I'll let you know how I personally find it !

I just hope those long algorithm flow chart thingies don't come up this time round :s I don't think they will though... because it came up in January ? Was so long winded, that I didn't even attempt it.