Login

Welcome, Guest. Please login or register.

October 17, 2025, 12:34:49 am

Author Topic: VCAA Exam 1 2004  (Read 1550 times)  Share 

0 Members and 1 Guest are viewing this topic.

Hooligan

  • Victorian
  • Forum Obsessive
  • ***
  • Posts: 265
  • ... don't mess with fire.
  • Respect: +2
VCAA Exam 1 2004
« on: October 27, 2009, 05:58:16 pm »
0
Question 2 in Networks and decision mathematics module.

I don't get the question at all...  ??? Can someone explain?  :-\

EDIT: What is the definition of an equivalent graph?
« Last Edit: October 27, 2009, 06:09:39 pm by Hooligan »
¤ Kindle not a fire that you cannot extinguish ¤

techhatesme

  • Victorian
  • Trailblazer
  • *
  • Posts: 33
  • Respect: +1
Re: VCAA Exam 1 2004
« Reply #1 on: October 27, 2009, 07:12:53 pm »
0
Are you sure that it is part of the current study design?
Regards and Good Luck,

TechHatesMe

Hooligan

  • Victorian
  • Forum Obsessive
  • ***
  • Posts: 265
  • ... don't mess with fire.
  • Respect: +2
Re: VCAA Exam 1 2004
« Reply #2 on: October 27, 2009, 10:46:11 pm »
0
Are you sure that it is part of the current study design?

I'm not too sure myself either...  :-\
¤ Kindle not a fire that you cannot extinguish ¤

kazoospasm

  • Victorian
  • Trailblazer
  • *
  • Posts: 46
  • Respect: +1
Re: VCAA Exam 1 2004
« Reply #3 on: October 27, 2009, 11:40:32 pm »
0
Planar graphs are equal when they can be used to represent the same network.
That is, they're essentially the same graph drawn differently.

Note: I'm not doing Networks, so this could be completely wrong.
2009: Psychology; Further
2010: English Language; Biology; Chemistry; Methods

Hooligan

  • Victorian
  • Forum Obsessive
  • ***
  • Posts: 265
  • ... don't mess with fire.
  • Respect: +2
Re: VCAA Exam 1 2004
« Reply #4 on: October 28, 2009, 03:02:29 pm »
0
Planar graphs are equal when they can be used to represent the same network.
That is, they're essentially the same graph drawn differently.

Note: I'm not doing Networks, so this could be completely wrong.

right... then show me how to do this question?
¤ Kindle not a fire that you cannot extinguish ¤

Gloamglozer

  • The Walking VTAC Guide
  • Honorary Moderator
  • ATAR Notes Legend
  • *******
  • Posts: 4170
  • Here to listen and help
  • Respect: +324
Re: VCAA Exam 1 2004
« Reply #5 on: October 28, 2009, 03:44:03 pm »
0
Maybe the question is asking which of the planar graphs are identical?

I haven't done the VCAA 2004 exam yet unfortunately.

Bachelor of Science (Mathematics & Statistics) - Discrete Mathematics & Operations Research

dshban

  • Victorian
  • Forum Regular
  • **
  • Posts: 63
  • Respect: +1
Re: VCAA Exam 1 2004
« Reply #6 on: October 28, 2009, 04:03:55 pm »
0
Ah, I had this question in a SAC.

It's asking which graphs are exactly the same in terms of vertices connecting to other vertices - ie, graphs which are identical except moved around a bit. For example, look at Graph J. Its lower left vertex is connected to a vertex which connects diagonally to another and straight to another. It's hard to explain in just words, here, I'll try this:

2008 - Revolutions (35 raw)
2009 - Further (48), Business (46), English (41), Literature (38), Methods (31)

Holy crap 97.20!!!!!!!

Gloamglozer

  • The Walking VTAC Guide
  • Honorary Moderator
  • ATAR Notes Legend
  • *******
  • Posts: 4170
  • Here to listen and help
  • Respect: +324
Re: VCAA Exam 1 2004
« Reply #7 on: October 28, 2009, 04:12:05 pm »
0
Ah, so it's not asking what a equivalent graph actually is, but it's asking about which of the graphs are identical.  Thanks.

Bachelor of Science (Mathematics & Statistics) - Discrete Mathematics & Operations Research

Hooligan

  • Victorian
  • Forum Obsessive
  • ***
  • Posts: 265
  • ... don't mess with fire.
  • Respect: +2
Re: VCAA Exam 1 2004
« Reply #8 on: October 28, 2009, 05:59:05 pm »
0
Ah, I had this question in a SAC.

It's asking which graphs are exactly the same in terms of vertices connecting to other vertices - ie, graphs which are identical except moved around a bit. For example, look at Graph J. Its lower left vertex is connected to a vertex which connects diagonally to another and straight to another. It's hard to explain in just words, here, I'll try this:



Oh, so its actually just wanting us to find the graphs which are identical, in terms of the vertices (which stay put). :D Gotcha.

Thanks soo much! :)
¤ Kindle not a fire that you cannot extinguish ¤