Engineering Mathematics · Combinatorics
Official IIT answer key · IIT Bombay · Audited Aug 2026
GATE CSE 2021 Set 1 Q19 · NAT · 1 mark
Key concept
No account needed
Sit 5 related CombinatoricsPYQs as a guest. We'll score the set and show which traps cost marks — sign in only if you want to save the run.
Topic notes
GATE evaluates Generating Functions by testing the candidate's ability to find closed-form representations of ordinary generating functions (OGFs) for piecewise or parity-dependent sequences. Questions require decomposing sequences linearly and applying operations like substitution (e.g., x2) and differentiation to handle polynomial coefficients. These items test analytical fluency with infinite series and discrete mathematics manipulations.
Full Combinatorics guide →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 …
Topic-wise GATE CS PYQs with verified steps
Independent practice explanation verified by the GateAI team. GATE is conducted by the IITs; question text follows the official paper.
