Computer Science and Information Technology
2018 · Paper 1
Take it one question at a time. Try an answer, then check your understanding.
Complete GATE CSE 2018 Paper 1 overview, original pages and practice · Timed previous-paper practice
Questions 16–18 of 65. Imported answers require review unless explicitly marked reviewed.
Question 6
Open questionCSMCQ1 markNeeds review
Let N be an NFA with n states. Let k be the number of states of a minimal DFA which is equivalent to N. Which one of the following is necessarily 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 7
Open questionCSMCQ1 markNeeds review
The set of all recursively enumerable languages 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 8
Open questionCSMCQ1 markNeeds review
Which one of the following statements is FALSE?
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