Exam Answers (all modules)

[Evan.T]

Also, out of curiosity for Module 5 Q1

tree??

which one is a tree?
[/quote]

A. A tree can't have a circuit(s)

[Quantum.Mechanic]

Why is question 7 on Mod 5 TBD?
Its simple in my opinion

Im doing the sols for a company and have it as follow


As it says it is a connected graph, there can be no isolated vertices, hence it must be a tree.
A) EDIT: Ooops. Accidentally subbed in the wrong values for Eulers formula. I stand corrected. v-e+f=2.
5-4+1=2
B) The graph only has one face. As a tree, there is only the undisclosed face which makes it one. Thus there is only 1 face. This is hence false
C) The variations of the tree that you can have mean that you can have an odd degree. I've drawn a few, but can't show it here. Therefore this is false.
D) The sum of the degrees must always be 8. With the fact that there are no loops, and the fact that they are all connected to each other, the first tree you draw will tell you the sum of the degrees, This is true
E) The graph cannot have a loop, otherwise, it is not a connected graph. There would be an isolated vertex, making this statement true

Therefore the number of true statements is equivalent to 3.

Answer is C.


Cowabunga dooods!

[texroy]

Freaking out right now.. I think I just 40'd. Someone let me know if there's anything wrong

Core: CBDCBBEEABACD
Geo/Trig: CDEACDCBB
Networks: AEADECBDB
Matrices: BDBECADBE

* - Currently listed as TBC in original post

EDIT: Nope, I see now how 7 is C. Eff my stressed brain not realising that planar graphs include those that can be redrawn to eliminate intersecting edges

[lolipopper]

Why is question 7 on Mod 5 TBD?
Its simple in my opinion

Im doing the sols for a company and have it as follow

As it says it is a connected graph, there can be no isolated vertices, hence it must be a tree.
A) It cannot be planar. No trees are planar
B) The graph only has one face. As a tree, there is only the undisclosed face which makes it one. Thus there is only 1 face. This is hence false
C) The variations of the tree that you can have mean that you can have an odd degree. I've drawn a few, but can't show it here. Therefore this is false.
D) The sum of the degrees must always be 8. With the fact that there are no loops, and the fact that they are all connected to each other, the first tree you draw will tell you the sum of the degrees, This is true
E) The graph cannot have a loop, otherwise, it is not a connected graph. There would be an isolated vertex, making this statement true

Therefore the number of true statements is equivalent to 2.

Answer is B.


Cowabunga dooods!

every tree is a planar graph brah.
https://www.google.com.au/search?q=can+trees+be+planar&source=lnms&sa=X&ei=gWNzUqfqHoTykAWVjIAo&ved=0CAYQ_AUoAA&biw=1366&bih=643&dpr=1

[KevinooBz]

Freaking out right now.. I think I just 40'd. Someone let me know if there's anything wrong

Core: CBDCBBEEABACD
Geo/Trig: CDEACDCBB
Networks: AEADECB*DB
Matrices: BDBECADBE

* - Currently listed as TBC in original post

I can confirm everything except Networks as being correct. Good job

[Professor Polonsky]

Woo! All done but trig/geo. Anyone care to help me?

[serendipity21]

Damn it, I was happy until you corrected your answer for Networks question 7

[Evan.T]

Woo! All done but trig/geo. Anyone care to help me?

Geo and Trig
1:C
2:D
3:E
4:A
5:C
6:D
7:C
8:B
9:B

[Professor Polonsky]

All solutions are up, and I'm quite confident in all of them.

[Huntyy]

Geometry q4 I got A.
[/quote

I got E, based off the contour map, the difference between A and E is that option A shows a decline in the end, while option E does not. If you look at the contour it increases throughout the end until it reaches point N.

Noticed you havent got answers for trig, so here are what i believe them to be, have crosschecked them and 3 other people have said the same thing.

1C
2D
3E
4A
5C
6D
7C
8B (Got this wrong in the exam.. stupid mistake, selected C but the answer is B).
9B

[maree271]

every tree is a planar graph brah.
https://www.google.com.au/search?q=can+trees+be+planar&source=lnms&sa=X&ei=gWNzUqfqHoTykAWVjIAo&ved=0CAYQ_AUoAA&biw=1366&bih=643&dpr=1

Wait....some clarification on the answer for question 7 on networks?

[lolipopper]

Wait....some clarification on the answer for question 7 on networks?

It's C. statements 1,4 and 5 are correct.

[maree271]

It's C. statements 1,4 and 5 are correct.

Okay thank you!

[Huntyy]

If I got 37/40, what's the maximum number of marks that I can lose on exam 2 to get a 45+ raw score?

Did pretty crappy on my SACs though 

Really depends by how "crappy" you did. Technically the rule of thumb is 1 mark lost = 1 study score lost.
So if you lost 3 you can afford to lose 2 marks on the short answer.

I got 38/40. Which I guess is alright, I was hoping for better, made a stupid mistake on question 2 in business and then question 8 of geom i muddled up. I didn't get an a+ in my sacs either.

[MrCommerce]

How do you work out Q9 for module 1?

B,C,D,E are all affected by the outlier whilst the three median line is not.