smc-1136-30-Definitions

Networks, STD1 N1 2021 HSC 1 MC

A network diagram is shown.

How many vertices are in this network?

Show Answers Only

`B`

Show Worked Solution

`text(Vertices = 6)`

`=> B`

Networks, STD1 N1 2020 HSC 5 MC

Which of the following network diagrams is NOT a tree?

Show Answers Only

`A`

Show Worked Solution

♦ Mean mark 45%.

`text{A tree cannot have a loop.}`

`=> \ A`

Networks, STD2 N2 2018 FUR1 4 MC

Consider the graph below.

Which one of the following is not a path for this graph?

`PRQTS`
`PRTSQ`
`PTQSR`
`PTRQS`

Show Answers Only

`C`

Show Worked Solution

`text(By trial and error:)`

`text(Consider option)\ C,`

`PTQSR\ text(is not a path because)\ S\ text(to)\ R`

`text(must go through another vertex.)`

`=> C`

Networks, STD2 N2 SM-Bank 3 MC

A store manager is directly in charge of five department managers.

Each department manager is directly in charge of six sales people in their department.

This staffing structure could be represented graphically by

A. a tree.

B. a path.

C. a cycle.

D. a weighted graph.

Show Answers Only

`A`

Show Worked Solution

`=> A`

Networks, STD2 N2 2013 FUR1 1 MC

Which one of the following graphs is a tree?

Show Answers Only

`A`

Show Worked Solution

`text(A tree cannot contain a cycle.)`

`=> A`

Networks, STD2 N2 2010 FUR1 2 MC

The number of edges in the graph above is

`5`
`7`
`8`
`10`

Show Answers Only

`C`

Show Worked Solution

`text{Edges are represented by lines between vertices.}`

`=> C`