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 _________.
GATE CS 2021 (Forenoon) — Question 29
Discrete MathematicsCombinatorics (Counting Rules, Summation Formulas)NAT1 markHard
A GATE question every morning
One real past-paper question every morning for your branch, answer hidden until you tap. Free on Telegram.
More on Combinatorics (Counting Rules, Summation Formulas)
- GATE CS 2026 (Forenoon) · Q12Consider 4 4 matrices with their elements from \ 0, 1\ . The number of such matrices with even number of 1s in every row and every column is
- GATE CS 2026 (Forenoon) · Q57Let G be an undirected graph, which is a path on 8 vertices. The number of matchings in G is . (answer in integer)
- GATE CS 2025 (Forenoon) · Q30Let S be the set of all ternary strings defined over the alphabet \ a, b, c\ . Consider all strings in S that contain at least one occurren…
- GATE CS 2023 (Forenoon) · Q48Let U = \ 1, 2, , n\ , where n is a large positive integer greater than 1000. Let k be a positive integer less than n . Let A, B be subsets…
- GATE CS 2022 (Forenoon) · Q32The number of arrangements of six identical balls in three identical bins is .
- GATE CS 2021 (Afternoon) · Q60Let S be a set consisting of 10 elements. The number of tuples of the form (A, B) such that A and B are subsets of S and A B is .

