Consider the following recursive algorithm:Int active(Int x)if (x < 1)return 103;elsereturn active(x- 2)+x;What is the value of x after executing:x = active(10)?Select one:Oa. 40O b. 30Oc. 16d. 22

I have given an answer in step 2.

Answered: int active(Int x) If (x < 1) return 10;…

Engineering

Computer Science

int active(Int x) If (x < 1) return 10; else return active(x- 2)+x3;

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

int p =5 , q =6; void foo ( int b , int c ) { b = 2 * c ; p = p + c ; c = 1 + p ; q = q * 2; print ( b + c ); } main () { foo (p , q ); print p , q ; } Explain and print the output of the above code when the parameters to the foo function are passed by value. Explain and print the output of the above code when the parameters to the foo function are passed by reference. Explain and print the output of the above code when the parameters to the foo function are passed by value result. Explain and print the output of the above code when the parameters to the foo function are passed by name.
i. Assume P(x,y) is (x+y>4). Write a function/method that can validate the nested quantifier xvy P(x, y) for elements from two arrays X and Y. hint: The method returns I if statement is valid (the sum of all pairs of values from X and Y is greater than 4), and returns 0 otherwise. Valid case: For arrays X=(2,3,4) and Y=(3,4,5), the method returns 1(since xEX and vyjEY, x₁+₁>4) Invalid case: For arrays X=(2,3,4} and Y=(1,4,5), the method returns 0 (since 2 EX and 1 EY but 2+1<4) ii. Modify your code to validate nested quantifier x3yP(x, y) when P(x,y) is (x+y=9) hint: Valid case: For X=(2,3,4} and Y={1,4,5) method returns 1 (since 4 EX and 5 EY and 4+5=9) Invalid case: For X=(2,3,4} and Y={1,4,4} method returns 0 (since none of the pairs of values from X and Y adds up to 9)
1- CHANGE THE FOLLOWING INFIX METHOD INTO A POSTFIX ! (A + (B - (C * D) - F) : G); ((A * (B : (C + D) - F) : G) + F); (((A – B) : C) * D : F) - G + F;
*68. What is the return value of f (p, p), if the value of p is initialized to 5 before the call? Note that the first parameter is passed by reference, whereas the second parameter is passed by value. int f(int &x, int c) { c = c 1; if X = X + 1; return f(x, c) } (a) 3024 (c==0) return 1; * X; (b) 6561 (c) 55440 (d) 161051
SCALA Programming Problem Stone Pit is a game in historic roman time, that involves removing stones from tower of stones. The rules of this game are mentioned under: • At first there are X group of stones, numbered 1 through x. Two warriors can play and they take alternate turns. If the bitwise XOR of all group equals 0 before a warrior's chance, then that warrior is declared winner. When warrior's turn comes, they must choose one of the remaining groups and remove it. Develop a SCALA program to decide which warrior wins, given that both warriors are expert at this game. Sample Input: 1 3 561 Sample Output: First Warrior
Programming: C Language
6. int x = 1; While(x <=n^2) for ( int i = 1; i < n; i++) System.out.println("Welcometo the Mid Exam"); What is the total time that the statement "Welcome to the Mid Exam" will be repeated? O n^2+3n+1 O 2n^2+3n+1 O 2n^2+3 O2n^2+3n+1 ONo correct answer
Provide full C++ Code This assignment is a review of loops. Do not use anything more advanced than a loop, such as functions or arrays or classes. In the card game named 'blackjack' players get two cards to start with, and then they are asked whether or not they want more cards. Players can continue to take as many cards as they like. Their goal is to get as close as possible to a total of 21 without going over. Face cards have a value of 10. Write a command line game that plays a simple version of blackjack. The program should generate a random number between 1 and 10 each time the player gets a card. Each of the values (1 through 10) must be equally likely. (In other words, this won't be like real black jack where getting a 10 is more likely than getting some other value, because in real black jack all face cards count as 10.) It should keep a running total of the players cards, and ask the player whether or not it should deal another card. Sample output for the game is written…
const d = 4let a = 1if (true) { let a = 4var b = 2if (a < 5) {var c = 1b = 5}}console.log(a + b + c) What is is the output and why? a) The output is 7 because a, b, c and d are globally scoped variables b) The output is 11 because a, b, and c are all globally scoped variables while d is a block scoped variable c) The output is 7 because b and c are globally scoped variables d) The output is 6 because a is a block scoped variable and b is a globally scoped variable
Problem Description: Implement the described Mancala variant in C++ in the pictures. Player 1 will be a human while the other will be a computer player. The computer player selects a hole following the following decision logic: If there is a hole with enough pieces to finish the turn in the computer player's end zone, select it. Otherwise select the hole on the right to left path with the greatest amount of marbles. If there are no marbles on that path then select the hole closest to the opponent's end zone. It is highly suggested, but not required, to pause the output after the computer makes a move to allow the user to interpret the output before more gets printed out. Look into cin.get(); The program should not allow the player to enter incorrect selections. The player cannot select a nonexistent hole, the end zones, or an empty hole. Look at the example output for an example for how to output the game board formatted in a nice way. You must tell the player what input is valid. For…
(YOU ARE NOT ALLOWED TO USE ARRAYLIST IN THIS PROJECT)Write a Java program to simulate a blackjack game of cards. The computer will play the role of the dealer. The program will randomly generate the cards dealt to the player and dealer during the game. Cards in this game will be represented by numbers 1 to 13 with Ace being represented by a 1. Remember, that face cards (i.e. Jack, Queen, and King) are worth 10 points to a hand while an Ace can be worth 1 or 11 points depending on the user’s choice. The numbered cards are worth their number value to the hand.
length(A)= ?