1
GATE CSE 2004
MCQ (Single Correct Answer)
+2
-0.6
Let $$p, q, r$$ and $$s$$ be four primitive statements. Consider the following arguments:

$$P:\left[ {\left( {\neg p \vee q} \right) \wedge \left( {r \to s} \right) \wedge \left( {p \vee r} \right)} \right] \to \left( {\neg s \to q} \right)$$
$$Q:\left[ {\left( {\neg p \wedge q} \right) \wedge \left[ {q \to \left( {p \to r} \right)} \right]} \right] \to \neg r$$
$$R:\left[ {\left[ {\left( {q \wedge r} \right) \to p} \right] \wedge \left( {\neg q \vee p} \right)} \right] \to r$$
$$S:\left[ {p \wedge \left( {p \to r} \right) \wedge \left( {q \vee \neg r} \right)} \right] \to q$$

Which of the above arguments are valid?

A
$$P$$ and $$Q$$ only
B
$$P$$ and $$R$$ only
C
$$P$$ and $$S$$ only
D
$$P, Q, R$$ and $$S$$
2
GATE CSE 2004
MCQ (Single Correct Answer)
+1
-0.3
Let $$a(x,y)$$, $$b(x,y)$$ and $$c(x,y)$$ be three statements with variables $$x$$ and $$y$$ chosen from some universe. Consider the following statement: $$$\left( {\exists x} \right)\left( {\forall y} \right)\left[ {\left( {a\left( {x,\,y} \right) \wedge b\left( {x,\,y} \right)} \right) \wedge \neg c\left( {x,\,y} \right)} \right]$$$

Which one of the following is its equivalent?

A
$$\left( {\forall x} \right)\left( {\exists y} \right)\left[ {\left( {a\left( {x,\,y} \right) \vee b\left( {x,\,y} \right)} \right) \to c\left( {x,\,y} \right)} \right]$$
B
$$\left( {\exists x} \right)\left( {\forall y} \right)\left[ {\left( {a\left( {x,\,y} \right) \vee b\left( {x,\,y} \right)} \right) \wedge \neg c\left( {x,\,y} \right)} \right]$$
C
$$ - \left[ {\left( {\forall x} \right)\left( {\exists y} \right)\left[ {\left( {a\left( {x,\,y} \right) \wedge b\left( {x,\,y} \right)} \right) \to c\left( {x,\,y} \right)} \right]} \right]$$
D
$$ - \left[ {\left( {\forall x} \right)\left( {\exists y} \right)\left[ {\left( {a\left( {x,\,y} \right) \vee b\left( {x,\,y} \right)} \right) \to c\left( {x,\,y} \right)} \right]} \right]$$
3
GATE CSE 2004
MCQ (Single Correct Answer)
+1
-0.3
Identify the correct translation into logical notation of the following assertion.

$$Some\,boys\,in\,the\,class\,are\,taller\,than\,all\,the\,girls$$
Note: taller$$\left( {x,\,y} \right)$$ is true if $$x$$ is taller than $$y$$.

A
$$\left( {\exists x} \right)\left( {boy\left( x \right) \to \left( {\forall y} \right)\left( {girl\left( y \right) \wedge taller\left( {x,y} \right)} \right)} \right)$$
B
$$\left( {\exists x} \right)\left( {boy\left( x \right) \wedge \left( {\forall y} \right)\left( {girl\left( y \right) \wedge taller\left( {x,y} \right)} \right)} \right)$$
C
$$\left( {\exists x} \right)\left( {boy\left( x \right) \to \left( {\forall y} \right)\left( {girl\left( y \right) \to taller\left( {x,y} \right)} \right)} \right)$$
D
$$\left( {\exists x} \right)\left( {boy\left( x \right) \wedge \left( {\forall y} \right)\left( {girl\left( y \right) \to taller\left( {x,y} \right)} \right)} \right)$$
4
GATE CSE 2004
MCQ (Single Correct Answer)
+2
-0.6
Consider a System with a two-level paging scheme in which a regular memory access takes $$150$$ nanoseconds, and servicing a page fault takes $$8$$ milliseconds. An average instruction takes $$100$$ nanoseconds of $$CPU$$ time, and two memory accesses. The $$TLB$$ hit ratio is $$90$$% and the page fault rate is one in every $$10,000$$ instructions. What is the effective average instruction execution time?
A
$$645$$ nanoseconds
B
$$1050$$ nanoseconds
C
$$1215$$ nanoseconds
D
$$1230$$ nanoseconds
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