[NesQuiK.]

How are people finding this module?
I havn't done anything on this since february when i learnt it, so I guess I shiuld start on it sometime soon...

[gman2k8]

I ain't started revising yet, I've got D1 and D2 same day, I'm concentrating on my Chem and Maths (C2) atm then after its full on Descision revision!

[sil3nt_cha0s]

It's not too bad - Simplex algorithm is by far the hardest bit, but all in all, even that isn't *that* hard. I'm teaching myself D2 as well

[gman2k8]

(Original post by sil3nt_cha0s)
It's not too bad - Simplex algorithm is by far the hardest bit, but all in all, even that isn't *that* hard. I'm teaching myself D2 as well

I think Logic gates are horrible.

[sil3nt_cha0s]

(Original post by gman2k8)
I ain't started revising yet, I've got D1 and D2 same day, I'm concentrating on my Chem and Maths (C2) atm then after its full on Descision revision!

What board are you doing?

[gman2k8]

(Original post by sil3nt_cha0s)
What board are you doing?

MEI

[NesQuiK.]

I wondor if somebody could help me out:
2004 Specimen paper, question 5ii and 5iii,

http://www.ocr.org.uk/Data/publicati..._Maths_SAM.pdf

What on earth are upper bounds? I went through my textbook this morning and there were no mention of upper bounds anywhere?

[COMMUNIST]

Any good links for Simplex tableau??

[sonofdot]

I haven't looked at this since before Easter, will probably have to relearn it from scratch over the next couple of weeks...

(Original post by NesQuiK.)
I wondor if somebody could help me out:
2004 Specimen paper, question 5ii and 5iii,

http://www.ocr.org.uk/Data/publicati..._Maths_SAM.pdf

What on earth are upper bounds? I went through my textbook this morning and there were no mention of upper bounds anywhere?

I'm afraid I haven't looked at the paper, but does it mean upper bounds for the travelling salesman problem? If so, you use Nearest Neighbour, I think...

[NesQuiK.]

(Original post by sonofdot)
I haven't looked at this since before Easter, will probably have to relearn it from scratch over the next couple of weeks...

It shouldn't take very long. I taught myself if in 2.5 days in feb and didnt look at it untill this week and it only took a couple of hours to remember it all again, so i guess you would get thought it even quicker!

[sonofdot]

(Original post by NesQuiK.)
It shouldn't take very long. I taught myself if in 2.5 days in feb and didnt look at it untill this week and it only took a couple of hours to remember it all again, so i guess you would get thought it even quicker!

Yeah, I'm not too worried, I just need to try and remember all the algorithms...

[cyborg]

Haven't even started revising yet - I've got C3, Chemistry and FP1 next week.

[NesQuiK.]

(Original post by COMMUNIST)
Any good links for Simplex tableau??

I have a ridiculously comprehensive set of powerpoints for d1.
PM your email address

[NesQuiK.]

Just did a past paper, seriously what a stupid module lol!

[katiexo]

D1 is such a stupid module i agree and none of the algorithms are really that hard, i just cant ever remember all of them !

[COMMUNIST]

Does anyone have the mark scheme for the Jan 09 paper please??

[Ejit]

I'm really worried about it, I always make silly mistakes, and the written questions are really difficult in terms of working out what they want said.

[Papaya]

I haven't touched D1 in 6 months (self-teaching). Let's hope I can cope with a whole day's worth of revision tomorrow

[crazyness]

Is this module do-able in a day ? I know I've left it late?

[katiexo]

yeah crazyness i reckon it is, its really you have to learn i think its 10 algorithms and once you know them its fine. the only bit i find hard about it is actually remebering them. x