1

GATE CSE 2005

MCQ (Single Correct Answer)

+1

-0.3

Let $$f$$ be a function from a set $$A$$ to a set $$B$$, $$g$$ a function from $$B$$ to $$C$$, and $$h$$ a function from $$A$$ to $$C$$, such that $$h\left( a \right) = g\left( {f\left( a \right)} \right)$$ for all $$a \in A$$. Which of the following statements is always true for all such functions $$f$$ and $$g$$?

2

GATE CSE 2005

MCQ (Single Correct Answer)

+1

-0.3

The following is the Hasse diagram of the poset $$\left[ {\left\{ {a,b,c,d,e} \right\}, \prec } \right]$$

The poset is:

3

GATE CSE 2004

MCQ (Single Correct Answer)

+1

-0.3

The number of different $$n$$ $$x$$ $$n$$ symmetric matrices with each elements being either $$0$$ or $$1$$ is (Note: power ($$2,$$ $$x$$) is same as $${2^x}$$)

4

GATE CSE 2004

MCQ (Single Correct Answer)

+1

-0.3

Consider the binary relation: $$S = \left\{ {\left( {x,y} \right)|y = x + 1\,\,and\,\,x,y \in \left\{ {0,1,2,...} \right\}} \right\}$$

The reflexive transitive closure of $$S$$ is

Questions Asked from Set Theory & Algebra (Marks 1)

Number in Brackets after Paper Indicates No. of Questions

GATE CSE 2020 (2)
GATE CSE 2019 (2)
GATE CSE 2015 Set 3 (1)
GATE CSE 2015 Set 2 (2)
GATE CSE 2015 Set 1 (1)
GATE CSE 2014 Set 3 (1)
GATE CSE 2013 (2)
GATE CSE 2010 (2)
GATE CSE 2009 (2)
GATE CSE 2008 (1)
GATE CSE 2007 (2)
GATE CSE 2006 (4)
GATE CSE 2005 (4)
GATE CSE 2004 (3)
GATE CSE 2001 (1)
GATE CSE 1999 (1)
GATE CSE 1998 (3)
GATE CSE 1997 (1)
GATE CSE 1996 (4)
GATE CSE 1995 (2)
GATE CSE 1993 (2)
GATE CSE 1987 (2)

GATE CSE Subjects

Discrete Mathematics

Programming Languages

Theory of Computation

Operating Systems

Computer Organization

Database Management System

Data Structures

Computer Networks

Algorithms

Compiler Design

Software Engineering

Web Technologies

General Aptitude