Define function f() and g () in this way def >>.(y): x=2 print ( ' in f (): x = {}, y= {} ' .format (x, y)) g(3) print ( ' In f() : x = {} , y= {} '.format (x, y)) >>> def g(y) : x = 4 print ( ' In g(): x = {} , y= {} ' . format (x, y)) interpreter shell x= 20 y = 30 and function cell double (4) y = 4 x= 2 show graphically the variable names their values and the namespace of function f() and g() during the execution of function g() when this call is made >>> f (1) python ( namespace)

Define function f() and g () in this way def >>.(y): x=2 print ( ' in f (): x = {}, y= {} ' .format (x, y)) g(3) print ( ' In f() : x = {} , y= {} '.format (x, y)) >>> def g(y) : x = 4 print ( ' In g(): x = {} , y= {} ' . format (x, y)) interpreter shell x= 20 y = 30 and function cell double (4) y = 4 x= 2 show graphically the variable names their values and the namespace of function f() and g() during the execution of function g() when this call is made >>> f (1) python ( namespace)

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

Write the following three functions in c programming language: 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));
Programming Language: C 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: 1. Start with accumulator = A[0] 2. For i=1...length-1 compute accumulator=f(accumulator, A[i]) 3. 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)); Test for the functions: // used for test Q3-find bool is_even(int x) { return x%2 == 0; } bool is_positive(int x) { return x>0; } void…
Write a lisp function that prints out the calendar for the current month. This function should take 2 parameters: the day of the week that the month starts from as an index (0 for Sunday, etc.) and the number of days in the month. For example, if you call the function (calendar 2 30) Print the initial of each day on the first line using the list of days defined at the previous exercise, the capitalized symbol-name as before, and the function substring to extract the first letter of the string. For example, the call: (substring "Sunday" 0 1) returns the string "S".
Write a function called number_matrix(r,c) that takes two parameters r and c and PRINTS ON THE SCREEN a matrix of numbers as follows: 1 2 3 4 5 .... 2 3 4 5 6 .... 3 4 5 6 7 .... ... In this pattern, each row contains c numbers and there are r rows. For example, number_matrix(4,3) results in: 1 2 3 2 3 4 3 4 5 4 5 6
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
Hi, OCaml programming 1. Create a type slidingTile, consisting of a char matrix and two integers xand y. The integers x and y are the coordinates of an empty tile. 2. Create a function val slide : slidingTile -> int -> int -> slidingTile = <fun> that given a slidingTile and two integers, that represent a location in thematrix, it slides the tile from the specified location to the empty tile, thenreturns the altered slidingTile. If provided location is not adjacent to theempty tile, or out of bounds, then return the slidingTile unaltered. 3. Create a function val print_tile : slidingTile -> unit = <fun> that prints a slidingTile on screen with the corresponding characters fromthe matrix. However, print an empty space where the empty tile is instead.
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));
Language: C Write the function convolve that will calculate the confolution of two functions f, g on [0, t] interval. The convolution is defined as (f ∗ g)(t) = Z t 0 f(τ )g(t − τ ) dτ for f, g : [0, ∞) → R. The argument function f and g should be passed by pointers. The integral should be approximated by the Riemman sum, i.e., Z b a f(x) dx = Xn i=1 f(xi) ∆x, where ∆x = b−a n and xi = a + i ∆x. Define the functions func1, func2 and func3, that return sin(x), cos(x) and x 3 respectively. Use these functions to calculate the convolution of f = sin(x), g = sin(x) f = sin(x), g = cos(x) f = sin(x), g = x 3 for t = 2π and n = 1000.
Write a function in C++ called maximumGap that finds the maximum difference between corresponding entries in two arrays (that have the same capacity). There are 3 parameters, the 2 arrays and their capacity. If the arrays store 9, 0, 3 and 4, 7, 6 the maximum gap is 7 (between the second elements of the two arrays).
Write a function f which takes three pointers to int variables (a, b, c). Then it should:-Set the first variable to the sum of values of the variables (a + b + c).-Set the second variable to difference between maximum and minimum of values ( max(a,b,c) - min(a,b,c) )-Set the third variable to median of a, b, c.For example:if a = 5, b = 10, c = 2Then f(&a, &b, &c) should:Set a to 17 (that is the sum)Set b to 8 (that is max - min = 10 - 2)Set c to 5 (that is the median of 5, 10 and 2) NOTE: You are already provided a test main which checks your code for evaluation. DO NOT MODIFY IT or your answer will NOT be accepted. #include<stdio.h> // Write your code here... //////////////////////////////////////////// THIS IS THE TEST MAIN FOR YOUR PROGRAM// DO NOT MODIFY IT!!int main() {int a = 1;int b = 2;int c = 3;for (int i = 0; i < 2; i++) {f(&a, &b, &c);printf("%d\n", a);printf("%d\n", b);printf("%d\n", c);}return 0;}//////////////////////////////////////////…
Design a class ProblemSolution to overload a function solution. Write a function int solution(int N, char CH) that accepts integer N and character CH. The function should return square of a number (N) if a character (CH) is "s" otherwise return cube of a number. int solution(int N, int M, char CH) that accepts two integers (N and M) and one character CH. The function should return the product of two integers if a character (CH) is ‘p’ otherwise return their sum. boolean solution(String S1, String S2) that accepts two strings S1 and S2. The function should return true if S1 and S2 are equal otherwise false. Input 1 4 s where, First line represents a choice for calling one of the defined methods. (1 for solution(int N, char CH), 2 for solution(int N, int M, char CH) and 3 for solution(String S1, String S2)). Second line represents number input. Third line represents choice CH. Output 16 Here, the first line contains 1 and hence solution(int N, char…
Define a function CalcPyramidVolume with double data type parameters baseLength, baseWidth, and pyramidHeight, that returns as a double the volume of a pyramid with a rectangular base. Relevant geometry equations:Volume = base area x height x 1/3Base area = base length x base width.(Watch out for integer division). #include <iostream>using namespace std; /* Your solution goes here */ int main() { double userLength; double userWidth; double userHeight; cin >> userLength; cin >> userWidth; cin >> userHeight; cout << "Volume: " << CalcPyramidVolume(userLength, userWidth, userHeight) << endl; return 0;}