Time Left - 15:00 mins

GATE CS 2021 : Theory of computation Rapid Quiz-2

Attempt now to get your rank among 685 students!

Question 1

To generate the ‘N’ length string from GNF grammar no. of production required?

Question 2

The Greibach normal form grammar for the language L = {an bn+1 | n ≥ 0 } is

Question 3Multiple Correct Options

Select the correct option. [Multiple Select Question]

Question 4

Consider the following problems , which among them can be implemented on a Turing machine :

S1 : Calculating GCD of two numbers

S2 : Copying string

S3 : Predicting the result of tomorrow's cricket match

S4 : Calculating surface area of a given cone dimensions

Question 5

Which of the following problem is undecidable?

Question 6

Which of the following relation is undecidable?
  • 685 attempts
  • 4 upvotes
  • 2 comments
Dec 13GATE & PSU CS

Posted by:

Priya UpadhyayPriya UpadhyayMember since Sep 2020
Priya Upadhyay
Share this quiz   |