Scribd
Upload
5 views1 page

Assignment No 4 2025

The document outlines an assignment for the Theory of Computation course at Maharaja Agrasen Institute of Technology for the academic session 2024-25. It includes various questions related to computational complexity, such as definitions and implications of classes P, NP, NP-complete, and NP-hard, as well as the Cook-Levin Theorem and interactive proof systems. The assignment requires students to demonstrate understanding through definitions, proofs, and examples.

Uploaded by

kashayap211
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
5 views1 page

Assignment No 4 2025

The document outlines an assignment for the Theory of Computation course at Maharaja Agrasen Institute of Technology for the academic session 2024-25. It includes various questions related to computational complexity, such as definitions and implications of classes P, NP, NP-complete, and NP-hard, as well as the Cook-Levin Theorem and interactive proof systems. The assignment requires students to demonstrate understanding through definitions, proofs, and examples.

Uploaded by

kashayap211
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

MAHARAJA AGRASEN INSTITUTE OF

TECHNOLOGY
Department of Computer Science and
Engineering
(Academic Session 2024-25)
Subject Name: Theory of Computation
Subject Code: CIC - 206
Assignment No.-4

Q.1. [CO4] [REMEMBER] Define the class P in computational complexity. Why is it referred
to as the class of tractable problems? [3 marks]

Q.2. [CO4] [REMEMBER, APPLY] Explain the classes NP and co-NP with suitable
examples. Is it known whether NP = co-NP? [4 marks]

Q.3. [CO4] [ANALYZE] Prove that if a problem A is NP-complete and A ∈ P, then P = NP.
What are the implications of this statement? [5 marks]

Q.4. [CO4] [REMEMBER] Define NP-hard and NP-complete problems. Provide two
examples of each. [4 marks]

Q.5. [CO4] [REMEMBER, EVALUATE] State the Cook-Levin Theorem. Prove that SAT is
NP-complete. [7 marks]

Q.6. [CO4] [REMEMBER, CREATE] Define PSPACE and NPSPACE. Show that NPSPACE
= PSPACE using Savitch’s Theorem. [6 marks]

Q.7. [CO4] [REMEMBER] Differentiate between time complexity and space complexity with
appropriate examples. [3 marks]

Q.8. [CO4] [REMEMBER, APPLY] Define BPP (Bounded-error Probabilistic Polynomial-


time). What kind of problems can be solved in BPP? Give examples. [4 marks]

Q.9. [CO4] [REMEMBER] What is the importance of probabilistic computation in complexity


theory? How does it differ from deterministic computation? [3 marks]

Q.10. [CO4] [REMEMBER, CREATE] Describe interactive proof systems. Define the class
IP and explain its relationship with PSPACE. [4 marks]

Q.11. [CO4] [REMEMBER] What is relativized computation? Define oracle machines with
an example. [3 marks]

Q.12. [CO4] [ANALYZE] Can relativization provide a proof for P ≠ NP? Justify your answer
with theoretical explanation. [4 marks]

You might also like