Decision Maths (D1) woes

TheCenturion

TheCenturion

TheCenturion

Soldato
Joined
18 Mar 2008
Posts
12,751
I'm embarrassed to be posting about this module :o

I 'self taught' this module, and I have my exam coming up in a couple of weeks. I use self taught in the loosest sense. 6 half hour sessions was what it was. That was just reading the text book. Therefore, it took me a total of 3 hours of just reading the textbook to convince myself that I had done the course. Not clever. Now it's past paper time. In every question, I get what it's asking me, but I have no clue how to answer it.

So I'll use this thread if I really cannot answer something (only as a last resort! Remember revision should be done by ME)

To kick things off: I'm faced with a question where I have to use Dijkstra's algorithm. I would normally be able to nail this question, but instead of using it to find the shortest route from y to z, it's asking me to find the shortest route from several different points all towards a single point. How do I go about doing this? Text book ain't helping at all.

EDIT: What I've done is to take the single point, and work out the shortest route from this point to all the other points, which seems easier as it's the 'reverse' way. Does this sound correct?

Thanks very much OcUK :)
 
Last edited:
Unless it says you can't retrace paths you have already used that sounds right. It has been nearly three years since I sat D1 though. Was great learning when we had an out of the closet lesbian teacher. Ahh memories.
 
Eww d1 :(

Think I got a u in that form lack of revising, but on course to get a first in year 1 discrete at Uni... Go figure :)
 
You must log in or register to reply here.
Back
Top Bottom