Question: Suppose a CS program consists of n courses. The prerequisite graph G has a vertex for each course, and an edge from course v to
Suppose a CS program consists of n courses. The prerequisite graph G has a vertex for each course, and an edge from course v to course w if and only if v is a prerequisite for w Design a lineartime algorithm that works directly with this graph representation and computes the minimum number of semesters necessary to complete the program, assuming that a student can take any number of courses in one semester.
Be sure to prove the correctness of your algorithm and its running time.
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
