Time Left - 10:00 mins

ISRO 2018: TOC Booster Quiz- 2

Attempt now to get your rank among 971 students!

Question 1

What is the best suitable type that can be assigned to this following grammar:
S→Aa, A→Ba, B→abc

Question 2

What is the number of steps required to derive the string ((() ()) ()) for the following grammar.
S $Description: E:\Gate\isro-cs\ISRO-CS-2014_files\image001.png$ SS
S $Description: E:\Gate\isro-cs\ISRO-CS-2014_files\image001.png$ (S)
S $Description: E:\Gate\isro-cs\ISRO-CS-2014_files\image001.png$ $Description: E:\Gate\isro-cs\ISRO-CS-2014_files\image002.png$

Question 3

The following Finite Automation recognizes which language?
$Description: E:\Gate\isro-cs\ISRO-CS-2014_files\image017.png$

Question 4

Let L={w ∈ (0 + 1)*|w has even number of 1s}, i.e. L is the set of all bit strings with even number of 1s. Which one of the regular expression below represents L?

Question 5

What are the final states of the DFA generated from the following NFA?

$Description: E:\Gate\isro-cs\ISRO_CS_2013_files\image020.png$

Question 6

Which of the following is FALSE with respect to possible outcomes of executing a Turing Machine over a given input?

Question 7

If L and L’ are recursively enumerable, then L is

Question 8

Which of the following sentences can be generated by
S -> aS l bA
A -> d l cA

971 attempts
4 upvotes
7 comments

Tags :

GATE & PSU CS Theory of Computation

Apr 2GATE & PSU CS