The Student Room Group
Competition - post a photo you've taken of nature >>
Competition - post a photo you've taken of nature >>
Competition - post a photo you've taken of nature >>

D1 (Decision 1) 17 May 2013 Official Thread

Scroll to see replies

Original post by Better
Correct, no matter what.

By Definition each Activity must be shown Uniquely hence you cannot have a "loop" of Two Activities leaving the same Event (Node) and Ending at the same Event (Node).


Ah okay, thank you for confirming that :biggrin:

Makes sense I guess since you might as well just have them both as one activity if you were going to portray it as a sort of "loop" :smile:
Reply 161
Avatar for Better
Better
OP
8
Original post by posthumus
Ah okay, thank you for confirming that :biggrin:

Makes sense I guess since you might as well just have them both as one activity if you were going to portray it as a sort of "loop" :smile:


Oh yeah ! I didn't even think of that good point!! :wink:
Original post by posthumus
Ah okay, thank you for confirming that :biggrin:

Makes sense I guess since you might as well just have them both as one activity if you were going to portray it as a sort of "loop" :smile:

Hi my friend how are you :smile:

can you help me on question

http://www.edexcel.com/migrationdocuments/QP%20GCE%20Curriculum%202000/GCE%20January%202010%20-%20QP/6689_01_que_20100115.pdf

7)d)

thanks
Original post by otrivine


Hey :biggrin: It would have helped if you gave me the question paper instead of the answer booklet ! :tongue:

well anyway :smile: You can make the x coefficient 1 and since y is 40% greater than x... you can make the coefficient of y 1.4
so you get:

x + 1.4y

to get to the nearest integer :smile: Multiply by 5

5x + 7y
Original post by posthumus
Hey :biggrin: It would have helped if you gave me the question paper instead of the answer booklet ! :tongue:

well anyway :smile: You can make the x coefficient 1 and since y is 40% greater than x... you can make the coefficient of y 1.4
so you get:

x + 1.4y

to get to the nearest integer :smile: Multiply by 5

5x + 7y


sorry, thanks , hey want to revise definitions?

define:alternating path (2)
Reply 165
Avatar for Better
Better
OP
8
Original post by otrivine
sorry, thanks , hey want to revise definitions?

define:alternating path (2)


It's easy to test yourself, just put them all in a word Document then just go through and see if you know them..... Lets leave this thread just for Questions instead as we have 2 Proper Teachers here who have been helping. Go to Arseys thread which I posted at the front if you are unsure about the definitions too - hope that helps.
Original post by Better
It's easy to test yourself, just put them all in a word Document then just go through and see if you know them..... Lets leave this thread just for Questions instead as we have 2 Proper Teachers here who have been helping. Go to Arseys thread which I posted at the front if you are unsure about the definitions too - hope that helps.


I agree with you :smile:


But I thought maybe testing each other in definition will help us remember, because the definitions are quite difficult in d1 to memorise.
So yh I've been going through the D1 Edexcel book and sometimes they ask you to explain something...

... I have no idea and usually just turns back to look at the answers to be like WTF :confused: This is the most complex explanation I've seen in my life! (well assuming they are only work 1/2 marks anyway).

Also can someone quickly confirm for me, in critical path analysis... if I have to number the nodes or not ? :smile:

Thanks in advance
I'm alright with everything except of linear programming, they always have some next random equations that's the hard part. However objective line method and all the other things are easy.3
Reply 169
Avatar for Better
Better
OP
8
Original post by posthumus
So yh I've been going through the D1 Edexcel book and sometimes they ask you to explain something...

... I have no idea and usually just turns back to look at the answers to be like WTF :confused: This is the most complex explanation I've seen in my life! (well assuming they are only work 1/2 marks anyway).

Also can someone quickly confirm for me, in critical path analysis... if I have to number the nodes or not ? :smile:

Thanks in advance


