1. Home
  2. questions

Filters

Found 3 Questions

Set Default
Exams

List of practice Questions

To prove that a problem $\chi$ in NP is NP-complete, it would be sufficient to show which one of the following to be true?
  • OJEE - 2025
  • OJEE
  • Computer Science & Information Technology
  • Theory of Computations
Which one of the following problems is undecidable?
  • OJEE - 2025
  • OJEE
  • Computer Science & Information Technology
  • Theory of Computations

Consider the grammar $S \rightarrow aSa \mid bSb \mid a \mid b$. Which one of the following options correctly characterizes the language generated by the given grammar over the alphabet {a,b} 
 

  • OJEE - 2025
  • OJEE
  • Computer Science & Information Technology
  • Theory of Computations
contact us
terms & conditions
Privacy & Policy
© 2026 Patronum Web Private Limited