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 6 of 10

Explore more Topics under Formal Languages and Automata Theory

Q51.
A problem X belongs to P complexity class if there exist ________ algorithm to solve that problem, such that the number of steps of the algorithms bounded by a polynomial in n, where n is the length of the input.

a.

1

b.

2

c.

3

d.

all of the mentioned

Discuss
Answer: (d).all of the mentioned
Q52.
Which of the following is a P-complete type of problem?

a.

Circuit Value problem

b.

Linear programming

c.

Context free grammar membership

d.

All of the mentioned

Discuss
Answer: (d).All of the mentioned
Q53.
State true or false?
Statement: Given a turing machine, an input for the machine, and a number T(unary), does that machine halt on that input within the first T-steps?

The given problem is P-complete.

a.

true

b.

false

c.

may be

d.

can't say

Discuss
Answer: (a).true
Q54.
What does NP stands for in complexity classes theory?

a.

Non polynomial

b.

Non-deterministic polynomial

c.

both a and b

d.

None of the mentioned

Discuss
Answer: (b).Non-deterministic polynomial
Q55.
The hardest of NP problems can be:

a.

NP-complete

b.

NP-hard

c.

P

d.

None of the mentioned

Discuss
Answer: (a).NP-complete
Q56.
Which of the following contains NP?

a.

PSPACE

b.

EXPSPACE

c.

both a and b

d.

None of the mentioned

Discuss
Answer: (c).both a and b
Q57.
Travelling sales man problem belongs to which of the class?

a.

P

b.

NP

c.

Linear

d.

None of the mentioned

Discuss
Answer: (b).NP
Q58.
State true or false?
Statement: If a problem X is in NP and a polynomial time algorithm for X could also be used to solve problem Y in polynomial time, then Y is also in NP.

a.

true

b.

false

c.

may be

d.

can't say

Discuss
Answer: (a).true
Q59.
A problem which is both _______ and _________ is said to be NP complete.

a.

NP, P

b.

NP, NP hard

c.

P, P complete

d.

None of the mentioned

Discuss
Answer: (a).NP, P
Q60.
Which of the following is incorrect for the given phrase:

'solvable by non deterministic algorithms in polynomial time'

a.

NP Problems

b.

During control flow, non deterministic algorithm may have more than one choice

c.

If the choices that non deterministic algorithm makes are correct, the amount of time it takes is bounded by polynomial time.

d.

None of the mentioned

Discuss
Answer: (d).None of the mentioned
Page 6 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!

Neural Networks

Dive into the world of Artificial Intelligence with our Neural Networks MCQs. Uncover...

Data Warehousing and OLAP

Strengthen your knowledge of Data Warehousing and OLAP with our specialized MCQs....

Data Science

Discover the fascinating world of extracting insights from data with our Data Science...

HTML

Start your journey in web development with our HTML MCQs. Learn the building blocks...

Data Structures and Algorithms

Journey through the fundamentals of Data Structures and Algorithms with our extensive...

Management Information Systems

Discover how businesses leverage technology with our Management Information Systems...

Formal Languages and Automata Theory

Discover the mathematical models of computation with our Formal Languages and...

Human Computer Interaction

Enhance your knowledge of Human-Computer Interaction with our specialized MCQs....

MATLAB

Hone your computational mathematics skills with our MATLAB MCQs. Understand...