Write recursive rules expbar(R, X, Y, N) to compute R = (2*X + Y)^N, where R is

Question

Write recursive rules expbar(R, X, Y, N) to compute R = (2*X + Y)^N, where R is used to hold the result, X, Y and N are non-negative integers, and X, Y and N cannot be 0 at the same time, because 00 is undefined. The program must print an error message if X = Y = N = 0. You must apply the following test cases (inputs) to test your code: X = 0, Y = 0, N = 0; X = 0, Y = 0, N = 5; X = 0, Y = 5, N = 0; X = 5, Y = 0, N = 0; X = 5, Y = 5, N = 0; X = 5, Y = 0, N = 5; X = 0, Y = 5, N = 5; X = 5, Y = 5, N = 5; 1.2 Write a recursive rules factbar(F, X, Y, N) to compute F = ((2*X + Y)^N)! (factorial of expbar). The rule must call (use) the rule expbar that you designed. You must apply the following test cases (inputs) to test your code: X = 0, Y = 0, N = 0; X = 0, Y = 0, N = 5; X = 0, Y = 5, N = 0; X = 5, Y = 0, N = 0; X = 3, Y = 3, N = 0; X = 3, Y = 0, N = 3; X = 0, Y = 3, N = 3; X = 2, Y = 2, N = 2;

Explanation / Answer

expbar(R, X, Y, N) :- (X =:= Y =:= N =:= 0 -> write("No two variables can equal 0 at the same time."); (N =:= 0 -> R is 2 * X + Y; N1 is N - 1, expbar(R1, X, Y, N1) R is (2 * X + Y) * R1 ) ).

Related Questions

Navigate

• Browse (All)
• Browse W
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.