Problem Statement:

A student needs to do 32 courses during his graduation. There is some dependency among the subjects. He/he is allowed to take only 4 subjects per semester. Name the subjects as you wish and make a dependency graph. Store this graph using adjacency list. Write a program which helps student to determine the order in which he  should take up the courses during his graduation.

Example

For Data Structures course prerequisite is C. This means that the course C should be completed before he can work on data structures.

The commands to run the program:

gcc -c client.c
gcc -c algo.c
gcc client.o algo.o
./a.out