What does this function do?def f2(s):i=len(s)-1while(i>=0):print(s[i),end=")i=i-1A) It prints the reverse of its parametersB) It counts the number of 'a' characters in its parameter sIt counts the number of 's' characters in its parameter sIt prints its parameter sQuestion 6What's wrong with this code?i=10while(i>100):print('Ali')i=i+1It produces nothing

The correct option is option A. The given function prints the reverse of passed parameter s.…

What does this function do? def f2(s): i=len(s)-1 while(i>=0): print(s[i],end="") i=i-1 A It prints the reverse of its parameter s B It counts the number of 'a' characters in its parameter s C It counts the number of 's' characters in its parameter s D It prints its parameter s Question 6 What's wrong with this code? i=10 while(i>100): print('Ali') i=i+1 It produces nothing

What does this function do? def f2(s): i=len(s)-1 while(i>=0): print(s[i],end="") i=i-1 A It prints the reverse of its parameter s B It counts the number of 'a' characters in its parameter s C It counts the number of 's' characters in its parameter s D It prints its parameter s Question 6 What's wrong with this code? i=10 while(i>100): print('Ali') i=i+1 It produces nothing

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 8SA

See similar textbooks

Similar questions

so i keep getting some seg fault issue due to the realloc in my program. I'm reallocing an array of layer_t structs, which is in a function to add an empty cake layer that's being called by another function layer_t add_fresh_layer (cake_t *cake) ( (...) cake->layers= realloc(cake->layers, sizeof(layer_t) * cake->layer_height * 2); (...) } int add_filling_layer (cake_t *cake){ for (int i = 0; i < cake->cake_height; i++) { layer_t *layer = &cake->layers[i]; (...) for (j = 0; layer->ingred[j] != NULL; j++) { char *ingredients = layer->ingred[j];] (...) for (k = 0; k < bake->layer_count; k++) { (...) } if (...) { (...) layer_t *filling = add_fresh_layer(bake); (...) } } }} I know that the realloc is causing the address to change while the pointer for cake->layers[i] remains the same. And i know the fix here is super simple, but I can't for the life of me remember what it is
Write a function in c++ is ordered that takes an integer array and its size as parameters and returns true if the array elements are ordered in nondecreasing order and returns false if not. For example, integers in {10,0,1,1,5,1009} are ordered in nondecreasing order. On the other hand, integers in {1, 2, 3, 8, 4, 19} are not since 8 > 4
Implement the sieve of Eratosthenes: a function for computing prime numbers, known to the ancient Greeks. Choose an integer n. This function will compute all prime numbers up to, and including, n. First insert all numbers from 1 to n into a set. Then erase all multiples of 2 (except 2); that is, 4, 6, 8, 10, 12, ... . Erase all multiples of 3, that is, 6, 9, 12, 15, ... . Go up to ?⎯⎯√n. The remaining numbers are all primes. Make sure that you use functions in your solution, including a main function. Define def sieveOfEratosthenes(n) that receives the maximum value and returns a list of all prime numbers less than or equal to this value in main() print the list of prime numbers.
I just need the method they are asking for Write a recursive function that takes a start index, array of integers, and a target sum. Your goal is to find whether a subset of the array of integers adds up to the target sum. The start index is initially 0.A target sum of 0 is true for any array. Examples: subsetSum(0, {2, 4, 8}, 10) -> true public boolean subsetSum(int start, int[] nums, int target) { }
Implement function rotate that takes a string argument s and an integer argument n, and rotates the string s to the left by n times. For example, the code char s[] = "systems"; rotate(s, 3); will change s into "temssys", while the code char t[] = "abcd"; rotate(t, 1); will change t into "bcda". Restrictions: printf and strlen are the ONLY C library functions that you can use in the implementation. void rotate(char *w, int j)
The goal is to rewrite the function, below, such that passes in a different list of parameters, particularly eliminating the need to pass low and high for each recursive call to binary_search. defbinary_search(nums,low,high,item): mid=(low+high)//2iflow>high:returnFalse #The item doesn't exist in the list!elifnums[mid]==item:returnTrue# The item exists in the list!elifitem<nums[mid]:returnbinary_search(nums,low,mid-1,item)else:returnbinary_search(nums,mid+1,high,item) The new function should be prototyped below. The number of changes between the given version, and the one requested is not significant. defbinary_search(nums,item):pass# Remove this and fill in with your code Tip: If you consider that high and low are used to create a smaller version of our problem to be processed recursively, the version requested will do the same thing, just through a different, more Pythonic technique.
Write a function/ program that produces the following: int findDifference(const string a1[], int n1, const string a2[], int n2); Return the position of the first corresponding elements of a1 and a2 that are not equal. n1 is the number of interesting elements in a1, and n2 is the number of interesting elements in a2. If the arrays are equal up to the point where one or both runs out, return the smaller of n1 and n2. Notwithstanding each function's behavior described below, all functions that return an int must return −1 if they are passed any bad arguments (e.g. a negative array size, or a position that would require looking at the contents of an element past the last element we're interested in). Unless otherwise noted, passing 0 to the function as the array size is not itself an error; it merely indicates the function should examine no elements of the array. Here's an example: string cast[5] = { "samwell", "jon", "margaery", "daenerys", "tyrion" }; string roles[4] = { "samwell",…
1. def f(x):"""Evaluates function `f(x) = x^2 - 15 \sin(x * \pi/3)`Parameters----------x : array_likeInput(s) to the functionReturns-------out : ndarrayFunction `f`, evaluated at point(s) x"""# your code here 2. def grad_f(x):"""Evaluates gradient of a function `f(x) = x^2 - 15 \sin(x * \pi/3)`Parameters----------x : array_likePoint(s) at which gradient should be avalueatedReturns-------out : ndarrayGradient of the function `f` evaluaed at point(s) x"""# your code here # TEST 1. f(x)assert f(0.) == 0.assert np.allclose(f(np.array([2.5, 7.5])), np.array([-1.25, 41.25])) assert np.allclose(f(np.arange(-10, 10, 1)), np.arange(-10, 10, 1)**2 - 15*np.sin(np.pi/3*np.arange(-10, 10, 1)))x_min = 1.33668375assert np.allclose(f(x_min), -12.9944407) # TEST 2. grad_f(x)assert np.allclose(grad_f(0.), -15.7079)assert isinstance(grad_f(0.), float) assert np.allclose(grad_f(0), - 5*np.pi*np.cos(0)), 'Gradient at point 0 is wrong'assert np.allclose(grad_f(np.arange(-10, 10, 1)), 2*np.arange(-10,…
Write pseudocode for a function Det-Quicksort(A, p, r) that receives array A[1..n], and indices p and r. The function should sort the subarray A[p..r] recursively (meaning you should call itself). You can also use a function LinearSearch(A, p, r, v) that searches subarray A[p..r] for an element of value v and return its index (in case it exists) in O(r − p) time. (Just to give you something to compare to, the solution has 8 lines.)
In Kotlin A. Write a function lengthGreaterThan() with an expression body that takes a String s and an Int n and returns true if the String is at least n characters long. Then revise the function so that it can accept null values. If it receives null as the parameter, it should return false. B. Write a recursive function with an expression body that takes a list of nullable Strings and and Int an returns a list of just the Strings from the original list for which the function you wrote in the first part returns true C. Get the same result as in part B by using filter()
Write the following three functions: a) The function gets an array A of length n of ints, and a boolean predicate pred. It returns the smallest index i such that pred(A[i])==true.If no such element is not found, the function returns -1.int find(int* A, int n, bool (*pred)(int)); b) The function gets an array A of length n of ints, and a function f. It applies f to each element of A.void map(int* A, int n, int (*f)(int)); c) The function gets an array A of length n of ints, and a function f. The function f gets 2 ints and works as follows: Start with accumulator = A[0] For i=1...length-1 compute accumulator=f(accumulator, A[i]) Return accumulator For example, if f computes the sum of the two inputs, then reduce() will compute the sum of the entire array.int reduce(int* A, int n, int (*f)(int,int));
Implement the following functions in the same application in C#: 1. Given a number (integer) N (greater than 1). Implement a Fibonacci sequence of length N. (Function name ComputeFibonacciSequence )ComputeFibonacciSequence receives N.2. Given a list L with n numbers (integers), implement a function that returns whether that list is even prone or not (i.e.: the number of even numbers in the list must be higher than that of the odd numbers.) (Function name ComputeEvenProne) - Return 1 if the list is even prone, return 0 if it is not.ComputeEvenProne receives L.