1
GATE CSE 2020
Numerical
+1
-0
If there are m input lines and n output lines for a decoder that is used to uniquely address a byte addressable 1 KB RAM, then the minimum value of m + n is ____.
Your input ____
2
GATE CSE 2020
MCQ (Single Correct Answer)
+2
-0.67
Which one of the following predicate formulae is NOT logically valid?

Note that W is a predicate formula without any free occurrence of x.
A
$$\forall x$$(p(x) $$ \vee $$ W) $$ \equiv $$ $$\forall x$$ p(x) $$ \vee $$ W
B
$$\exists x$$(p(x) $$ \wedge $$ W) $$ \equiv $$ $$\exists x$$ p(x) $$ \wedge $$ W
C
$$\forall x$$(p(x) $$ \to $$ W) $$ \equiv $$ $$\forall x$$ p(x) $$ \to $$ W
D
$$\exists x$$(p(x) $$ \to $$ W) $$ \equiv $$ $$\exists x$$ p(x) $$ \to $$ W
3
GATE CSE 2020
MCQ (Single Correct Answer)
+2
-0.67
Let A and B be two n$$ \times $$n matrices over real numbers. Let rank(M) and det(M) denote the rank and determinant of a matrix M, respectively. Consider the following statements,

I. rank(AB) = rank(A) rank(B)
II. det(AB) = det(A) det(B)
III. rank(A + B) $$ \le $$ rank(A) + rank(B)
IV. det(A + B) $$ \le $$ det(A) + det(B)

Which of the above statements are TRUE?
A
I and II only
B
II and III only
C
I and IV only
D
III and IV only
4
GATE CSE 2020
Numerical
+2
-0
The number of permutations of the characters in LILAC so that no character appears in its original position, if the two L’s are indistinguishable, is _______.
Your input ____