(A) The execution time of 2nd program is more then that of 1st
(B) The execution time of 2nd program is same then that of 1st
(C) Compilation time of 2nd program is more then that of 1st
(D) None of the above
Use of recursion:
(A) enhance logical clarity
(B) make debugging easier
(C) reduces execution time
(D) reduces code size
Consider the FORTRON statment – DOSI=1,10 To recognize DO as a keyword the compilar has to scan:
(A) 5 characters beyond O
(B) 3 characters beyond O
(C) no characters beyond O
(D) 8 characters beyond O
A recursive function f, is defined as follows:
(A) f (n)=2, if n=0
(B) =m, if n=1
(C) =2xf(n-1) + 4fx(2n-2), if n>=2
(D) if the value of f(4) is 88 then the value of m is -1, 0, 2, 1
If the postfix equvilant of the statment if c then x else y is cxy#, then the postfix form amn+mn-ab#ba-#?
(A) Has no syntactically Valid prefix equvilant
(B) is equvilant to if a then if mn then m-n else a-b else b-a
(C) is equvilant to if a then mn then m-n else a-b else b-a
(D) is equvilant to if a then m-n else if m+n then a-b else b-a
The law of diminishing returns applies to:
(A) The short run only.
(B) The long run only.
(C) Both the short and the long run.
(D) Neither the short nor the long run.
Writing total output as Q, change in output as dQ, total labor employment as L, and change in labor employment as dL, the marginal product of labor can be written algebraically as:
(A) dQ d L.
(B) Q / L.
(C) dL / dQ.
(D) dQ / dL.
A function that indicates the maximum output per unit of time that a firm can produce, for every combination of inputs with a given technology, is called:
(A) An isoquant.
(B) A production possibility curve.
(C) A production function.
(D) An isocost function