11. |
The decision problem is the function from string to _________
|
||||||||
Answer:
Option (c) |
12. |
An algorithm is called efficient if it runs in _________ time on a serial computer.
|
||||||||
Answer:
Option (a) |
13. |
Every recursive language is recursively enumerable
|
||||||||
Answer:
Option (a) |
14. |
If L1 and L2 are both recursively enumerable languages over , then
|
||||||||
Answer:
Option (c) |
15. |
Statement: function f(x, y) = x + y is primitive recursive
|
||||||||
Answer:
Option (a) |
16. |
F: . Then f is computable if and only if f is
|
||||||||
Answer:
Option (b) |
17. |
If L and L' are recursively enumerable, then L is
|
||||||||
Answer:
Option (d) |
18. |
Which of the following is true?
|
||||||||
Answer:
Option (b) |
19. |
Recursive languages are:
|
||||||||
Answer:
Option (c) |