Task Breakdown:

$1.$ Model the course schedule array in a way suitable for the problem.

$2.$ Implement the fitness function that penalizes overlapping courses and

ensures each course is scheduled exactly once.

$3.$ Choose two parents based on random selection for crossover. Show it as a

separate function.

$4.$ Perform single$-$point crossover to create $2$ offspring from each pair of

selected parents. Show it as a separate function.

$5.$ Write the mutation function to introduce random changes.

$6.$ Create a population of randomly generated course schedules.

$7.$ Run genetic algorithms on the population until the highest fitness has been

reached and$/$or the number of maximum iterations has been reached.