Homework Help is Here – Start Your Trial Now!
Engineering
Computer Science
We have discussed greedy algorithm during lectures. A greedy algorithm is an algorithm that recursively construct a set of objects from the smallest possible constituent parts. At each one of the iterations, the algorithm takes the best that it can get right now, without regards for future consequences. The algorithm hopes that by choosing a local optimum at each one of the iterations, it can end up at a global optimum. In this assignment, you will write a program to schedule final examination for the examination 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 greedy algorithms that solves a problem with constraints. You will use a greedy algorithm to determine an assignment of classes to examination slots (schedules) such that: 1. No student, enrolled in two subjects, is assigned to the same examination slot (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 the following 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 enrolled o The subject code the student is enrolled in. A sample of an input file is as follow: 3 Melissa, 4 CSCI203 CSCI235 CSC1222 CSCI205 Bernard, 4 CSCI213 CSCI222 CSCI204 CSCI203 Terrence, 4 CSCI212 CSCI203 CSCI235 CSCI213

We have discussed greedy algorithm during lectures. A greedy algorithm is an algorithm that recursively construct a set of objects from the smallest possible constituent parts. At each one of the iterations, the algorithm takes the best that it can get right now, without regards for future consequences. The algorithm hopes that by choosing a local optimum at each one of the iterations, it can end up at a global optimum. In this assignment, you will write a program to schedule final examination for the examination 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 greedy algorithms that solves a problem with constraints. You will use a greedy algorithm to determine an assignment of classes to examination slots (schedules) such that: 1. No student, enrolled in two subjects, is assigned to the same examination slot (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 the following 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 enrolled o The subject code the student is enrolled in. A sample of an input file is as follow: 3 Melissa, 4 CSCI203 CSCI235 CSC1222 CSCI205 Bernard, 4 CSCI213 CSCI222 CSCI204 CSCI203 Terrence, 4 CSCI212 CSCI203 CSCI235 CSCI213

Database System Concepts
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
See similar textbooks
icon
Related questions
Question
File name : A3Data.txt Data Given 5 Belinda, 4 CSCI212 CSCI235 CSCI222 CSCI203 Calvin, 3 CSCI205 CSCI204 CSCI222 Johnathan, 4 CSCI212 CSCI222 CSCI204 CSCI203 Ann, 2 CSCI204 CSCI213 Brandon, 4 CSCI212 CSCI203 CSCI235 CSCI213
We have discussed greedy algorithm during lectures. A greedy algorithm is an algorithm that recursively construct a set of objects from the smallest possible constituent parts. At each one of the iterations, the algorithm takes the best that it can get right now, without regards for future consequences. The algorithm hopes that by choosing a local optimum at each one of the iterations, it can end up at a global optimum. In this assignment, you will write a program to schedule final examination for the examination 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 greedy algorithms that solves a problem with constraints. You will use a greedy algorithm to determine an assignment of classes to examination slots (schedules) such that: 1. No student, enrolled in two subjects, is assigned to the same examination slot (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 the following 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 enrolled o The subject code the student is enrolled in. A sample of an input file is as follow: 3 Melissa, 4 CSCI203 CSCI235 CSCI222 CSCI205 Bernard, 4 CSCI213 CSCI222 CSC1204 CSCI203 Terrence, 4 CSCI212 CSCI203 CSCI235 CSCI213
Transcribed Image Text:We have discussed greedy algorithm during lectures. A greedy algorithm is an algorithm that recursively construct a set of objects from the smallest possible constituent parts. At each one of the iterations, the algorithm takes the best that it can get right now, without regards for future consequences. The algorithm hopes that by choosing a local optimum at each one of the iterations, it can end up at a global optimum. In this assignment, you will write a program to schedule final examination for the examination 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 greedy algorithms that solves a problem with constraints. You will use a greedy algorithm to determine an assignment of classes to examination slots (schedules) such that: 1. No student, enrolled in two subjects, is assigned to the same examination slot (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 the following 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 enrolled o The subject code the student is enrolled in. A sample of an input file is as follow: 3 Melissa, 4 CSCI203 CSCI235 CSCI222 CSCI205 Bernard, 4 CSCI213 CSCI222 CSC1204 CSCI203 Terrence, 4 CSCI212 CSCI203 CSCI235 CSCI213
The output of the program should be a list of time slots with the subjects whose final examination will be given at that slot and the total number of students taking the final examination in that slot. One possible output is as follow: Slot 1: CSCI212, CSCI222 Slot 2: CSC1204, CSCI235 Slot 3: CSCI205, CSCI213 Slot 4: CSCI203 (i) (ii) (iii) (iv) (v) 3 3 3 3 The algorithm: • Read the enrolment information from the input file. As the records are read, build an adjacency matrix representing the relationships among the students and the subject the students enrol in. You should notice that this adjacency matrix is a graph representing the relationships. Each node of the graph will be a subject taken by at least one student in the current semester. An edge between two nodes will mean there is at least one student taking both subjects. The weight of 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 in the graph. This can be achieved by finding an examination schedule satisfying the two constraints mentioned earlier, as follow: (vi) (vii) wwww Construct a candidate list of subjects. Order the subjects in descending order by total number of inconnectivity. 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, add the 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 those already in the time slot. Similarly, if you find one, add the subject to the same slot and remove it from the candidate list. Continue to do so until there is no more un-connected subject can be found. Accumulate the total number of students enrolled from the adjacency matrix. (How can you do that? Give it a thought.) Repeat steps (iii) through (vi) until all the subjects are removed from the candidate list. Note that no pair of time slots can be combined without creating a time conflict with a student. Also note that depending on how you select a subject from the candidate list, there may be different schedule can be formed. Any schedule satisfying the two-mentioned constrained will be acceptable.
Transcribed Image Text:The output of the program should be a list of time slots with the subjects whose final examination will be given at that slot and the total number of students taking the final examination in that slot. One possible output is as follow: Slot 1: CSCI212, CSCI222 Slot 2: CSC1204, CSCI235 Slot 3: CSCI205, CSCI213 Slot 4: CSCI203 (i) (ii) (iii) (iv) (v) 3 3 3 3 The algorithm: • Read the enrolment information from the input file. As the records are read, build an adjacency matrix representing the relationships among the students and the subject the students enrol in. You should notice that this adjacency matrix is a graph representing the relationships. Each node of the graph will be a subject taken by at least one student in the current semester. An edge between two nodes will mean there is at least one student taking both subjects. The weight of 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 in the graph. This can be achieved by finding an examination schedule satisfying the two constraints mentioned earlier, as follow: (vi) (vii) wwww Construct a candidate list of subjects. Order the subjects in descending order by total number of inconnectivity. 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, add the 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 those already in the time slot. Similarly, if you find one, add the subject to the same slot and remove it from the candidate list. Continue to do so until there is no more un-connected subject can be found. Accumulate the total number of students enrolled from the adjacency matrix. (How can you do that? Give it a thought.) Repeat steps (iii) through (vi) until all the subjects are removed from the candidate list. Note that no pair of time slots can be combined without creating a time conflict with a student. Also note that depending on how you select a subject from the candidate list, there may be different schedule can be formed. Any schedule satisfying the two-mentioned constrained will be acceptable.
Expert Solution
steps

Step by step

Solved in 2 steps with 1 images

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Follow-up Questions
Read through expert solutions to related follow-up questions below.
Follow-up Question

I couldn't get the output. 

run: Usage: java -jar ExamScheduler.jar <input_file_path> BUILD SUCCESSFUL (total time: 0 seconds)
Transcribed Image Text:run: Usage: java -jar ExamScheduler.jar <input_file_path> BUILD SUCCESSFUL (total time: 0 seconds)
Solution
Bartleby Expert
SEE SOLUTION
Knowledge Booster
Heuristic Path Algorithm
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education
SEE MORE TEXTBOOKS