The figure below is a dependency graph representing the course prerequisites in a school. The courses are the nodes, and the requirement relationships are defined by direct links from a course to its prerequisites to be enrolled.
For example, in the figure below:
- Course D has course A as a prerequisite; and
- Course E has courses A and B as prerequisites.
Considering the figure above, mark the following sentences as true (T) or false (F):
- The only node with the highest degree is node M;
- Nodes A, B, and C do not have prerequisites;
- Course G is a prerequisite for course H;
- The incoming degree for course O is 2;
- The outgoing degree for course H is 2;
b) F-T-F-F-T
c) F-F-T-T-T
d) T-T-F-T-F
e) None of above
No comments:
Post a Comment