Computer Science and Information Technology
GATE CSE branch:cs PYQs
Build your understanding with focused practice from past exam papers.
Questions 731–740 of 975. Imported answers require independent review unless marked reviewed.
Question 6
Open questionCSMCQ1 markNeeds review
Which one of the following is NOT a valid identity?
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 7
Open questionCSMCQ1 markNeeds review
If
is a regular language over
, which one of the following languages is NOT regular?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 8
Open questionCSMCQ1 markNeeds review
Consider
, where X, Y and Z are all in sign-magnitude form. X and Y are each represented in
bits. To avoid overflow, the representation of Z would require a minimum of: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 9
Open questionCSMCQ1 markNeeds review
Let
be a square matrix. Consider the following two statements on
.
I.
is invertible.
II. Determinant of
is non-zero.Which one of the following is TRUE?
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 10
Open questionCSMCQ1 markNeeds review
Let
be an arbitrary group. Consider the following relations on
:
:
if and only if
such that
:
if and only if
Which of the above is/are equivalence relation/relations?
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 11
Open questionCSMCQ1 markNeeds review
Consider the following two statements about database transaction schedules:
I. Strict two-phase locking protocol generates conflict serializable schedules that are also recoverable.
II. Timestamp-ordering concurrency control protocol with Thomas’ Write Rule can generate view serializable schedules that are not conflict serializable.
Which of the above statements is/are TRUE?
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 12
Open questionCSMCQ1 markNeeds review
Let
be an undirected complete graph on
vertices, where
. Then the number of different Hamiltonian cycles in
is equal toYour 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 13
Open questionCSMCQ1 markNeeds review
Compute
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 14
Open questionCSMCQ1 markNeeds review
Which one of the following statements is NOT correct about the B+ tree data structure used for creating an index of a relational database table?
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 15
Open questionCSMCQ1 markNeeds review
For
, let us consider the regular language
. Which one of the following can be a pumping length (the constant guaranteed by the pumping lemma) for
?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 answer