1
GATE CSE 1999
Subjective
+5
-0
(a) Show that the formula $$\left[ {\left( { \sim p \vee Q} \right) \Rightarrow \left( {q \Rightarrow p} \right)} \right]$$ is not a tautology.

(b) Let $$A$$ be a tautology and $$B$$ be any other formula. Prove that $$\left( {A \vee B} \right)$$ is a tautology.

2
GATE CSE 1999
MCQ (Single Correct Answer)
+1
-0.3
The number of binary relations on a set with $$n$$ elements is:
A
$${n^2}$$
B
$${2^n}$$
C
$$2{n^2}$$
D
None of the above
3
GATE CSE 1999
MCQ (Single Correct Answer)
+1
-0.3
The number of binary strings of $$n$$ zeros and $$k$$ ones such that no two ones are adjacent is:
A
$${}^{n + 1}{C_k}$$
B
$${}^n{C_k}$$
C
$${}^n{C_{k + 1}}$$
D
None of the above
4
GATE CSE 1999
Subjective
+2
-0

(a) Mr. X claims the following:
If a relation R is both symmetric and transitive, then R is reflexive. For this, Mr. X offers the following proof.

"From xRy, using symmetry we get yRx. Now because R is transitive, xRy and yRx togethrer imply xRx. Therefore, R is reflextive."


Briefly point out the flaw in Mr. X' proof.

(b) Give an example of a relation R which is symmetric and transitive but not reflexive.

EXAM MAP
Medical
NEETAIIMS
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN
Civil Services
UPSC Civil Service
Defence
NDA
Staff Selection Commission
SSC CGL Tier I
CBSE
Class 12