Automata Theory

DOWNLOAD FREE PDF <<CLICK HERE>>

Automata theory GATE NET

Congratulations - you have completed Automata theory GATE NET.

You scored %%SCORE%% out of %%TOTAL%%.

Your performance has been rated as %%RATING%%


Your answers are highlighted below.
Question 1 [CLICK ON ANY CHOICE TO KNOW MCQ multiple objective type questions RIGHT ANSWER]
A turing machine that is able to simulate other turing machines:

A
Nested Turing machines
B
Universal Turing machine
C
Counter machine
D
None of the mentioned
Question 2 [CLICK ON ANY CHOICE TO KNOW MCQ multiple objective type questions RIGHT ANSWER]
The modern Turing test to tell computers and humans apart, is commonly abbreviated as .....

Automata theory MCQ
A
APTCHA
B
PACTCHA
C
CAPTCHA
D
CACPHAT
Question 3 [CLICK ON ANY CHOICE TO KNOW MCQ multiple objective type questions RIGHT ANSWER]
Which one of the following statements is FALSE?

A
Context-free grammar can be used to specify both lexical and syntax rules.
B
Type checking is done before parsing.
C
High-level language programs can be translated to different Intermediate Representations.
D
Arguments to a function can be passed using the program stack.
Question 4 [CLICK ON ANY CHOICE TO KNOW MCQ multiple objective type questions RIGHT ANSWER]
What imaginary machine did Turing think of?

A
The Universal Turing Machine
B
The Albert Einstein Machine
C
The University Turning Machine
D
The Magic Math Machine
Question 5 [CLICK ON ANY CHOICE TO KNOW MCQ multiple objective type questions RIGHT ANSWER]
A DPDA is a PDA in which:

A
No state p has two outgoing transitions
B
More than one state can have two or more outgoing transitions
C
Atleast one state has more than one transitions
D
None of the mentioned
Once you are finished, click the button below. Any items you have not completed will be marked incorrect. Get Results
There are 5 questions to complete.

DOWNLOAD FREE PDF <<CLICK HERE>>