Help with greedy algortitm please

  • Thread starter Thread starter steve22
  • Start date Start date
Click For Summary
SUMMARY

The discussion revolves around applying a greedy algorithm to minimize timetable clashes for ten students (A-J) who have each selected three modules from a pool of eight. The user seeks assistance in understanding how to effectively implement the greedy algorithm for this specific scheduling problem. Key points include the need for a structured approach to slot subjects while considering student preferences to achieve an optimal solution.

PREREQUISITES
  • Understanding of greedy algorithms and their principles
  • Familiarity with scheduling problems and optimization techniques
  • Basic knowledge of algorithm complexity and efficiency
  • Experience with problem-solving in algorithm design
NEXT STEPS
  • Research "Greedy Algorithm techniques for scheduling problems"
  • Study "Graph theory applications in timetable scheduling"
  • Explore "Algorithm complexity analysis for greedy approaches"
  • Practice "Greedy Algorithm examples in Python" for hands-on experience
USEFUL FOR

Students, educators, and algorithm enthusiasts seeking to understand and apply greedy algorithms in practical scheduling scenarios, particularly in academic settings.

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

Use greedy vertex coloring algorithm to prove the upper bound of χ
  • · Replies 1 ·
Replies
1
Views
3K
Comp Sci Instruction scheduling in multiple-issue RISCV-processor
  • · Replies 7 ·
Replies
7
Views
3K
Engineering Digital Communications: Bit Error Rate (BER), C/N, Constellations
  • · Replies 4 ·
Replies
4
Views
2K
Engineering Dynamics help: Block on a wedge on an incline (frictionless surfaces)
  • · Replies 6 ·
Replies
6
Views
3K
Engineering Please help me make sense of this question in plumbing textbook
  • · Replies 10 ·
Replies
10
Views
3K
Beam boundary condition problem
  • · Replies 12 ·
Replies
12
Views
3K
Optimal Path from source to multiple destinations
  • · Replies 3 ·
Replies
3
Views
2K
Center Selection Problem: Center for a Single Site
  • · Replies 1 ·
Replies
1
Views
1K
Engineering Understanding the dynamic load factor (DLF)
  • · Replies 1 ·
Replies
1
Views
4K
Comp Sci Solve ax+by=GCD(a,b) for RSA Algorithm Cryptography
  • · Replies 2 ·
Replies
2
Views
2K