IRight now the only thing that has me confused is Dijkstra's - what did you do to check (usually 2 Marks). I say that I scanned back but I'm not sure if that's enough. I hope my Teacher gets back my 2010-2012 Papers soon!!! Argh I need them back by Friday, he's marked 2005-2009 Papers though.... And sorry to answer you yes when you do the Diagrams you MUST include the number on the nodes. I lost a few Marks in my Early papers not doing this. If you are doing Scheduling you will see the Nodes make things very easy to see Precendence. You can actually work through in Order of Numbering of Nodes, then use the other methods, which Maths24/7 Layed out in his video (making sure you schedule, activities which have the earliest Late Event Time first).
(edited 10 years ago)
Reply 170
Avatar for Better
Better
OP
8
It's great everyone is talking about their weakest topics actually - It's making me remember the mistakes I've made!! I won't make those again!!!!
Original post by Better
IRight now the only thing that has me confused is Dijkstra's - what did you do to check (usually 2 Marks). I say that I scanned back but I'm not sure if that's enough. I hope my Teacher gets back my 2010-2012 Papers soon!!! Argh I need them back by Friday, he's marked 2005-2009 Papers though.... And sorry to answer you yes when you do the Diagrams you MUST include the number on the nodes. I lost a few Marks in my Early papers not doing this. If you are doing Scheduling you will see the Nodes make things very easy to see Precendence. You can actually work through in Order of Numbering of Nodes, then use the other methods, which Maths24/7 Layed out in his video (making sure you schedule, activities which have the earliest Late Event Time first).


Still need to Dijkstra :frown: I understand its difficult to find the erm shortest route ? Similar to the early and late time graphs. I just take my time :tongue: And go over it once more, carefully... however that's time consuming!

Ah darn it, do the numbers have to be in a specific order to get my marks? :frown: I don't see the need for numbers.

Also do you think its necessary to use a ruler for gant/scheduling diagrams? Seems like a stupid question :tongue: But it was too god damn time consuming :colondollar: I did half of it free-hand.... ran out of time and couldn't do some of the first 3 questions I skipped :tongue:
Reply 172
Avatar for Better
Better
OP
8
Got my Papers back only got 73/75 on 1 paper, one of the 2012 Papers.

The other papers were low A grades. Which is v v annoying. Going to re-do
- Jan2006-2008, 2011
- The 4 Mock papers, then the 2012 Papers.

Before like Wednesday next week. Going for 75/75....
Original post by posthumus
Ah okay, thank you for confirming that :biggrin:

Makes sense I guess since you might as well just have them both as one activity if you were going to portray it as a sort of "loop" :smile:


Hi :smile:


want to revise the defintions :smile:

Define:tree
Original post by otrivine
Hi :smile:


want to revise the defintions :smile:

Define:tree


Connected graph without any cycles.

Digraph ?
Original post by posthumus
Connected graph without any cycles.

Digraph ?


correct :smile:


digraph is if the graph is associated with the edges have a specific direction. directional graph
Reply 176
Avatar for OG-Ashley
OG-Ashley
Can someone explain question 2b) in Exercise1F ? dont know how they got 15 (Edexcel book)
Original post by OG-Ashley
Can someone explain question 2b) in Exercise1F ? dont know how they got 15 (Edexcel book)


Just remember this : 0.5n(n-1)

"n" being the number of variable you have, so in this case that's 6 :smile:
Original post by posthumus
Just remember this : 0.5n(n-1)

"n" being the number of variable you have, so in this case that's 6 :smile:


Hi

Define: minimum spanning tree
Original post by otrivine
Hi

Define: minimum spanning tree


Erm a minimum spanning tree is where nodes have no more than 1 arc between them and there are no cycles. The weight of this tree will be the minimum ? :colondollar:

Define : Bipartite graph & Also maximum matching :smile:

Quick Reply

Related discussions

Latest

Trending

Trending

Articles for you