info@avatto.com
+91-9920808017
16. The statement, “A TM can’t solve halting problem” is
true
false
still an open question
all of these
Your email address will not be published. Required fields are marked *
Report
Name
Email
Website
Save my name, email, and website in this browser for the next time I comment.
Comment
17. If there exists a TM which when applied to any problem in the class, terminates, if correct answer is yes and may or may not terminate otherwise is called
stable
unsolvable
partially solvable
unstable
18. Given a Turing machine T and a step-counting function f, is the language accepted by T in Time(f) ? This decision problem is
solvable
uncertain
none of these
19. A total recursive function is a
partial recursive function
primitive recursive function
both (A) and (B)
20. The running time T (n), where 'n' is input size of a recursive algorithm, is given as T (n) = c + T (n - 1), if n > 1 = d, if n ≤ 1The order of the algorithm is
n2
n
n3
nn
Login with Facebook
Login with Google
Forgot your password?
Lost your password? Please enter your email address. You will receive mail with link to set new password.
Back to login
