1

GATE CSE 2004

MCQ (Single Correct Answer)

+2

-0.6

The recurrence equation

$$\,\,\,\,\,\,\,T\left( 1 \right) = 1$$

$$\,\,\,\,\,\,T\left( n \right) = 2T\left( {n - 1} \right) + n,\,n \ge 2$$

evaluates to

$$\,\,\,\,\,\,\,T\left( 1 \right) = 1$$

$$\,\,\,\,\,\,T\left( n \right) = 2T\left( {n - 1} \right) + n,\,n \ge 2$$

evaluates to

2

GATE CSE 2001

MCQ (Single Correct Answer)

+2

-0.6

How many 4 digit even numbers have all 4 digits distinct?

3

GATE CSE 1999

MCQ (Single Correct Answer)

+2

-0.6

Two girls have picked 10 roses, 15 sunflowers and 14 daffodils. What is the number of ways they can divide the flowers among themselves?

4

GATE CSE 1998

MCQ (Single Correct Answer)

+2

-0.6

In a room containing 28 people, there are 18 people who speak English, 15 people who speak Hindi and 22 people who speak Kannada, 9 persons speak both English and Hindi, 11 persons speak both Hindi and Kannada where as 13 persons speak both Kannada and English. How many people speak all three languages?

Questions Asked from Combinatorics (Marks 2)

Number in Brackets after Paper Indicates No. of Questions

GATE CSE 2021 Set 1 (1)
GATE CSE 2020 (1)
GATE CSE 2016 Set 1 (1)
GATE CSE 2014 Set 1 (2)
GATE CSE 2014 Set 2 (1)
GATE CSE 2008 (5)
GATE CSE 2007 (2)
GATE CSE 2006 (3)
GATE CSE 2005 (3)
GATE CSE 2004 (3)
GATE CSE 2001 (1)
GATE CSE 1999 (1)
GATE CSE 1998 (2)
GATE CSE 1996 (1)
GATE CSE 1994 (1)
GATE CSE 1989 (1)
GATE CSE 1988 (1)
GATE CSE 1987 (1)

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