How do you all manage to make them boxes around the nodes, I make big boxes and small boxes. I know that in the exam, they'll probably provide the boxes, but I was just wondering, how you lot manage to practise Djisktra's algorithm, I keep making small boxes, and large ones, and it doesn't look nice.(Original post by bright star)
Djikstra's for shortest path is a BIG BIG hit for exam questions
As far as simplex method goes, I'll learn it as I've revised most of the stuff that you've stated, I think its nice to have a algebraic method solving linear programme problems. I hate the graphical inequality approach.
Turn on thread page Beta
D+D Help Needed! watch
- 19-06-2005 17:58
- 19-06-2005 18:09
You have to have a big diagram preferable bout an A4 sheet for the whole network.
If u draw, space the nodes as far apart as possible which elaves enough space to draw ur boxes.
- 19-06-2005 18:18
I'm doing the current specification MEI D1 exam tommorow, we've been told we need to know the following;
Graph theory definitions (Hamiltonian cycle, path, walk, trail, isomorphic etc...),
Algorithms: Djikstra's, Prim's, Kruskal's, Bubble sort. (We've also been told to know how to use shuttle sort and quick sort, but that if it's needed in the exam, the algorithm will be provided),
Critical path drawing, forwards and backwards passes, float calculation (Total float, independant float, interfering float), cascade charts and resource histograms.
Linear programming, forming inequalities, plotting them, finding the faesible region, etc,
Simulation, creating rules for the use of random numbers, (I.e 00 - 14 = 5 seconds), completing simulation tables, and ways to improve simulations.
Good luck with the decision exams tommorow everyone.
Oh, P.S; When drawing a cascade chart, you have to draw the float in with dotted lines... Do these continue until the EARLY or LATE event time for next event??