JAVA :In this project, you are asked to generate a list of courses for the entering Information Technology majors, following the new AY 2018/2019 Catalog so that they will take these courses in an appropriate order, i.e., when they get to a course, all the prerequisites have been taken 1. This might be a component of an advisory web page. To complete this project, you might want to go through the following steps: 1. Download a digital copy of Prerequisite structures for Information Technology (Academic Year 20182019) from the course page, and define the following prerequisite graph, G(C, P) : C = {c|c is a required course 2 for a CS student} P = {(c1, c2)|c1 is a prerequisite of c2} Thus, e.g., CS2381, CS3720, CS4140 ? C(G), and (CS2381, CS4140), (CS3720, CS4140) ? E(G). 2. Represent the graph G(C, P), defined in Step 1, as an adjacency list (Cf. Page 20 of the lecture notes on Graph basics). 3. Go through the DFS part of the notes, starting with page 29, understand the algorithm as shown in page 32 and the demo example in page 31. Although we discussed a topological sorting algorithm in a class; another DFS based topological sort algorithm is discussed in Section 22.4 of the textbook as follows: Let G(V, E) be an acyclic directed graph, Topological-Sort(G) 1. Call DFS(G) to compute its finishing time, f[v], for every vertex v. 2. For each vertex v, when its f[v] value is calculated, insert this vertex v in the front end of a linked list 3. Return the linked list of vertices, which gives the topological sort of V. The correctness of the above algorithm is given in Theorem 22.12, essentially, In an acyclic directed graph G(V, E), (u, v) ? E iff f[v]

Classes:

for the page numbers: https://www.eecs.yorku.ca/~jeff/AIMS/introduction-to-algorithms-3rd-edition.pdf

C S201? C 220CS CS365? CS3 /20S4406 2 CI 13?12 3572 CS45 26 AlL CS2oot +Cs 2000 CS460 C S201? C 220CS CS365? CS3 /20S4406 2 CI 13?12 3572 CS45 26 AlL CS2oot +Cs 2000 CS460