Drawing A Network 1
Try VividMath Premium to unlock full access
Time limit: 0
Quiz summary
0 of 4 questions completed
Questions:
- 1
- 2
- 3
- 4
Information
–
You have already completed the quiz before. Hence you can not start it again.
Quiz is loading...
You must sign in or sign up to start the quiz.
You have to finish following quiz, to start this quiz:
Loading...
- 1
- 2
- 3
- 4
- Answered
- Review
-
Question 1 of 4
1. Question
Which diagram represents the given map below?
Hint
Help VideoCorrect
Nice Job!
Incorrect
Properties of the given map:
`1.` Vertex `A` is connected to vertices `B`, `D`, and `E`.`2.` Vertex `B` is connected to vertices `A` and `C`.`3.` Vertex `C` is connected to vertices `B`, `D`, and `E`.`4.` Vertex `D` is connected to vertices `A` and `E`.`5.` There are `2` edges connecting vertices `A` and `D`.Check each diagrams to see if their network has the above properties.`1`st Figure
Notice that vertices `D` and `E` are not connected.Therefore, the first diagram does not represent the given map.`2`nd Figure
Notice that there is only one edge connecting the vertices `A` and `D`.Therefore, the second diagram does not represent the given map.`3`rd Figure
This diagram fits all the properties of the given map.Therefore, the third diagram represents the given map.`4`th Figure
Notice that there is only one edge connecting the vertices `A` and `D`.Therefore, the fourth diagram does not represent the given map.Therefore, the third diagram is the diagram representing the given map. -
Question 2 of 4
2. Question
The diagram below show how to get to each town. Find out the best way to travel from town `U` to town `Z`.
Hint
Help VideoCorrect
Excellent!
Incorrect
A directed network has edges that only goes one way, meaning each edge’s value is used only once.Check which edges will head to town `Z` from town `U`. Remember that we can only move to the direction of the arrow.First, we can move directly to town `X` from town `U`.
Next, we can move directly to town `Y` from town `X`.
Finally, we can move directly to town `Z` from town `Y`.
This means that the best path is `U-X-Y-Z`.Therefore, the best path to use when heading from town `U` to town `Z` is `U-X-Y-Z` -
Question 3 of 4
3. Question
Which of the following networks illustrate the table below?
Hint
Help VideoCorrect
Fantastic!
Incorrect
There is more than one way to draw a network diagram, depending on its connections.First, identify which vertex has the most degrees.Degrees are indicated by `1` in the table.
Since the table shows that `B` has the most cells marked with `1`, vertex `B` has the most degrees, which is `4`.You can start the diagram by adding a point for `B`.
Next, identify which vertex has the second most degrees.
Since the table shows that `E` has `3` cells marked with `1`, vertex `E` has the second most degrees, which is `3`.You can plot a point for `E` on the diagram as well.
Now take note that this table is not directed, which means that the values on the table are symmetrical.This also means that there will be two connections for each edge that we draw.
Now we can start adding the rest of the vertices and adding edges from one vertex to another using the table as reference.Remember that networks can be drawn in more than one way. Here is one illustration of this network:Vertex `A` is connected to vertex `B`
Vertex `C` is connected to vertex `B` and `E`
Vertex `D` is connected to vertex `B` and `E`
Vertices `B` and `E` are also connected
As mentioned earlier, this is just one way to illustrate this table as a network. Another correct illustration would be this network:
-
Question 4 of 4
4. Question
Which of the following networks illustrate the table below?
Hint
Help VideoCorrect
Keep Going!
Incorrect
There is more than one way to draw a network diagram, depending on its connections.First, identify which vertex has the most degrees.Degrees are indicated by how many cells with values a column or a row has.
Since the table shows that `F` has the most cells with values, vertex `F` has the most degrees, which is `5`.You can start the diagram by adding a point for `F`.
Next, notice that `F` has values for all the other vertices in the table. This means that `F` should be connected to all the other vertices. One way to illustrate it is:
Now take note that this table is not directed, which means that the values on the table are symmetrical.This also means that there will be two connections for each edge that we draw.
Now we can start adding the rest of the vertices and adding edges from one vertex to another using the table as reference.Remember that networks can be drawn in more than one way. Here is one illustration of this network:Vertex `A` is connected to vertex `B` with a value of `20`.
Vertex `A` is connected to vertex `E` with a value of `30`
The edge connecting vertex `A` and vertex `F` has a value of `18`
Vertex `B` is connected to vertex `C` with a value of `35`
The edge connecting vertex `B` and vertex `F` has a value of `15`
Vertex `C` is connected to vertex `D` with a value of `22`
Vertex `C` is connected to vertex `F` with a value of `30`
Vertex `D` is connected to vertex `E` with a value of `20`
The edge connecting vertex `D` and vertex `F` has a value of `45`
The edge connecting vertex `E` and vertex `F` has a value of `32`
Quizzes
- Vertices and Edges
- Degrees 1
- Degrees 2
- Degrees 3
- Drawing A Network 1
- Drawing A Network 2
- Completing a Table from a Network Diagram
- Network from Maps and Plans
- Identifying Paths and Cycles
- Eulerian Trails and Circuits 1
- Eulerian Trails and Circuits 2
- Identifying Spanning Trees
- Minimum Spanning Trees 1
- Minimum Spanning Trees 2
- Shortest Path 1
- Shortest Path 2