www.ThinkITI.com

Home
MCQ
Search
Free Apps
Important
Study Groups
Contact Us
Policy

Home
MCQ
Objective Questions
Engineering
Computer Science
Computer Science Set-1
Theory of Computation
61

Theory of Computation MCQ with Answers

61) What is the highest type number which can be applied to the following grammar ?
S —> Aa, A —> Ba, B —> abc

Type 0

Type 1

Type 2

Type 3

Answer is:

Type 2

Theory of Computation MCQ with Answers

For more MCQ's Click Here

Related Theory of Computation MCQ with Answers

62) Following syntax-directed translation scheme is used with a shift reduction (bottom up) parser that perform the action in braces immediately after a reduction by the corresponding production
A —> aB {print “(1)” A —>c {print “1”),
B —> Ab {print *2”}. When parser is aaacbbb, then string printed

202021

1202020

1020202

none of these

Answer is:

202021

63) Which of the following is complement of a?

Recursive language is recursive

Recursively enumerable language is recursively enumerable

Recursive language is either recursive or recursively enumerable

None of these

Answer is:

Recursive language is either recursive or recursively enumerable

64) If nL can be recognized by a multitape TM with time complexity f, then L can be recognized by a one-tape machine with time complexity DSD

O(f2)

o( f2)

o(h)

O(h2)

Answer is:

O(f2)

65) If T is a TM recognizing L, and T reads every symbol in the input string, τT(n) ≥ 2n + 2, then any language that can be accepted by a TM T with τT(n) = 2n + 2 is

regular

not regular

uncertain

none of these

Answer is:

uncertain

Theory of Computation MCQ with Answers

For more MCQ's Click Here