1

GATE CSE 2003

MCQ (Single Correct Answer)

+1

-0.3

Let $$A$$ be a sequence of $$8$$ distinct integers sorted in ascending order. How many distinct pairs of sequence, $$B$$ and $$C$$ are there such that

i) Each is sorted in ascending order.

ii) $$B$$ has $$5$$ and $$C$$ has $$3$$ elements, and

iii) The result of merging $$B$$ $$C$$ gives $$A$$?

i) Each is sorted in ascending order.

ii) $$B$$ has $$5$$ and $$C$$ has $$3$$ elements, and

iii) The result of merging $$B$$ $$C$$ gives $$A$$?

2

GATE CSE 2003

MCQ (Single Correct Answer)

+1

-0.3

$$n$$ couples are invited to a party with the condition that every husband should be accompanied by his wife. However, a wife need not be accompanied by her husband. The number of different gatherings possible at the party is

3

GATE CSE 2003

MCQ (Single Correct Answer)

+1

-0.3

$$m$$ identical balls are to be placed in $$n$$ distinct bags. You are given that $$m \ge kn$$, where $$k$$ is a natural number $$ \ge 1$$. In how many ways can the balls be placed in the bags if each bag must contain at least $$k$$ balls?

4

GATE CSE 2002

MCQ (Single Correct Answer)

+1

-0.3

The minimum number of colors required to color the vertices of a cycle with $$n$$ nodes in such a way that no two adjacent nodes have the same colour is:

Questions Asked from Combinatorics (Marks 1)

Number in Brackets after Paper Indicates No. of Questions

GATE CSE Subjects

Theory of Computation

Operating Systems

Algorithms

Database Management System

Data Structures

Computer Networks

Software Engineering

Compiler Design

Web Technologies

General Aptitude

Discrete Mathematics

Programming Languages