Drawing A Network 2
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 of the following networks illustrate the table below?
Hint
Help VideoCorrect
Correct!
Incorrect
A directed network has edges that only goes one way, meaning each edge’s value is used only once.First, notice that the `0` values on the table create a diagonal line that divides the table, but the two sides of the table are not symmetrical.
This means that the table is representing a directed network.Now we can start adding 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, but since we are making a directed network, keep in mind the from and to part of the table for the direction of the table. Here is one illustration of this network:Plot the vertices `A`, `B`, `C`, and `D`.
Vertex `A` connects toward vertex `B` with a value of `8`, towards vertex `C` with a value of `12`, and towards vertex `D` with a value of `6`.
Vertex `B` connects toward vertex `C` with a value of `8` and towards vertex `D` with a value of `10`.
Vertex `C` connects toward vertex `A` with a value of `10` and towards vertex `B` with a value of `10`.
Vertex `D` connects toward vertex `C` with a value of `7`.
As mentioned earlier, this is just one way to illustrate this table as a network. Another correct illustration would be this network:
-
Question 2 of 4
2. Question
Which of the following networks illustrate the table below?
Hint
Help VideoCorrect
Great Work!
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 the person with the most friends in the table.
Since the table shows that Mia has the most friends,, Mia’s vertex has the most degrees, which is `4`.You can start the diagram by adding a point for Mia.
Next, notice that Mia is a friend of all the other four people in the table. This means that Mia’s vertex should be connected to all the other vertices. One way to illustrate it is:
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:Dylan and Amelia are friends with each other.
As mentioned earlier, this is just one way to illustrate this table as a network. Another correct illustration would be this network:
-
Question 3 of 4
3. 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 the person with the most friends in the table.
Since the table shows that Emma has the most friends,, Emma’s vertex has the most degrees, which is `4`.You can start the diagram by adding a point for Emma.
Next, make vertices to represent Emma’s friends and connect them to Emma’s vertex. One way to illustrate it is:
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:Sophie is a friend of Ada.
Bianca is a friend of Noah.
Dion is a friend of Bianca.
Len is a friend of Sophia.
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
Nice Job!
Incorrect
There is more than one way to draw a network diagram, depending on its connections.First, identify which vertex has the least degrees.Degrees are indicated by the person with the least friends in the table.
Since the table shows that Steve has the least friends,, Steve’s vertex has the least degrees, which is `2`.You can start the diagram by adding a point for Steve and adding small lines to indicate how many degrees the vertex has.
Now we can start adding the rest of the vertices and adding lines to indicate their degrees and to which vertex they can be connected to using the table as reference.Remember that networks can be drawn in more than one way. Here is one illustration of this network:Sam has `3` friends: Logan, James and Steve.
Logan has `3` friends: Sam, James and Liam.
Liam has `3` friends: Logan, James and Steve.
James has `3` friends: Sam, Logan and Liam.
Now you can connect the vertices by making edges marked with the small lines.
As mentioned earlier, this is just one way to illustrate this table as a network. Another correct illustration would be this network:
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