1. Given the following function: int Fn (int N) { } if (N == 0) return 2; else return N + Fn (N/3); a) What type of function is this, Iterative or Recursive? Give justification. b) Given N = 17, what will be the output from this function? Show your work.

1. Given the following function: int Fn (int N) { } if (N == 0) return 2; else return N + Fn (N/3); a) What type of function is this, Iterative or Recursive? Give justification. b) Given N = 17, what will be the output from this function? Show your work.

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

Related questions

Q: Given the following function f, what will be the output of the function call f(3)? int f(int n){…

A: We are given a recursive function f() and we are going to call the function with f(3).

Q: 4. The Ackermann function is a fast-growing function that takes two nonnegative integers: m and n,…

A: Algorithm: If m=0 then return n+1 Otherwise, if n=0 then return A(m-1,1) Otherwise, return…

Q: Could you help me the following question Below is a recursive function written in Java that takes…

A: A recursive function is a function which calls itself. Using a recursive function, one can convert…

Q: QUARE-Grid Duplicate RECURSIVE. A; B(Strassen's Calculations)/and customary increase. The a java…

A: Matrix C = Matrix A * Matrix B Consider for now the mathematical computation of matrices is that it…

Q: result of the following applications of substitution? P(x,y,z) {x/c, y/ f(a)}, where a and c are…

A: What is the result of the following applications of substitution? P(x,y,z) {x/c, y/ f(a)}, where a…

Q: Write an iterative version of the function defined in Self-Test Exercise 2. (Write a recursive void…

A: A recursive function is a function which calls itself until some condition is true. The iterative…

Q: Using C I need help in coding this. Write a function void MaxCopy(int C[], int A[], int B[], int…

A: Below is the complete solution with explanation in detail for the given question. The greatest of…

Q: Note: Solve using c++ Write a recursive function to get count of a specific character in given…

A: C++ Program: # include <iostream>using namespace std;# define NO_OF_CHARS 256class…

Q: a)Write a Java code which gives the value of (14(1/n)Pn for n= 2,4, You can use the function…

A: a)Write a Java code which gives the value of (14(1/n)Pn for n= 2,4, You can use the function…

Q: Write a recursive function printRev ( int a[ ], int s, int e) that receives an integer array a [ ],…

A: Here is the editable source code: #include <iostream> using namespace std; void…

Q: 2) Let array a be 549,813120,6) and b be the last digit of your student mumber Accordingly, if we…

A: Create a main() method, initialize the variable array a with the specified values, and then create…

Q: Wrtie a python code: You will create and implement two functions to solve the following problem for…

A: Please refer to the following steps for the complete solution to the problem above.

Q: Given an integer n, you need to find all non-negative even numbers that are no greater thann. Please…

A: logic: def Q1_get_even_numbers(n): global lst if n==0: Display 0 print(lst)…

Q: a)Write a Java code which gives the value of (1+(1/n))^n for n= 2,4,..,2^14. You can use the…

A: Java used to answer this question

Q: 9o. Write a recursive function printRev ( int a[ ], int s, int e) that receives an integer array a…

A: The algorithm or pseudocode will be: printRev(a,0,3) Start for i=3 to 0, go to step 3 else to…

Q: Write a program which should consists of a user defined function “maximum ()”. Pass 1D array to the…

A: Note : An array name is actually the address of the first element of the array, passing it would…

Q: Write the recursive version of the function reduce which takes • reducer - a two-argument function…

A: The complete python code is below:

Q: Based on the following function, what is the value of z(6,8)?

A: Introduction: In this question, we are given a code snippet and have to answer the output of that…

Q: an you solve with C programming pls ? and //explain it steps pls

A: I have written the C code below: first, we have to ask the user to enter the size of the two arrays…

Q: Study the two functions given below. Both use the same array declared as: static int…

A: According to the Bartelby guideline we are suppose to answer only three sub question at a time.…

Q: Write a recursive function called `productMatch` which takes an array of numbers and a target…

A: Algorithms: START # selects the first member from the array # The flag variable is used…

Q: Let multidimensional array a with size 3 x 4 be {1,2,3,4,5,6,7,8,9,10,11,12} and b be the last digit…

A: Required: Required code with comments for explanation and screenshot of both code and output…

Q: Problem 7 Write a Python function to sort numbers in decreasing order, based on the following…

A: Introduction Recursive Strategy: A recursive strategy is a programming technique that involves…

Q: (This question is for a linked list of the type described on the front page, Item 5). Write a…

A: Linked lists are a common data structure in computer science that make data storage and retrieval…

Q: Define function print_popcorn_time() with parameter bag_ounces. If bag_ounces is less than 3, print…

A: Python:- Python's built-in classes, functions, and wide range of libraries make writing code faster…

Q: Below is the recursive implementation of binary search from lab with one change (in red): the print…

A: In this program, we are performing binary search,

Q: Write a nToArray function which does the following: 1. Accepts an empty partially filled array, the…

A: Programs: The programs are mainly used for problem-solving. It contains the instructions to solve…

Q: a) Write a non-recursive function in C++/ to multiply all even numbers from 2 to n, where n is an…

A: a) //non recursive function to multiply all even numbers from 2 to n and returns resultint…

