smc-912-30-Definitions

Networks, STD2 N2 2018 FUR1 4 MC

Consider the graph below.

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

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`

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`

Which one of the following graphs is a tree?

Show Answers Only

`A`

Show Worked Solution

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

`=> A`

The number of edges in the graph above is

Show Answers Only

`C`

Show Worked Solution

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

`=> C`