Help with greedy algortitm please

  • Thread starter Thread starter steve22
  • Start date Start date
AI Thread Summary
The discussion revolves around a homework problem involving the application of a greedy algorithm to minimize timetable clashes for students selecting modules. The user expresses confusion about how to approach the problem and seeks examples or guidance on implementing the algorithm effectively. The specific scenario involves ten students, each choosing three out of eight available modules. The goal is to arrange subjects into slots to reduce conflicts among students' schedules. Assistance is requested to clarify the problem and provide a solution strategy.
steve22
Messages
4
Reaction score
0
help with greedy algortitm please!

Homework Statement



Hi Guys

I have a big problem which is bugging me. Basically the problem is about agreedy algorithm. I have attached the problem which would be similer to what I would get in the exam. I am really confused about the question I would like to get help from anyone please or example of how to solve the problem.

the problem is about

Each of ten students A-J have chosen 3 modules out of eight available as follows:

Discuss how the Greedy Algorithm can be applied to this problem and hence insert subjects into slots in such a way as to minimise the number of students who have a timetable clash. :confused:

Ive attached the problem. I would be very greatful if me anyone can help me with this question it would be very helpful to

Homework Equations





The Attempt at a Solution

 

Attachments

Physics news on Phys.org
Hi Guy

Does anyone know how to do this. Or am I right into thinking this is hard?

Really need help on this guys please
 

Similar threads

Back
Top