1. |
Recursive languages are also known as:
|
||||||||
Answer:
Option (b) |
2. |
Which of the following set of computable functions are decidable?
|
||||||||
Answer:
Option (d) |
3. |
Bounded minimalization is a technique for:
|
||||||||
Answer:
Option (c) |
4. |
If there exists a language L, for which there exists a TM, T, that accepts every word in L and either rejects or loops for every word that is not in L, is called
|
||||||||
Answer:
Option (b) |
5. |
Which of the following problems is solvable?
|
||||||||
Answer:
Option (d) |
6. |
The statement, “A TM can’t solve halting problem” is
|
||||||||
Answer:
Option (a) |
7. |
Which of the following statement(s) is/are correct?
|
||||||||
Answer:
Option (d) |
8. |
Which of the following is not primitive recursive but partially recursive?
|
||||||||
Answer:
Option (c) |
9. |
Set of recursively enumerable language is closed under union
|
||||||||
Answer:
Option (a) |
10. |
A formal language is recursive if :
|
||||||||
Answer:
Option (d) |