Computer Science and Information Technology
2017 · Paper 1
Take it one question at a time. Try an answer, then check your understanding.
Complete GATE CSE 2017 Paper 1 overview, original pages and practice · Timed previous-paper practice
Questions 19–21 of 65. Imported answers require review unless explicitly marked reviewed.
Question 19
Open questionCSNAT1 markNeeds review
Let X be a Gaussian random variable with mean 0 and variance σ². Let Y = max(X, 0) where max(a, b) is the maximum of a and b. The median of Y is __________.
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 20
Open questionCSNAT1 markNeeds review
Let T be a tree with 10 vertices. The sum of the degrees of all the vertices in T is __________.
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 21
Open questionCSNAT1 markNeeds review
Consider the Karnaugh map given below, where X represents “don’t care” and blank represents 0.
Karnaugh map columns labelled
: 00, 01, 11, 10; rows labelled
: 00, 01, 11, 10. Cell values: row 00: blank, X, X, blank; row 01: 1, blank, blank, X; row 11: 1, blank, blank, 1; row 10: blank, X, X, blank. 
Assume for all inputs
, the respective complements
are also available. The above logic is implemented using 2-input NOR gates only. The minimum number of gates required is ____________.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