2. Which of the following recursive functions, written in a fictitious language, are tail recursive? Select all that are A. function f(n) ifn<2 else f(n-1) + f(n-2) end If m=0 else B. function g(m...

Question

Question

2. Which of the following recursive functions, written in a fictitious language, are tail recursive? Select all that are A. f

engineering Computer-Science

Add a comment Improve this question Transcribed image text

Answer 1

Answer #1

In Regular recursion result of each call is pushed onto the stack frame and after the last recursion we get the result. In case of tail recursion we get result from each call i.e. we need not push result of each call to frame for future calculations.

option B is tail recursive

Add a comment

Answer 2

Similar Homework Help Questions

Consider the following function, select all the function and apply which one is f= 0(g), f=...

Consider the following function, select all the function and apply which one is f= 0(g), f= omega g & f = theta g. Explain it each and every step. f = n! g = 2^n f=(log n)^3 g = n f= 5^n/2 g =2^n f=logn! g= nlog n f=3^(n+1) g= 5^n f=n! g= 2^n f=2^n g= 2^n/2 f=2n+logn g = n+(logn)^2 f=nsqrt(n) g= 5^(log_2 (n))
Please all thank you Exercise 25: Let f 0,R be defined by f(x)-1/n, m, with m,nENand n is the minimal n such that m/n a) Show that L(f, P)0 for all partitions P of [0, 1] b) Let mE N. Show that t...

Please all thank you Exercise 25: Let f 0,R be defined by f(x)-1/n, m, with m,nENand n is the minimal n such that m/n a) Show that L(f, P)0 for all partitions P of [0, 1] b) Let mE N. Show that the cardinality of the set A bounded by m(m1)/2. e [0, 1]: f(x) > 1/m) is c) Given m E N construct a partition P such that U(f, Pm)2/m. d) Show that f is integrable and compute Jo...
Problem 2. Let C[0, 1] be the set of all continuous functions from [0, 1] to R. For any f, g є Cl...

Problem 2. Let C[0, 1] be the set of all continuous functions from [0, 1] to R. For any f, g є Cl0, 11 define - max f(x) - g(z) and di(f,g)-If(x) - g(x)d. a) Prove that for any n 2 1, one can find n points in C[O, 1 such that, in daup metric, the distance between any two points is equai to 1. b) Can one find 100 points in C[0, 1] such that, in di metric, the...

Problem 2. Let C[0, 1] be the set of all continuous functions from [0, 1] to R. For any f, g є Cl...

I do not need the two metrics to be proved (that they are a metric). Problem 2. Let C[0, 1] be the set of all continuous functions from [0, 1] to R. For any f, g є Cl0, 11 define - max f(x) - g(z) and di(f,g)-If(x) - g(x)d. a) Prove that for any n 2 1, one can find n points in C[O, 1 such that, in daup metric, the distance between any two points is equai to 1....
= x-2 2x+1 Given the functions f(x) = x²+x-1, and g(x) x2 +5x+6 a. Which function...

= x-2 2x+1 Given the functions f(x) = x²+x-1, and g(x) x2 +5x+6 a. Which function has an oblique asymptote? [10] b. Determine the equation and end behavior of the oblique asymptote. [3A]
LANGUAGE IS C++ Lab Ch14 Recursion In this lab, you are provided with startup code which...

LANGUAGE IS C++ Lab Ch14 Recursion In this lab, you are provided with startup code which has six working functions that use looping (for, while, or do loops) to repeat the same set of statements multiple times. You will create six equivalent functions that use recursion instead of looping. Although looping and recursion can be interchanged, for many problems, recursion is easier and more elegant. Like loops, recursion must ALWAYS contain a condition; otherwise, you have an infinite recursion (or...

17. Given the following definition of function £, what does the expression "t (1: 2: 3]::" return? let rec f listl match listl with 1 I head::rest -> head f resti b. 6 c. 120 d. 123 456...

17. Given the following definition of function £, what does the expression "t (1: 2: 3]::" return? let rec f listl match listl with 1 I head::rest -> head f resti b. 6 c. 120 d. 123 456 e. g. 14; 5; 6] h. (6; 5; 4] i. Error message j. None of the above 18. Which of the following is the correct meaning of the C declaration "double (*a [n]) "? a is an array of n pointers to...
17. Which alkane appears to have two equivalent n-propyl branches in its structure? Select all that...

17. Which alkane appears to have two equivalent n-propyl branches in its structure? Select all that apply. a. octane b. 2-methylheptane c. 3-methylheptane d. 4-methylheptane e. 2,3-dimethylhexane f. 2,4-dimethylhexane g. 2,5-dimethylhexane h. 3,4-dimethylhexane i. 2,2-dimethylhexane j. 3,3-dimethylhexane k. 3-ethylhexane l. 2,3,4-trimethylpentane m. 2,2,3-trimethylpentane n. 2,3,3-trimethylpentane o. 2,2,4-trimethylpentane p. 3-ethyl-2-methylpentane q. 3-ethyl-3-methylpentane r. 2,2,3,3-tetramethylbutane
2 Functions a. A function f : A-B is called injective or one-to-one if whenever f(x)-f(y) for some x, y E A then x = y. That is Vz, y A f(x) = f(y) → x = y. Which of the following functions are injec...

2 Functions a. A function f : A-B is called injective or one-to-one if whenever f(x)-f(y) for some x, y E A then x = y. That is Vz, y A f(x) = f(y) → x = y. Which of the following functions are injective? In each case explain why or why not i. f:Z-Z given by f() 3r +7 (1 mark ii. f which maps a QUT student number to the last name of the student with that student...

1) Name each of the following organic compounds: (a-b-c-e-f-g-j-k-I-m-n) a) CH3CH2CH2CH3 j) CH3CHBOCHBrCH3 b) CH3CH2CH2C(CH3)3 c)...

