Information
You have already completed the quiz before. Hence you can not start it again.
You must sign in or sign up to start the quiz.
You have to finish following quiz, to start this quiz:
Loading...
-
Question 1 of 4
Fill in the table using the undirected network below
Fill in cells without values with -
Incorrect
Loaded: 0%
Progress: 0%
0:00
An undirected network has edges that goes both ways, so each edge’s value is used twice. It then forms a symmetrical table.
Fill up the table using the values of the edges going from a vertex to another.
Note that since this network is undirected, the values on the table will be symmetrical as well.
|
To |
From |
|
A |
B |
C |
D |
E |
A |
|
4 |
|
|
|
B |
4 |
|
|
|
|
C |
|
|
|
|
|
D |
|
|
|
|
|
E |
|
|
|
|
|
|
To |
From |
|
A |
B |
C |
D |
E |
A |
|
4 |
7 |
|
|
B |
4 |
|
|
|
|
C |
7 |
|
|
|
|
D |
|
|
|
|
|
E |
|
|
|
|
|
|
To |
From |
|
A |
B |
C |
D |
E |
A |
|
4 |
7 |
8 |
|
B |
4 |
|
|
|
|
C |
7 |
|
|
|
|
D |
8 |
|
|
|
|
E |
|
|
|
|
|
|
To |
From |
|
A |
B |
C |
D |
E |
A |
|
4 |
7 |
8 |
7 |
B |
4 |
|
|
|
|
C |
7 |
|
|
|
|
D |
8 |
|
|
|
|
E |
7 |
|
|
|
|
|
To |
From |
|
A |
B |
C |
D |
E |
A |
|
4 |
7 |
8 |
7 |
B |
4 |
|
5 |
|
|
C |
7 |
5 |
|
|
|
D |
8 |
|
|
|
|
E |
7 |
|
|
|
|
|
To |
From |
|
A |
B |
C |
D |
E |
A |
|
4 |
7 |
8 |
7 |
B |
4 |
|
5 |
|
|
C |
7 |
5 |
|
6 |
|
D |
8 |
|
6 |
|
|
E |
7 |
|
|
|
|
|
To |
From |
|
A |
B |
C |
D |
E |
A |
|
4 |
7 |
8 |
7 |
B |
4 |
|
5 |
|
|
C |
7 |
5 |
|
6 |
|
D |
8 |
|
6 |
|
9 |
E |
7 |
|
|
9 |
|
All the values are listed, so simply add dashes (-) to the rest of the cells.
|
To |
From |
|
A |
B |
C |
D |
E |
A |
- |
4 |
7 |
8 |
7 |
B |
4 |
- |
5 |
- |
- |
C |
7 |
5 |
- |
6 |
- |
D |
8 |
- |
6 |
- |
9 |
E |
7 |
- |
- |
9 |
- |
|
To |
From |
|
A |
B |
C |
D |
E |
A |
- |
4 |
7 |
8 |
7 |
B |
4 |
- |
5 |
- |
- |
C |
7 |
5 |
- |
6 |
- |
D |
8 |
- |
6 |
- |
9 |
E |
7 |
- |
- |
9 |
- |
-
Question 2 of 4
Fill in the table using the directed network below
Fill in cells without values with -
Incorrect
Loaded: 0%
Progress: 0%
0:00
A directed network has edges that only goes one way, meaning each edge’s value is used only once.
First, count the number of edges or connections the network has.
There are a total of 10 edges. Therefore, there will only be 10 values to be entered to the table.
Next, fill up the table using the values of the edges going from a vertex to another, following the given direction.
|
To |
From |
|
P |
Q |
R |
S |
T |
P |
|
16 |
|
|
|
Q |
|
|
|
|
|
R |
|
|
|
|
|
S |
|
|
|
|
|
T |
|
|
|
|
|
|
To |
From |
|
P |
Q |
R |
S |
T |
P |
|
16 |
|
|
8 |
Q |
|
|
|
|
|
R |
|
|
|
|
|
S |
|
|
|
|
|
T |
|
|
|
|
|
|
To |
From |
|
P |
Q |
R |
S |
T |
P |
|
16 |
|
|
8 |
Q |
10 |
|
|
|
|
R |
|
|
|
|
|
S |
|
|
|
|
|
T |
|
|
|
|
|
|
To |
From |
|
P |
Q |
R |
S |
T |
P |
|
16 |
|
|
8 |
Q |
10 |
|
12 |
|
|
R |
|
|
|
|
|
S |
|
|
|
|
|
T |
|
|
|
|
|
|
To |
From |
|
P |
Q |
R |
S |
T |
P |
|
16 |
|
|
8 |
Q |
10 |
|
12 |
|
19 |
R |
|
|
|
|
|
S |
|
|
|
|
|
T |
|
|
|
|
|
|
To |
From |
|
P |
Q |
R |
S |
T |
P |
|
16 |
|
|
8 |
Q |
10 |
|
12 |
|
19 |
R |
|
|
|
15 |
|
S |
|
|
|
|
|
T |
|
|
|
|
|
|
To |
From |
|
P |
Q |
R |
S |
T |
P |
|
16 |
|
|
8 |
Q |
10 |
|
12 |
|
19 |
R |
|
|
|
15 |
|
S |
|
14 |
|
|
|
T |
|
|
|
|
|
|
To |
From |
|
P |
Q |
R |
S |
T |
P |
|
16 |
|
|
8 |
Q |
10 |
|
12 |
|
19 |
R |
|
|
|
15 |
|
S |
|
14 |
20 |
|
|
T |
|
|
|
|
|
|
To |
From |
|
P |
Q |
R |
S |
T |
P |
|
16 |
|
|
8 |
Q |
10 |
|
12 |
|
19 |
R |
|
|
|
15 |
|
S |
|
14 |
20 |
|
|
T |
10 |
|
|
|
|
|
To |
From |
|
P |
Q |
R |
S |
T |
P |
|
16 |
|
|
8 |
Q |
10 |
|
12 |
|
19 |
R |
|
|
|
15 |
|
S |
|
14 |
20 |
|
|
T |
10 |
|
|
13 |
|
Since there are already 10 values listed in the table, all the values are accounted for. Add dashes (-) to the rest of the cells.
|
To |
From |
|
P |
Q |
R |
S |
T |
P |
- |
16 |
- |
- |
8 |
Q |
10 |
- |
12 |
- |
19 |
R |
- |
- |
- |
15 |
- |
S |
- |
14 |
20 |
- |
- |
T |
10 |
- |
- |
13 |
- |
|
To |
From |
|
P |
Q |
R |
S |
T |
P |
- |
16 |
- |
- |
8 |
Q |
10 |
- |
12 |
- |
19 |
R |
- |
- |
- |
15 |
- |
S |
- |
14 |
20 |
- |
- |
T |
10 |
- |
- |
13 |
- |
-
Question 3 of 4
Fill in the table using the directed network below
Fill in cells without values with -
Incorrect
Loaded: 0%
Progress: 0%
0:00
A directed network has edges that only goes one way, meaning each edge’s value is used only once.
First, count the number of edges or connections the network has.
There are a total of 11 edges. Therefore, there will only be 11 values to be entered to the table.
Next, fill up the table using the values of the edges going from a vertex to another, following the given direction.
|
To |
From |
|
A |
B |
C |
D |
E |
F |
A |
|
|
|
|
10 |
|
B |
|
|
|
|
|
|
C |
|
|
|
|
|
|
D |
|
|
|
|
|
|
E |
|
|
|
|
|
|
F |
|
|
|
|
|
|
|
To |
From |
|
A |
B |
C |
D |
E |
F |
A |
|
|
|
|
10 |
2 |
B |
|
|
|
|
|
|
C |
|
|
|
|
|
|
D |
|
|
|
|
|
|
E |
|
|
|
|
|
|
F |
|
|
|
|
|
|
|
To |
From |
|
A |
B |
C |
D |
E |
F |
A |
|
|
|
|
10 |
2 |
B |
3 |
|
|
|
|
|
C |
|
|
|
|
|
|
D |
|
|
|
|
|
|
E |
|
|
|
|
|
|
F |
|
|
|
|
|
|
|
To |
From |
|
A |
B |
C |
D |
E |
F |
A |
|
|
|
|
10 |
2 |
B |
3 |
|
6 |
|
|
|
C |
|
|
|
|
|
|
D |
|
|
|
|
|
|
E |
|
|
|
|
|
|
F |
|
|
|
|
|
|
|
To |
From |
|
A |
B |
C |
D |
E |
F |
A |
|
|
|
|
10 |
2 |
B |
3 |
|
6 |
|
|
|
C |
|
8 |
|
|
|
|
D |
|
|
|
|
|
|
E |
|
|
|
|
|
|
F |
|
|
|
|
|
|
|
To |
From |
|
A |
B |
C |
D |
E |
F |
A |
|
|
|
|
10 |
2 |
B |
3 |
|
6 |
|
|
|
C |
|
8 |
|
7 |
|
|
D |
|
|
|
|
|
|
E |
|
|
|
|
|
|
F |
|
|
|
|
|
|
|
To |
From |
|
A |
B |
C |
D |
E |
F |
A |
|
|
|
|
10 |
2 |
B |
3 |
|
6 |
|
|
|
C |
|
8 |
|
7 |
|
|
D |
|
|
|
|
4 |
|
E |
|
|
|
|
|
|
F |
|
|
|
|
|
|
|
To |
From |
|
A |
B |
C |
D |
E |
F |
A |
|
|
|
|
10 |
2 |
B |
3 |
|
6 |
|
|
|
C |
|
8 |
|
7 |
|
|
D |
|
|
|
|
4 |
6 |
E |
|
|
|
|
|
|
F |
|
|
|
|
|
|
|
To |
From |
|
A |
B |
C |
D |
E |
F |
A |
|
|
|
|
10 |
2 |
B |
3 |
|
6 |
|
|
|
C |
|
8 |
|
7 |
|
|
D |
|
|
|
|
4 |
6 |
E |
|
|
12 |
|
|
|
F |
|
|
|
|
|
|
|
To |
From |
|
A |
B |
C |
D |
E |
F |
A |
|
|
|
|
10 |
2 |
B |
3 |
|
6 |
|
|
|
C |
|
8 |
|
7 |
|
|
D |
|
|
|
|
4 |
6 |
E |
|
|
12 |
|
|
5 |
F |
|
|
|
|
|
|
|
To |
From |
|
A |
B |
C |
D |
E |
F |
A |
|
|
|
|
10 |
2 |
B |
3 |
|
6 |
|
|
|
C |
|
8 |
|
7 |
|
|
D |
|
|
|
|
4 |
6 |
E |
|
|
12 |
|
|
5 |
F |
|
4 |
|
|
|
|
|
To |
From |
|
A |
B |
C |
D |
E |
F |
A |
- |
- |
- |
- |
10 |
2 |
B |
3 |
- |
6 |
- |
- |
- |
C |
- |
8 |
- |
7 |
- |
- |
D |
- |
- |
- |
- |
4 |
6 |
E |
- |
- |
12 |
- |
- |
5 |
F |
- |
4 |
- |
- |
- |
- |
-
Question 4 of 4
Fill in the table using the directed network below
Fill in cells without values with -
Incorrect
Loaded: 0%
Progress: 0%
0:00
A directed network has edges that only goes one way, meaning each edge’s value is used only once.
First, count the number of edges or connections the network has.
There are a total of 13 edges. Therefore, there will only be 13 values to be entered to the table.
Next, fill up the table using the values of the edges going from a vertex to another, following the given direction.
|
To |
From |
|
A |
B |
C |
D |
E |
F |
A |
|
9 |
|
|
|
|
B |
|
|
|
|
|
|
C |
|
|
|
|
|
|
D |
|
|
|
|
|
|
E |
|
|
|
|
|
|
F |
|
|
|
|
|
|
|
To |
From |
|
A |
B |
C |
D |
E |
F |
A |
|
9 |
|
|
23 |
|
B |
|
|
|
|
|
|
C |
|
|
|
|
|
|
D |
|
|
|
|
|
|
E |
|
|
|
|
|
|
F |
|
|
|
|
|
|
|
To |
From |
|
A |
B |
C |
D |
E |
F |
A |
|
9 |
|
|
23 |
10 |
B |
|
|
|
|
|
|
C |
|
|
|
|
|
|
D |
|
|
|
|
|
|
E |
|
|
|
|
|
|
F |
|
|
|
|
|
|
|
To |
From |
|
A |
B |
C |
D |
E |
F |
A |
|
9 |
|
|
23 |
10 |
B |
8 |
|
|
|
|
|
C |
|
|
|
|
|
|
D |
|
|
|
|
|
|
E |
|
|
|
|
|
|
F |
|
|
|
|
|
|
|
To |
From |
|
A |
B |
C |
D |
E |
F |
A |
|
9 |
|
|
23 |
10 |
B |
8 |
|
|
|
|
15 |
C |
|
|
|
|
|
|
D |
|
|
|
|
|
|
E |
|
|
|
|
|
|
F |
|
|
|
|
|
|
|
To |
From |
|
A |
B |
C |
D |
E |
F |
A |
|
9 |
|
|
23 |
10 |
B |
8 |
|
|
|
|
15 |
C |
|
10 |
|
|
|
|
D |
|
|
|
|
|
|
E |
|
|
|
|
|
|
F |
|
|
|
|
|
|
|
To |
From |
|
A |
B |
C |
D |
E |
F |
A |
|
9 |
|
|
23 |
10 |
B |
8 |
|
|
|
|
15 |
C |
|
10 |
|
5 |
|
|
D |
|
|
|
|
|
|
E |
|
|
|
|
|
|
F |
|
|
|
|
|
|
|
To |
From |
|
A |
B |
C |
D |
E |
F |
A |
|
9 |
|
|
23 |
10 |
B |
8 |
|
|
|
|
15 |
C |
|
10 |
|
5 |
|
|
D |
|
|
|
|
8 |
|
E |
|
|
|
|
|
|
F |
|
|
|
|
|
|
|
To |
From |
|
A |
B |
C |
D |
E |
F |
A |
|
9 |
|
|
23 |
10 |
B |
8 |
|
|
|
|
15 |
C |
|
10 |
|
5 |
|
|
D |
|
|
|
|
8 |
7 |
E |
|
|
|
|
|
|
F |
|
|
|
|
|
|
|
To |
From |
|
A |
B |
C |
D |
E |
F |
A |
|
9 |
|
|
23 |
10 |
B |
8 |
|
|
|
|
15 |
C |
|
10 |
|
5 |
|
|
D |
|
|
|
|
8 |
7 |
E |
|
|
|
6 |
|
|
F |
|
|
|
|
|
|
|
To |
From |
|
A |
B |
C |
D |
E |
F |
A |
|
9 |
|
|
23 |
10 |
B |
8 |
|
|
|
|
15 |
C |
|
10 |
|
5 |
|
|
D |
|
|
|
|
8 |
7 |
E |
|
|
|
6 |
|
9 |
F |
|
|
|
|
|
|
|
To |
From |
|
A |
B |
C |
D |
E |
F |
A |
|
9 |
|
|
23 |
10 |
B |
8 |
|
|
|
|
15 |
C |
|
10 |
|
5 |
|
|
D |
|
|
|
|
8 |
7 |
E |
|
|
|
6 |
|
9 |
F |
|
14 |
|
|
|
|
|
To |
From |
|
A |
B |
C |
D |
E |
F |
A |
|
9 |
|
|
23 |
10 |
B |
8 |
|
|
|
|
15 |
C |
|
10 |
|
5 |
|
|
D |
|
|
|
|
8 |
7 |
E |
|
|
|
6 |
|
9 |
F |
|
14 |
6 |
|
|
|
|
To |
From |
|
A |
B |
C |
D |
E |
F |
A |
- |
9 |
- |
- |
23 |
10 |
B |
8 |
- |
- |
- |
- |
15 |
C |
- |
10 |
- |
5 |
- |
- |
D |
- |
- |
- |
- |
8 |
7 |
E |
- |
- |
- |
6 |
- |
9 |
F |
- |
14 |
6 |
- |
- |
- |