We have discussed greedy algorithm during lectures. A greedy algorithm is analgorithm that recursively construct a set of objects from the smallest possibleconstituent parts. At each one of the iterations, the algorithm takes the best that itcan get right now, without regards for future consequences. The algorithm hopesthat by choosing a local optimum at each one of the iterations, it can end up at aglobal optimum.In this assignment, you will write a program to schedule final examination for theexamination department so that no student has two examinations at the same time.The goal of this assignment is to expose you to the implementation of greedyalgorithms that solves a problem with constraints. You will use a greedy algorithmto determine an assignment of classes to examination slots (schedules) such that:1. No student, enrolled in two subjects, is assigned to the same examinationslot (schedule.)2. Any attempt to combine two slots into one would violate rule 1.Input to the program will consist of the name of a data file. This file will contain thefollowing data:The number of students enrolled in the current semester• Repeated rows of the following:o Name of the student and the total number of subjects enrolledo The subject code the student is enrolled in.A sample of an input file is as follow:3Melissa, 4CSCI203CSCI235CSCI222CSCI205Bernard, 4CSCI213CSCI222CSCI204CSCI203Terrence, 4CSCI212CSCI203CSCI235CSCI213 The output of the program should be a list of time slots with the subjects whosefinal examination will be given at that slot and the total number of students takingthe final examination in that slot. One possible output is as follow:Slot 1: CSCI212, CSCI222Slot 2: CSC1204, CSCI235Slot 3: CSCI205, CSCI213Slot 4: CSCI203(i)(ii)(iii)(iv)(v)3333The algorithm:• Read the enrolment information from the input file. As the records are read, buildan adjacency matrix representing the relationships among the students and thesubject the students enrol in. You should notice that this adjacency matrix is agraph representing the relationships. Each node of the graph will be a subjecttaken by at least one student in the current semester. An edge between twonodes will mean there is at least one student taking both subjects. The weightof an edge could be the number of students enrols with both subjects.• Your aim in solving this problem is to construct a maximal independent set inthe graph. This can be achieved by finding an examination schedule satisfyingthe two constraints mentioned earlier, as follow:(vi)(vii)wwwwConstruct a candidate list of subjects.Order the subjects in descending order by total number ofinconnectivity.Starting from the subject with the highest number of inconnectivity,create a slot.Search for a subject to which it is not connected. If you find one, addthe subject to the same slot and remove it from the candidate list.Next, try to find another subject that is not connected to any of thosealready in the time slot. Similarly, if you find one, add the subject tothe same slot and remove it from the candidate list. Continue to do sountil there is no more un-connected subject can be found.Accumulate the total number of students enrolled from the adjacencymatrix. (How can you do that? Give it a thought.)Repeat steps (iii) through (vi) until all the subjects are removed fromthe candidate list.Note that no pair of time slots can be combined without creating a time conflictwith a student. Also note that depending on how you select a subject from thecandidate list, there may be different schedule can be formed. Any schedulesatisfying the two-mentioned constrained will be acceptable.

Question

Accepted Answer

The correct answer for the above mentioned question is given in below steps.