Login

Welcome, Guest. Please login or register.

October 19, 2025, 08:37:28 pm

Author Topic: My Solutions (Core; Graphs; Networks; Matrices)  (Read 29843 times)  Share 

0 Members and 1 Guest are viewing this topic.

Varunchka

  • Victorian
  • Forum Regular
  • **
  • Posts: 70
  • Va, Va, Varunchka!
  • School: Kingswood College
  • School Grad Year: 2012
Re: My Solutions (Core; Graphs; Networks; Matrices)
« Reply #15 on: November 02, 2012, 03:17:56 pm »
Not too sure but... Is Graphs + Rel Q.7 E?

I'm fairly sure it is A. How did you get E?
The gradient of the line is 5/2. So k in y = k/x should equal 5/2.
So shouldn't it be y = 5/2x?


AHHHHHH!! I SEE!!! That is such an amateur assumption! Damn!! :( 39/40 :(

Hmm... That's interesting. But the point (2,5)doesn't lie on the line y=5/2x, does it??

Poop. I was really hoping for 40/40. :(

It doesn't but the x-value 2 is the value after the transformations have taken place.
金玉其外,败絮其中...

2012: EL: [38] MM: [40] AC: [41] CHN: [40 FM: [43] ATAR: [94.15]

2013: Bachelor of Commerce at The University of Melbourne

Yendall

  • Victorian
  • Forum Leader
  • ****
  • Posts: 808
Re: My Solutions (Core; Graphs; Networks; Matrices)
« Reply #16 on: November 02, 2012, 03:19:27 pm »
ALSO, i had all the same matrices. So they should be right.
I can confirm this as well, those answers are correct :)
2013 - 2016: Bachelor of Computer Science @ RMIT
2017 - 2018: Master of Data Science @ RMIT
ΟΟΟΟ
VCE '12: | English | I.T: Applications | I.T: Software Development | Music Performance Solo |  Further Mathematics | Studio Arts |

oneoneoneone

  • Victorian
  • Trendsetter
  • **
  • Posts: 114
  • Meow meow, meow meow meow woof.
  • School: Socth Clogeg
  • School Grad Year: 2012
Re: My Solutions (Core; Graphs; Networks; Matrices)
« Reply #17 on: November 02, 2012, 03:20:02 pm »
Isnt Q5 Networks D?

sg

  • Victorian
  • Fresh Poster
  • *
  • Posts: 1
  • School: St Josephs Mildura
Re: My Solutions (Core; Graphs; Networks; Matrices)
« Reply #18 on: November 02, 2012, 03:22:07 pm »
I also have networks Q5 D and Q9 is C, anyone else get C for Q9?

Tonychet2

  • Guest
Re: My Solutions (Core; Graphs; Networks; Matrices)
« Reply #19 on: November 02, 2012, 03:23:20 pm »

Yendall

  • Victorian
  • Forum Leader
  • ****
  • Posts: 808
Re: My Solutions (Core; Graphs; Networks; Matrices)
« Reply #20 on: November 02, 2012, 03:24:46 pm »
Isnt Q5 Networks D?

yes it should be
How is it D? minimum completion time is 18, so you only need to reduce 2 hours, thus 2 activities?
wrong question hahaahah
2013 - 2016: Bachelor of Computer Science @ RMIT
2017 - 2018: Master of Data Science @ RMIT
ΟΟΟΟ
VCE '12: | English | I.T: Applications | I.T: Software Development | Music Performance Solo |  Further Mathematics | Studio Arts |

Yendall

  • Victorian
  • Forum Leader
  • ****
  • Posts: 808
Re: My Solutions (Core; Graphs; Networks; Matrices)
« Reply #21 on: November 02, 2012, 03:28:26 pm »
I OBJECT:

Question 8 in Networks:

If you forward and backward scan this network, the minimum completion time is 18 | 18. It says the duration of each activity can be reduced by one hour.
To complete this project in 16 hours, the minimum number of activities that must be reduced by one hour each is:

If the completion time is 18, you need to reduce it by 2 hours. If you reduce 2 activities by one hour each (as that's the limit) shouldn't the answer be B?

This is given that I've forward scanned and backward scanned correctly, which I believe I have. If I haven't, please subject me to the highest form of shame.
« Last Edit: November 02, 2012, 03:31:17 pm by Yendall »
2013 - 2016: Bachelor of Computer Science @ RMIT
2017 - 2018: Master of Data Science @ RMIT
ΟΟΟΟ
VCE '12: | English | I.T: Applications | I.T: Software Development | Music Performance Solo |  Further Mathematics | Studio Arts |

Will T

  • Victorian
  • Forum Obsessive
  • ***
  • Posts: 214
  • School: Haileybury College
  • School Grad Year: 2013
Re: My Solutions (Core; Graphs; Networks; Matrices)
« Reply #22 on: November 02, 2012, 03:29:50 pm »
I have completed solutions for Number patterns, I found it incredibly easy and am regretting not doing it on the exam.
We now have rough solutions for all the Modules and Core, so hopefully if we can have some debate we will have a correct set of solutions between us. :)
2012: Further Mathematics
2013: Specialist Mathematics | Japanese (SL) | Mathematical Methods CAS | Chemistry | English | UMEP - Mathematics

pwntnubs

  • Victorian
  • Adventurer
  • *
  • Posts: 21
Re: My Solutions (Core; Graphs; Networks; Matrices)
« Reply #23 on: November 02, 2012, 03:30:48 pm »
I think there are 2 critical paths so if you reduce F and H then you gotta reduce E as well

oppalovesme

  • Guest
Re: My Solutions (Core; Graphs; Networks; Matrices)
« Reply #24 on: November 02, 2012, 03:31:20 pm »
I OBJECT:

Question 8 in Networks:

If you forward and backward scan this network, the minimum completion time is 18 | 18. It says the duration of each activity can be reduced by one hour.
To complete this project in 16 hours, the minimum number of activities that must be reduced by one hour each is:

If the completion time is 18, you need to reduce it by 2 hours. If you reduce 2 activities by one hour each (as that's the limit) shouldn't the answer be B?

This is given that I've forward scanned and backward scanned correctly, which I believe I have. If I haven't, please subject me to the highest form of shame.
Sorry, but it should be C.
There are two critical paths : A-F-H and B-C-F-H (18 hours each), as well as the path A-E-G (17 hours).
To reduce the critical paths to 16, H must be reduced, and reducing A and B then brings all the paths over 16 hours down to 16 hours. :) (hard to explain sorry!)

bro0012

  • Victorian
  • Adventurer
  • *
  • Posts: 12
  • School: South gippsland secondary college
Re: My Solutions (Core; Graphs; Networks; Matrices)
« Reply #25 on: November 02, 2012, 03:31:54 pm »
Can anyone explain how to do Q11 in core?

biancajames

  • Victorian
  • Adventurer
  • *
  • Posts: 9
Re: My Solutions (Core; Graphs; Networks; Matrices)
« Reply #26 on: November 02, 2012, 03:32:21 pm »
I also have networks Q5 D and Q9 is C, anyone else get C for Q9?

i also got c !

Yendall

  • Victorian
  • Forum Leader
  • ****
  • Posts: 808
Re: My Solutions (Core; Graphs; Networks; Matrices)
« Reply #27 on: November 02, 2012, 03:32:52 pm »
I OBJECT:

Question 8 in Networks:

If you forward and backward scan this network, the minimum completion time is 18 | 18. It says the duration of each activity can be reduced by one hour.
To complete this project in 16 hours, the minimum number of activities that must be reduced by one hour each is:

If the completion time is 18, you need to reduce it by 2 hours. If you reduce 2 activities by one hour each (as that's the limit) shouldn't the answer be B?

This is given that I've forward scanned and backward scanned correctly, which I believe I have. If I haven't, please subject me to the highest form of shame.
Sorry, but it should be C.
There are two critical paths : A-F-H and B-C-F-H (18 hours each), as well as the path A-E-G (17 hours).
To reduce the critical paths to 16, H must be reduced, and reducing A and B then brings all the paths over 16 hours down to 16 hours. :) (hard to explain sorry!)
dang haha
2013 - 2016: Bachelor of Computer Science @ RMIT
2017 - 2018: Master of Data Science @ RMIT
ΟΟΟΟ
VCE '12: | English | I.T: Applications | I.T: Software Development | Music Performance Solo |  Further Mathematics | Studio Arts |

oppalovesme

  • Guest
Re: My Solutions (Core; Graphs; Networks; Matrices)
« Reply #28 on: November 02, 2012, 03:34:42 pm »
Can anyone explain how to do Q11 in core?
Add all the long-term average rainfalls together (=216.6), then divide by 4. This gives the seasonal average. Then, dividing the average for spring (61.3) by the seasonal average gives the seasonal index, roughly equal to 1.13.

Yendall

  • Victorian
  • Forum Leader
  • ****
  • Posts: 808
Re: My Solutions (Core; Graphs; Networks; Matrices)
« Reply #29 on: November 02, 2012, 03:37:22 pm »
For question 5 of networks.

For a complete graph to have an Euler Circuit the vertices must all be of even degree when transformed to planar. [I wasn't meant to say that, Planar is irrelevant]

Network 1 has 4 vertices of odd degree
Network 2 has 5 vertices of even degree
Network 3 has 7 vertices of even degree
Network 4 has 9 vertices of even degree

Therefore, 3 of the 4 graphs can have an Euler Circuit.
« Last Edit: November 02, 2012, 03:55:41 pm by Yendall »
2013 - 2016: Bachelor of Computer Science @ RMIT
2017 - 2018: Master of Data Science @ RMIT
ΟΟΟΟ
VCE '12: | English | I.T: Applications | I.T: Software Development | Music Performance Solo |  Further Mathematics | Studio Arts |