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:
Nested Turing machines | |
Universal Turing machine | |
Counter machine | |
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 ..... 
APTCHA | |
PACTCHA | |
CAPTCHA | |
CACPHAT |
Question 3 [CLICK ON ANY CHOICE TO KNOW MCQ multiple objective type questions RIGHT ANSWER] |
Which one of the following statements is FALSE?
Context-free grammar can be used to specify both lexical and syntax rules. | |
Type checking is done before parsing. | |
High-level language programs can be translated to different Intermediate Representations. | |
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?
The Universal Turing Machine | |
The Albert Einstein Machine | |
The University Turning Machine | |
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:
No state p has two outgoing transitions | |
More than one state can have two or more outgoing transitions | |
Atleast one state has more than one transitions | |
None of the mentioned |
Once you are finished, click the button below. Any items you have not completed will be marked incorrect.
There are 5 questions to complete.