Let x_i be true if course i is in morning slot, false if in afternoon slot. This is the binary choice for each course. Conflict: courses a and b cannot both be in morning. That is the clause NOT x_a OR NOT x_b. Conflict: courses c and d cannot both be in afternoon. That is the clause x_c OR x_d.
Each conflict type gives you one clause with two literals. Build the implication graph from all conflict constraints. Then solve.