Time Left - 10:00 mins

ISRO Exam CS 2017 Daily Topic Quiz TOC (RE FA & TM)

Attempt now to get your rank among 581 students!

Question 1

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

Question 2

How many states are there in a minimum state deterministic finite automaton accepting the language L = {w $Description: E:\Gate\isro-cs\ISRO-CS-2014_files\image005.png$ $Description: E:\Gate\isro-cs\ISRO-CS-2014_files\image002.png$ (0,1)*, number of 0's is divisible by 2 and number of 1's is divisible by 5, respectively} ?

Question 3

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 4

Consider the following Deterministic Finite Automaton $M$ .

Let $S$ denote the set of eight bit strings whose second, third, sixth and seventh bits are 1. The number of strings in $S$ that are accepted by $M$ is

Question 5

S –> aSa| bSb| a| b ; The language generated by the above grammar over the alphabet {a, b} is the set of

Question 6

The number of states required by a Finite State Machine, to simulate the behavior of a computer with a memory capable of storing 'm' words, with each word being 'n' bits long is

Question 7

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

Question 8

An FSM (Finite State Machine) can be considered to be a TM (Turing Machine) of finite tape length

Question 9

G = {S →SS, S → ab, S →ba, S → ε}
I. G is ambiguous
II. G produces all strings with equal number of a’s and b’s
III. Language of G can be accepted by a deterministic PDA.
Which combination below expresses all the true statements about G?

Question 10

A problem whose language is recursion is called?

581 attempts
7 upvotes
6 comments

Tags :

GATE & PSU CS Theory of Computation

Apr 2GATE & PSU CS