adplus-dvertising

Welcome to the Undecidability and Intractable Problems MCQs Page

Dive deep into the fascinating world of Undecidability and Intractable Problems with our comprehensive set of Multiple-Choice Questions (MCQs). This page is dedicated to exploring the fundamental concepts and intricacies of Undecidability and Intractable Problems, a crucial aspect of Formal Languages and Automata Theory. In this section, you will encounter a diverse range of MCQs that cover various aspects of Undecidability and Intractable Problems, from the basic principles to advanced topics. Each question is thoughtfully crafted to challenge your knowledge and deepen your understanding of this critical subcategory within Formal Languages and Automata Theory.

frame-decoration

Check out the MCQs below to embark on an enriching journey through Undecidability and Intractable Problems. Test your knowledge, expand your horizons, and solidify your grasp on this vital area of Formal Languages and Automata Theory.

Note: Each MCQ comes with multiple answer choices. Select the most appropriate option and test your understanding of Undecidability and Intractable Problems. You can click on an option to test your knowledge before viewing the solution for a MCQ. Happy learning!

Undecidability and Intractable Problems MCQs | Page 1 of 10

Explore more Topics under Formal Languages and Automata Theory

Q1.
Which of the following are basic complexity classes for a function f:N->N?

a.

Ntime(f)

b.

Nspace(f)

c.

Space(f)

d.

All of the mentioned

Discuss
Answer: (d).All of the mentioned
Q2.
A function f is called __________ if there exists a TM T so that for any n and any input string of length n, T halts in exactly f(n) moves.

a.

Step function

b.

Step counting function

c.

Inplace functions

d.

None of the mentioned

Discuss
Answer: (b).Step counting function
Q3.
Let f: N->N be a step counting function. Then for some constant C, Time(f) is a proper subset of Time(_______)

a.

O(nf)

b.

O(n+f)

c.

O(n^2f^2)

d.

None of the mentioned

Discuss
Answer: (c).O(n^2f^2)
Q4.
Which among the following is false?

If f=O(h) and g=O(k) for f,g,h,k:N->N, then

a.

f+g = O(h+k)

b.

fg = O(hk)

c.

f^g=O(h^k)

d.

None of the mentioned

Discuss
Answer: (c).f^g=O(h^k)
Q5.
Which of the following is not correct for ZPP?

a.

zero error probabalistic polynomial time

b.

it runs in non-polynomial time

c.

it returns an answer yes, no or do not know

d.

none of the mentioned

Discuss
Answer: (b).it runs in non-polynomial time
Q6.
ZPP is based on ________

a.

Probabalistic turing machine

b.

Alternative turing machine

c.

Quantum turing machine

d.

None of the mentioned

Discuss
Answer: (a).Probabalistic turing machine
Q7.
ZPP is exactly equal to the ____________of the classes RP and co-RP.

a.

Union

b.

Intersection

c.

Concatenation

d.

Difference

Discuss
Answer: (b).Intersection
Q8.
Suppose we have a las vegas algorithm C to prove ZPP is contained in RP and co-RP. Run C for double its expected running time.
By Markov’s inequality, the chance that it will answer before we stop is:

a.

1/2

b.

1/4

c.

1/3

d.

none of the mentioned

Discuss
Answer: (a).1/2
Q9.
State true or false:
Statement: ZPP is closed under complement function.

a.

True

b.

False

c.

May be

d.

Can't say

Discuss
Answer: (a).True
Q10.
Which of the following technique is used to find whether a natural language isnt recursive ennumerable?

a.

Diagonalization

b.

Recursive Induction

c.

both a and b

d.

None of the mentioned

Discuss
Answer: (a).Diagonalization
Page 1 of 10

Suggested Topics

Are you eager to expand your knowledge beyond Formal Languages and Automata Theory? We've curated a selection of related categories that you might find intriguing.

Click on the categories below to discover a wealth of MCQs and enrich your understanding of Computer Science. Happy exploring!

Compiler Design

Unravel the process of translating source code into executable programs with our...

C Programming

Master one of the most widely used programming languages with our C Programming MCQs....

JavaScript

Strengthen your web development skills with our JavaScript MCQs. Understand core...

MS Office

Master the suite of productivity tools with our MS Office MCQs. From Word and Excel...

IT Fundamentals

Navigate the basics of information technology with our IT Fundamentals MCQs. Get a...

Microprocessor

Understand the heart of your computer with our Microprocessor MCQs. Topics include...

Systems Analysis and Design Methods

Get familiar with the process of designing and improving business systems with our...

UNIX

Become proficient with the Unix operating system using our UNIX MCQs. Learn about...

DBMS

Get a firm grasp on database systems with our DBMS MCQs. Explore relational...