Computer Science · Complexity Theory
डिटरमिनिस्टिक ट्यूरिंग मशीनों द्वारा पॉलिनोमियल समय (Polynomial time) में हल की जा सकने वाली निर्णय समस्याएं किस जटिलता वर्ग (Complexity class) के अंतर्गत आती हैं?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1EXPTIME क्लास समस्याएं
- 2NP-हार्ड क्लास समस्याएं
- 3P क्लास समस्याएं✓
- 4NP क्लास समस्याएं
सही उत्तर देखें
P क्लास समस्याएं
Download Single Question PDF
Save this question and verified answer as a clean study sheet with live clickable link.
👥
Share with Friends & Study Groups
Challenge your peer aspirants on WhatsApp or Telegram to solve this question!
Online Test Series
Start Free Mock Test →Preparing for Computer Science?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Chapter Practice
Practice Complexity Theory MCQs →Want more practice questions on Complexity Theory?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Complexity Theory