Ackerman s function is defined on the non-negative integers as follows – McqOptions

MCQOPTIONS

1.	Ackerman s function is defined on the non-negative integers as follows a (m,n) = n+1 if m=0 = a (m-1, 1) if m 0, n=0 = a (m-1, a(m, n-1)) if m 0, n 0 The value of a (1, 3) is
A.	4
B.	5
C.	6
D.	7
Answer» C. 6

Discussion

No Comment Found

Related MCQs

A function in which f(n) is (g(n)), if there exist positive values k and c such that f(n)>=c*g(n), for all n>=k. This notation defines a lower bound for a function f(n):
A real world example of an algorithm would be a___________.
A text is made up of the characters a, b, c, d, e each occurring with the probability .12, .4, .15, .08 and .25 respectively. The optimal coding technique will have the average length of
Ackerman s function is defined on the non-negative integers as follows a (m,n) = n+1 if m=0 = a (m-1, 1) if m 0, n=0 = a (m-1, a(m, n-1)) if m 0, n 0 The value of a (1, 3) is
Algorithms are at the heart of every non-trivial computer application and also a modern and active area of ____________.
An algorithm is
An algorithm is made up of 2 modules M1&M2.; If order of M1 is f(n) & M2 is g(n) then the order of algorithm is?
An algorithm is made up of 2 modules Ml and M2. If order of M1 is f(n) and M2 is g(n) then the order of the algorithm is
An algorithm may have __________ inputs quantities.
An algorithm performs lesser number of operations when the size of input is small, but performs more operations when the size of input gets larger. State if the statement is True or False or Maybe.