-
Due
Sep 8, 2023 by
3:20pm
-
Points
10
-
Submitting
a file upload
-
File Types
pdf
-
Attempts
0
-
Allowed Attempts
1
-
Available
Sep 8, 2023 at 3pm - Sep 8, 2023 at 3:50pm
50 minutes
This assignment was locked Sep 8, 2023 at 3:50pm.
Question 1:
For each part, either draw such a graph or explain why it cannot exist.
a) A forest with 7 vertices and 5 edges
b) A forest with 6 vertices and 6 edges
Question 2:
Let T be a tree. Prove that every edge in T is a bridge.
1694211600
09/08/2023
03:20pm
Rubric
Can't change a rubric once you've started using it.
Title
You've already rated students with this rubric. Any major changes could affect their assessment results.
Title
Criteria |
Ratings |
Pts
|
This criterion is linked to a Learning Outcome
Description of criterion
threshold:
5 pts
|
5
to >0 pts
Full Marks
blank
|
0
to >0 pts
No Marks
blank_2
|
This area will be used by the assessor to leave comments related to this criterion.
|
pts
/
5 pts
--
|
This criterion is linked to a Learning Outcome
Description of criterion
threshold:
5 pts
|
5
to >0 pts
Full Marks
blank
|
0
to >0 pts
No Marks
blank_2
|
This area will be used by the assessor to leave comments related to this criterion.
|
pts
/
5 pts
--
|
Total Points:
5
out of 5
|