Q: (Recursive Greatest Common Divisor) The greatest common divisor of integers x and y isthe largest…

A: Lets see the solution.

Q: What is the return value of the function call BS(array, 0, 9, 45), where array is an array declared…

A: Answers:- given code:- #include<stdio.h> void main(){ int array[]={3, 10, 13, 20, 35, 45,…

Q: Two functions are given below to calculate factorial using dynamic programming (left) and recursive…

A: The complete answer is given below .

Q: checkEquals([1, 2], [1, 3]) → false // Good so far... checkEquals([1, 2], [1, 2]) → false // Yikes!…

Q: Write a lexical analyzer to scan the following program snippet. /* The main function */ int main() {…

A: Lexical Analysis:- The first phase of the compiler which is used to convert the high level input…

Q: Short Answer Questions (3-4 sentences expected per question) 1) Give a brief description of the…

A: Here all basic concepts of programming language like looping statements, user-defined functions,…

Q: 2: - Write a recursive function that takes an array and a callback function and returns True if any…

A: Note: This is a python code to check whether the number is even or not. The function takes an array…

Q: int RFunc(int a, int b) { if (a <= 0 || b <= 0) { return a+b; } else { return RFunc (a-1, b-1) +…

A: HERE IS STEP BY COMPLETE SOLUTION REGARDING YOUR PROBLEM

Q: For each of the following function, indicate the class Q(n) the function belongs (use the simplest…

A: We need to indicate the class θ(n) of the given function.

Q: 2. (a) Write a function, called myListFn, which takes a single argument n and implements the…

A: Below find the solution !! (a) myListFn <- function(n) { xVec <- rnorm(n) xBar <-…

Q: You’re writing a function in C++ that accepts an array of distinct integers from 0, 1, 2, 3...up to…

A: We can use the concept of the summation formula to optimize the code and achieve a runtime of O(N)…

Question

100%

1. Given the following function:
int Fn (int N)
{
}
if (N == 0) return 2;
else return N + Fn (N/3);
a) What type of function is this, Iterative or Recursive? Give justification.
b) Given N = 17, what will be the output from this function? Show your work.

Expert Solution

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

SEE SOLUTION Check out a sample Q&A here

Step 1

VIEW

Step 2

VIEW

Step by step

Solved in 2 steps

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions

12 Question 2 Consider the following recursive function: void exercise(int x){ if (x > 0 8& x < 10)X cout << x << " ". exercise(x+ 1); } What is the output of exercise(7)? Your answer: 19 ettv 近

[In C language] The concept of a "drunkard's walk" involves an individual who starts walking aimlessly from a lamp post. With each step they take, they move randomly either north, south, east, or west, each with a 25% probability. As the individual takes more steps, they tend to forget where they started and continue taking random steps. The objective is to determine how far the individual will be from the starting point (0,0) after taking N number of steps. To simulate this random walking motion for N steps, we can create a computer program. This program should ask the user to input an integer representing the number of steps to be taken. It should work for any positive value of steps, even for a large number. However, if the user enters an invalid number (such as a negative value), the program should display an error message. After each step, the program should show the current location of the random walker with respect to the origin (lamp post). Finally, when the random…
hello. can you solve it? thank you...
C++ Help
C programming
For each of the following function, indicate the class Q(n) the function belongs (use the simplest g(n) possible in your answer. d) (n 2 / 2) - 4n
Please solve it in python.
.
is it correct ? Write a recursive function that returns the nth number in a fibonacci sequence when n is passed to function. The fibonacci sequence is like 0,1,1,2,3,5,8,13...... Answer: #include <iostream> using namespace std; int getFibonacci(int n) { if (n == 0 || n == 1) return n; else return getFibonacci(n - 1) + getFibonacci(n - 2); } int main() { int n = 7; int result = getFibonacci(n); cout << result; }
Language: Python Make a function and after that please test it on a paper by making 8 by 8 queens board.
1. A set of integers are relatively prime to each other if there is no integer greater than 1 that divides all the elements. Furthermore, in Number Theory, it is known that the Euler function,ϕ (n), expresses the number of positive integers less than n that are relatively prime with n. Choose the alternative that has the correct value of ϕ(n) for every n below. A) ϕ(5) = 4 B) ϕ(6) = 2 C) ϕ(10) = 3 D) ϕ(14) = 6 E) ϕ(17) = 16
In c++ please help me answer this question I will give you a good rating :) implement the three versions of the addupto20() function: iterative, recursive, and divide-and-conquer approach test these functions with a few inputs from your main() Iterative solution * check if there exsits two numbers from vector data that add up to 20 e.g., if data=[2,5,3,15], the function returns true, as data [0] +data [3]==20 e.g., if data=[3,4,0,8], the function return false precondition: vector data has been initialized postcondition: if there are two numbers from list add up to 20, return true; otherwise, return false */ bool AddupTo20 (const vector‹int> & data){ } Come up with a recursive solution to the problem, following the hints given below: * check if there exsits two numbers from vector data[first...right] add up to 20 e.g., if data=[2,5,3,15], first=0, last=3, the function returns true, as data [0] +data [3]==20 e.g., if data=[2,5,3,15], first=2, last=3, the function returns…