Algorithm problem university cse 211

Problem 2: DAGs (Directed Acyclic Graphs) are a very common structure in computer science because many kinds of dependency networks rely on them. Thus Directed Acyclic Graph(DAG) can be used to encode precedence relations or dependencies in a natural way. What is topological sorting? Suppose we have a set of tasks labeled (1,2,...,n} that need to be performed, and there are dependencies among them stipulating, for certain pairs i and j, that i must be performed before j. For example, the tasks may be courses, with prerequisite requirements stating that certain courses must be taken before others. Or the tasks may correspond to a pipeline of computing jobs, with assertions that the output of job i is used in determining the input to job j, and hence job i must be done before job j. We can represent such an interdependent set of tasks by introducing a node for each task, and a directed edge (i, j) whenever i must be done before j. If the precedence relation is to be at all meaningful, the resulting graph G must be a DAG. Now, you are given CSE departments undergrad course prerequisite data(attached below). You have to make a topological ordering Graph from the data. You have to first create the graph from the given input set (make your program read the file automatically). Then from the graph you have just created, sort it using topological sort. Once the topological sorting is done then let the user input the courses they have completed (only the course codes). As an output, print the next 6 possible courses which they might consider to take in next semester. Also, analyze the time and space taken by your algorithm. Attachment link: [login to view URL] Csv file: [login to view URL]