Discrete Mathematics (Counting theory) (I don't get how the 'experts' were not able to answer this. I asked another sub question to this problem and one of you was able to do it flawlessly, I paid for this service...) We want to spread a face-to-face exam among 24 students over three days: Wednesday, Thursday and Friday. An exam schedule is the score with the 3 subsets of students for each day. (Or, equivalently, a function e: {1,2,...,24}→{M, J,V}.) We want to count the possible schedules (=N) under different rules. 3. Suppose we have to cancel the exam on Friday and everyone has to take the test on Wednesday or Thursday. What is the total number of schedules possible? Answer: N=? Hint : Count by people, answer is not 12.5 nor 12.
Discrete Mathematics (Counting theory) (I don't get how the 'experts' were not able to answer this. I asked another sub question to this problem and one of you was able to do it flawlessly, I paid for this service...)
We want to spread a face-to-face exam among 24 students over three days: Wednesday, Thursday and Friday. An exam schedule is the score with the 3 subsets of students for each day. (Or, equivalently, a
3. Suppose we have to cancel the exam on Friday and everyone has to take the test on Wednesday or Thursday. What is the total number of schedules possible? Answer: N=?
Hint : Count by people, answer is not 12.5 nor 12.
Trending now
This is a popular solution!
Step by step
Solved in 2 steps
