1
GATE CSE 2000
Subjective
+5
-0
Let $$S = \left\{ {0,1,2,3,4,5,6,7} \right\}$$ and $$ \otimes $$ denote multiplication modulo $$8$$, that is, $$x \otimes y = \left( {xy} \right)$$ mod $$8$$

(a) Prove that $$\left( {0,\,1,\, \otimes } \right)$$ is not a group.
(b) Write $$3$$ distinct groups $$\left( {G,\,\, \otimes } \right)$$ where $$G \subset s$$ and $$G$$ has $$2$$ $$\,\,\,\,\,\,$$elements.

2
GATE CSE 2000
MCQ (Single Correct Answer)
+2
-0.6
Let $$a, b, c, d$$ be propositions. Assume that the equivalences $$a \leftrightarrow \left( {b \vee \neg b} \right)$$ and $$b \leftrightarrow c$$ hold. Then the truth value of the formulae $$\left( {a\, \wedge \,b} \right) \to \left( {\left( {a \wedge c} \right) \vee d} \right)$$ is always
A
True
B
False
C
Same as truth value of $$b$$
D
Same as truth value of $$d$$
3
GATE CSE 2000
MCQ (Single Correct Answer)
+2
-0.6
Suppose the time to service a page fault is on the average $$10$$ milliseconds, while a memory access takes $$1$$ microsecond. Then a $$99.99$$% hit ratio results in average memory access time of.
A
$$1.9999$$ milliseconds
B
$$1$$ millisecond
C
$$9.999$$ microseconds
D
$$1.9999$$ microseconds
4
GATE CSE 2000
MCQ (Single Correct Answer)
+2
-0.6
Which of the following is NOT a valid deadlock prevention scheme?
A
Release all resources before requesting a new resource
B
Number the resources uniquely and never request a lower numbered resource than the last one requested.
C
Never request a resource after releasing any resource
D
Request and all required resources be allocated before execution.
EXAM MAP