1
GATE CSE 2005
+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$$?
A
$$g$$ is onto $$\Rightarrow$$ $$h$$ is onto
B
$$h$$ is onto $$\Rightarrow$$$$f$$ is onto
C
$$h$$ is onto $$\Rightarrow$$ $$g$$ is onto
D
$$h$$ is onto $$\Rightarrow$$ $$f$$ and $$g$$ are onto
2
GATE CSE 2005
+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: A
not a lattice
B
a lattice but not a distributive lattice
C
a distributive lattice but not a Boolean algebra
D
a Boolean algebra
3
GATE CSE 2004
+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}$$)
A
power $$(2, n)$$
B
power $$\left( {2,\,{n^2}} \right)$$
C
$$\left( {2,\left( {{n^2} + n} \right)/2} \right)$$
D
power $$\left( {2,\left( {{n^2} - n} \right)/2} \right)$$
4
GATE CSE 2004
+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

A
$$\left\{ {\left( {x,y} \right)|y > x\,\,\,and\,\,\,x,y \in \left\{ {0,1,2,.....} \right\}} \right\}$$
B
$$\left\{ {\left( {x,y} \right)|y \ge x\,\,\,and\,\,\,x,y \in \left\{ {0,1,2,.....} \right\}} \right\}$$
C
$$\left\{ {\left( {x,y} \right)|y < x\,\,\,and\,\,\,x,y \in \left\{ {0,1,2,.....} \right\}} \right\}$$
D
$$\left\{ {\left( {x,y} \right)|y \le x\,\,\,and\,\,\,x,y \in \left\{ {0,1,2,.....} \right\}} \right\}$$
GATE CSE Subjects
Discrete Mathematics
Programming Languages
Theory of Computation
Operating Systems
Digital Logic
Computer Organization
Database Management System
Data Structures
Computer Networks
Algorithms
Compiler Design
Software Engineering
Web Technologies
General Aptitude
EXAM MAP
Joint Entrance Examination