Answer the question please? What is the return value of the following recursive algorithm when the input arguments are A=[0,0,1,0,0,1,0,1] and pos=7? function F(A,pos) if(pos<0) return 0 if(pos==length(A)-1 or pos==0 or A[pos-1]==1 or A[pos+1]==1) return 0 + F(A,pos-1) if(A[pos-1]==0 and A[pos+1]==0) return 1+ F(A,pos-1) One of these options below are correct, which one? 7 2 8 5 none of the others

Answer the question please? What is the return value of the following recursive algorithm when the input arguments are A=[0,0,1,0,0,1,0,1] and pos=7? function F(A,pos) if(pos<0) return 0 if(pos==length(A)-1 or pos==0 or A[pos-1]==1 or A[pos+1]==1) return 0 + F(A,pos-1) if(A[pos-1]==0 and A[pos+1]==0) return 1+ F(A,pos-1) One of these options below are correct, which one? 7 2 8 5 none of the others

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter15: Recursion

Section: Chapter Questions

Problem 7SA

See similar textbooks

Similar questions

Recursive Palindrome! Recall that a palindrome is a string that reads the same forward and backward. Write a recursive function is_palindrome (s:str) -> bool to check whether a string s is a palindrome. Here's a hint: think about how you can use is_palindrome(t), where t is a substring of s, to help you decide whether s is a palindrome. Your Answer: 1 # Put your answer here 2 Submit
Consider the following recursive function: if b = 0, if 6 > a > 0, a f(b, a) f (b, 2.(a mod b)) otherwise. f(a, b) = Estimate the number of recursive applications required to compute f(a, b).
4. Write a recursive function code that finds the elements of the given sequence: a, 3a-1 + n², and a 1. What is the time complexity of your code? Explain it.
SML programming Write a recursive function np(n) which takes a non negative n and generates a list of numbers from n+1 down to 0. You may assume that input of n is always valid. Must use identical function name and parameter(s). np(4)⟶[5,4,3,2,1,0]
8. Ackerman's Function Ackermann's Function is a recursive mathematical algorithm that can be used to test how well a system optimizes its performance of recursion. Design a function ackermann(m, n), which solves Ackermann's function. Use the following logic in your function: If m = 0 then return n + 1 If n = 0 then return ackermann(m-1,1) Otherwise, return ackermann(m-1,ackermann(m,n-1)) Once you've designed yyour function, test it by calling it with small values for m and n. Use Python.
Computing Powers, p(x,n)=xn1. Describe the definition of recursive function.oBase case(s)oRecursive case(s)2. Write the code
Note: Solve using c++ programming Write a recursive function to get count of unique characters in given string or array of characters.Prototype of Function: int getUniCharCount(const char* ptr,const char* current)Input: const char* ptr=”wavelength”Output: 9
language: Python Problem: Write a recursive function power(x, n), where n is 0 or a postive integer. For example, power(2, 10) will return 1024. Write a suitable base case, and for the general case use the idea that xn = x * x n-1.
Given the recursive function definition:t(n) = n+ 3 * t(n-1) + t(n-2) t(0) = 2 t(1) = 1a. Evaluate: t(3)b. Write the source code to implement this function
Midterm Practice Problems 1. Use recursion to write a function count_ones that returns how many Is there are in a number n when represented in decimal (base 10). For example, 1231 has two 1s. You can assume that n is nonnegative and at most 9 digits long. Do not use global (or static) variables. In main perform at least three tests of count_ones and use assert to check that the returned value is correct. Your function should have the following prototype: // count_ones (n) returns the number of is in the decimal representation of n // requires: 0 <= n < 10^9 int count_ones (int n);
Write a recursive function to generate nth fibonacci term in C programming. How to generate nth fibonacci term in C programming using recursion. Logic to find nth Fibonacci term using recursion in C programming. Fibonacci series is a series of numbers where the current number is the sum of previous two terms. For Example: 0, 1, 1, 2, 3, 5, 8, 13, 21, ... , (n-1th + n-2th) Example: Input: Input any number: 10 Output 10th Fibonacci term: 55 please use C language
Write a recursive function that takes an array and a callback function and returns True if any value of that array returns True from that callback function otherwise returns False.As a callback funtion for this problem, assume that the callback function is used to check if a given input is an even number.- Analyse the running time of the algorithm