GATE 2018 Solved Paper CS: Set – 1 | lix

As P is a 2 × 2 matrix, if the two eigen values of P are distinct, Question Number: 28 Question Type: MCQ
then P should have two linearly independent eigen vectors. Consider the first-order logic sentence
So, P has a repeated eigen value j = ∃ s ∃ t ∃ u∀v∀w∀x∀yψ( s, t , u, v, w, x, y )
Hence, statement (II) is correct. where ψ( s, t , u, v, w, x, y ) is a quantifier-free first-order
A 2 × 2 matrix is diagonalizable if and only if it has two logic formula using only predicate symbols, and possibly
linearly independent eigen vectors. equality, but no function symbols. Suppose ϕ has a model
But P has only one linearly independent eigen vector. with a universe containing 7 elements.
Hence P is not diagonalizable. Which one of the following statements is necessarily true?
So, statement (III) is correct. (A) There exists at least one model of ϕ with universe
P need not be a singular matrix. of size less than or equal to 3.
(B) There exists no model of ϕ with universe of size
So, statement (I) is not correct.
less than or equal to 3.
∴ Only statements (II) and (III) are necessarily correct. (C) There exists no model of ϕ with universe of size
Hence, the correct option is (D). greater than 7.
Question Number: 27 Question Type: MCQ (D) Every model of ϕ has a universe of size equal to 7.
Let N be the set of natural numbers. Consider the following Solution: There exists atleast one model of ϕ with universe
sets. of size less than or equal to 3.
P: Set of Rational numbers (positive and negative) Hence, the correct option is (A).
Q: Set of functions from {0, 1} to N Question Number: 29 Question Type: MCQ
R: Set of functions from N to {0, 1}
Consider the following C program:
S: Set of finite subsets of N.
#include<stdio.h>
Which of the sets above are countable?
void fun1 (char *s1, char * s2) {
(A) Q and S only (B) P and S only
char *tmp;
(C) P and R only (D) P, Q and S only
tmp = s1;
Solution: We know that the set of rational numbers is
countable. So, P is countable. s1 = s2
s2 = tmp;
Q: set of functions from {0, 1} to N.
As 0 can be mapped to a number in N ways and }
1 can be mapped to a number in N ways, void fun2 (char **s1, char **s2) {
The number of elements in the set of functions char *tmp;
from {0, 1} to N tmp = *s1;
= The number of elements in the Cartesian product *s1 = *s2;
N×N *s2 = tmp;
We know that the Cartesian product of two count- }
able sets is countable. int main () {
As N is countable, N × N is countable char *str1 = “Hi”, *str2 = “Bye”;
So, Q is countable. fun1 (str1, str2);
R: Set of functions from N to { 0, 1} printf (“%s %s “, str1, str2);
In a function from N to {0, 1}, fun2 (&str1, &str2);
Every element of N is mapped to 0 or 1
printf (“%s %s”, str1, str2);
So, the number of ways of mapping any element of
return 0;
N is 2.
}
∴ The number or elements in the set of functions
from N to {0, 1} The output of the program above is:
= The number of elements in the power set of N (A) Hi Bye Bye Hi (B) Hi Bye Hi Bye
But the power set of N is uncountable because the (C) Bye Hi Hi Bye (D) Bye Hi Bye Hi
power set of a infinite countable set is uncountable. Solution:
So R is uncountable.
S: Set of finite subsets of N. 100 H i 10
As we are considering only the finite subsets of N, Str 1 100
S is a countably infinite set.
So, only P, Q and S are countable. 200 B y e 10
Hence, the correct option is (D). Str 2 200

GATE_CSIT-2018.indd 59 5/2/2018 3:33:26 PM