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 25–27 of 65. Imported answers require review unless explicitly marked reviewed.
Question 25
Open questionCSNAT1 markNeeds review
The minimum possible number of states of a deterministic finite automaton that accepts the regular language
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 26
Open questionCSMCQ2 marksNeeds review
P and Q are considering to apply for a job. The probability that P applies for the job is
, the probability that P applies for the job given that Q applies for the job is
, and the probability that Q applies for the job given that P applies for the job is
. Then the probability that P does not apply for the job given that Q does not apply for the job 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 27
Open questionCSMCQ2 marksNeeds review
If
are Boolean variables, then which one of the following is INCORRECT?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