Computer Science and Information Technology
2017 · Paper 2
Take it one question at a time. Try an answer, then check your understanding.
Complete GATE CSE 2017 Paper 2 overview, original pages and practice · Timed previous-paper practice
Questions 31–33 of 65. Imported answers require review unless explicitly marked reviewed.
Question 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
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
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 answer