1) Name each of the following organic compounds: (a-b-c-e-f-g-j-k-I-m-n) a) CH3CH2CH2CH3 j) CH3CHBOCHBrCH3 b) CH3CH2CH2C(CH3)3 c) CH2=CHCH2CH2CH3 d) CH3CHCICH(CH3)2 k) CH2BrCH(CH3)CHCICH2CH3 1) CH2CH(OH)CH(CH3)2 m) (CH3)2CHCHO n) CH3CH2CH2COCH3 e) (CH3)2C(OH)CH2CH3 f) CH3CHO o) (CH3)2CHCOOH p) CH3CH2CN g) CH3CH2COCH2CH3 h) CH3CH2COOH 9) CH3CHBCH(OH)CH3 i) CH3CH(OH)CH2CHO r) CH3COCH(CH3)CHBCH3

2. Which of the following recursive functions, written in a fictitious language, are tail recursive? Select all that are A. function f(n) ifn<2 else f(n-1) + f(n-2) end If m=0 else B. function g(m...

Homework Answers

Add Answer to:
2. Which of the following recursive functions, written in a fictitious language, are tail recursive? Select all that are A. function f(n) ifn<2 else f(n-1) + f(n-2) end If m=0 else B. function g(m...

Post as a guest

Earn Coins

Consider the following function, select all the function and apply which one is f= 0(g), f=...

Please all thank you Exercise 25: Let f 0,R be defined by f(x)-1/n, m, with m,nENand n is the minimal n such that m/n a) Show that L(f, P)0 for all partitions P of [0, 1] b) Let mE N. Show that t...

Problem 2. Let C[0, 1] be the set of all continuous functions from [0, 1] to R. For any f, g є Cl...

Problem 2. Let C[0, 1] be the set of all continuous functions from [0, 1] to R. For any f, g є Cl...

= x-2 2x+1 Given the functions f(x) = x²+x-1, and g(x) x2 +5x+6 a. Which function...

LANGUAGE IS C++ Lab Ch14 Recursion In this lab, you are provided with startup code which...

17. Given the following definition of function £, what does the expression "t (1: 2: 3]::" return? let rec f listl match listl with 1 I head::rest -> head f resti b. 6 c. 120 d. 123 456...

17. Which alkane appears to have two equivalent n-propyl branches in its structure? Select all that...

2 Functions a. A function f : A-B is called injective or one-to-one if whenever f(x)-f(y) for some x, y E A then x = y. That is Vz, y A f(x) = f(y) → x = y. Which of the following functions are injec...

1) Name each of the following organic compounds: (a-b-c-e-f-g-j-k-I-m-n) a) CH3CH2CH2CH3 j) CH3CHBOCHBrCH3 b) CH3CH2CH2C(CH3)3 c)...

2. Which of the following recursive functions, written in a fictitious language, are tail recursive? Select all that are A. function f(n) ifn<2 else f(n-1) + f(n-2) end If m=0 else B. function g(m...

Homework Answers

Add Answer to: 2. Which of the following recursive functions, written in a fictitious language, are tail recursive? Select all that are A. function f(n) ifn<2 else f(n-1) + f(n-2) end If m=0 else B. function g(m...

Post as a guest

Earn Coins

Add Answer to:
2. Which of the following recursive functions, written in a fictitious language, are tail recursive? Select all that are A. function f(n) ifn<2 else f(n-1) + f(n-2) end If m=0 else B. function g(m...