Computer Science and Information Technology
GATE CSE year:2017 PYQs
Build your understanding with focused practice from past exam papers.
Questions 61–70 of 130. Imported answers require independent review unless marked reviewed.
Question 31
Open questionCSMCQ2 marksNeeds review
Let
be an
real valued square symmetric matrix of rank 2 with
. Consider the following statements.(I) One eigenvalue must be in
(II) The eigenvalue with the largest magnitude must be strictly greater than 5Which of the above statements about eigenvalues of
is/are necessarily CORRECT?Your answerChoose one option.
Log in to check the answer
You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answerQuestion 31
Open questionCSMCQ2 marksNeeds review
For any discrete random variable
, with probability mass function
,
,
, and
, define the polynomial function
. For a certain discrete random variable
, there exists a scalar
such that
. The expectation of
isYour answerChoose one option.
Log in to check the answer
You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answerQuestion 32
Open questionCSMCQ2 marksNeeds review
A computer network uses polynomials over
for error checking with 8 bits as information bits and uses
as the generator polynomial to generate the check bits. In this network, the message 01011011 is transmitted asYour answerChoose one option.
Log in to check the answer
You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answerQuestion 32
Open questionCSMCQ2 marksNeeds review
Consider the following expression grammar
:E
E − T | TT
T + F | FF
(E) | idWhich of the following grammars is not left recursive, but is equivalent to
?Your answerChoose one option.
Log in to check the answer
You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answerQuestion 33
Open questionCSMCQ2 marksNeeds review
Consider a combination of T and D flip-flops connected as shown below. The output of the D flip-flop is connected to the input of the T flip-flop and the output of the T flip-flop is connected to the input of the D flip-flop.

Initially, both Q₀ and Q₁ are set to 1 (before the 1st clock cycle). The outputs
Your answerChoose one option.
Log in to check the answer
You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answerQuestion 33
Open questionCSMCQ2 marksNeeds review
A system shares 9 tape drives. The current allocation and maximum requirement of tape drives for three processes are shown below:
Process | Current Allocation | Maximum Requirement |
|---|---|---|
P1 | 3 | 7 |
P2 | 1 | 6 |
P3 | 3 | 5 |
Which of the following best describes current state of the system?
Your answerChoose one option.
Log in to check the answer
You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answerQuestion 34
Open questionCSMCQ2 marksNeeds review
If
is a grammar with productions
where
is the start variable, then which one of the following strings is not generated by
?Your answerChoose one option.
Log in to check the answer
You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answerQuestion 34
Open questionCSMCQ2 marksNeeds review
Consider a binary code that consists of only four valid codewords as given below:
00000, 01011, 10101, 11110
Let the minimum Hamming distance of the code be
and the maximum number of erroneous bits that can be corrected by the code be
. Then the values of
and
areYour answerChoose one option.
Log in to check the answer
You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answerQuestion 35
Open questionCSMCQ2 marksNeeds review
Consider the following two functions.
void fun1(int n) {
if(n == 0) return;
printf("%d", n);
fun2(n - 2);
printf("%d", n);
}
void fun2(int n) {
if(n == 0) return;
printf("%d", n);
fun1(++n);
printf("%d", n);
}
The output printed when fun1(5) is called is
Your answerChoose one option.
Log in to check the answer
You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answerQuestion 35
Open questionCSMCQ2 marksNeeds review
Consider two hosts
and
, connected by a single direct link of rate
bits/sec. The distance between the two hosts is 10,000 km and the propagation speed along the link is
m/sec. Host
sends a file of 50,000 bytes as one large message to host
continuously. Let the transmission and propagation delays be
milliseconds and
milliseconds, respectively. Then the values of
and
areYour answerChoose one option.
Log in to check the answer
You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answer