There are 6 jobs with distinct difficulty levels, and 3 computers with distinct processing speeds. Each job is assigned to a computer such that: - The fastest computer gets the toughest job and the slowest computer gets the easiest job. - Every computer gets at least one job. The number of ways in which this can be done is ______.
The toughest and easiest jobs are fixed. The other 4 jobs go to any of 3 computers, but the middle computer needs at least one: 3^4 - 2^4 = 81 - 16 = 65.
More Discrete Mathematics: Combinatorics (Counting, Recurrence Relations, Generating Functions) questions
GATE 2020 CS Q52– The number of permutations of the characters in LILAC so that no character appears in its…
GATE 2019 CS Q15– Let U=\1,2,,n\. Let A=\(x,X) x X,\ X U\. Consider the following two statements on A . I. A…
GATE 2018 CS Q11– Which one of the following is a closed form expression for the generating function of the…
GATE 2015 CS (CS1) Q45– Let a n represent the number of bit strings of length n containing two consecutive 1s.…
GATE 2016 CS (CS1) Q12– Let a n be the number of n-bit strings that do NOT contain two consecutive 1s. Which one…