Each of the following ML functions contains a function call that passes a function parameter f. In each case, will the function f use its nesting link when it is called? Why? a) fun addone theList =     let fun f x = x + 1;     in map f theList end; b) fun addall n theList =        let fun f x = x + n;        in map f theList        end; c) fun do123 f =    map f [1, 2, 3]

'Split List' in Scheme:

Write a function named cumulative that accepts as a parameter a reference to a vectorof integers, and modifies it so that each element contains the cumulative sum of the elements up through that index. For example, if the vector passed contains {1, 1, 2, 3, 5}, your function should modify it to store {1, 2, 4, 7, 12}.

Concatenate Map This function will be given a single parameter known as the Map List. The Map List is a list of maps. Your job is to combine all the maps found in the map list into a single map and return it. There are two rules for addingvalues to the map. You must add key-value pairs to the map in the same order they are found in the Map List. If the key already exists, it cannot be overwritten. In other words, if two or more maps have the same key, the key to be added cannot be overwritten by the subsequent maps.   Signature:   public static HashMap<String, Integer> concatenateMap(ArrayList<HashMap<String, Integer>> mapList) Example: INPUT: [{b=55, t=20, f=26, n=87, o=93}, {s=95, f=9, n=11, o=71}, {f=89, n=82, o=29}]OUTPUT: {b=55, s=95, t=20, f=26, n=87, o=93} INPUT: [{v=2, f=80, z=43, k=90, n=43}, {d=41, f=98, y=39, n=83}, {d=12, v=61, y=44, n=30}]OUTPUT: {d=41, v=2, f=80, y=39, z=43, k=90, n=43} INPUT: [{p=79, b=10, g=28, h=21, z=62}, {p=5, g=87, h=38}, {p=29,…

Function Implementation with Data Abstraction in C Programming 1. Create a new file and SAVE as MATHV1.H Define and Implement the following functions: int sum(int x, int y); - returns the computed sum of two numbers x and y int diff(int x, int y); - returns the computed difference of two numbers x and y. Make sure that the larger number is deducted by the smaller number to avoid a negative answer long int prod(int x, int y); - returns the computed product of two number x and y float quot(int x, int y); - returns the computed quotient of two numbers x and y. Make sure that the larger number is always the numerator and divided by the smaller number to avoid division by zero error. int mod(int x, int y); - returns the computed remainder of two numbers x and y using the modulo operator %2. Create another new file and save as MYTOOLS.H void center(int row, char str[]); /*centers text across the screen -calculate here for the center col using the formula col=(80-strlen(str))/2; -then use…

Erlang File -module(exam). -compile(export_all). -include_lib("eunit/include/eunit.hrl").   Part A Implement a function called min which takes a tuple of two numeric values and returns the lower value of the two.Implementation notes:• If needed, use Erlang function guards• Do NOT use the if or case structuresSample calls:> exam:min({3, 4}).3> exam:min({4, 3}).3

a Write a function cutF2 that returns its argument with the first two items removed. It should not change the argument, but should return a copy without the first two items. >>> testList = [0,1, 2,3,4,5,6,7]+ >>> cut1(testList) >>> print (testList) #Note: returns modified copy [2, 3, 4,5,6,7]- #Note: original unchanged [0, 1, 2, 3, 4, 5, 6, 7]

code in c program

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.

Higher-order function foldr: (X Y --> Y) Y ListOfX --> Y Which of the below is true? (select two) A) X and Y must be of different types B) X and Y must be of the same type C) The return type of foldr is a function that takes two arguments D) foldr takes a function as an input argument E) Y can't be a list F) The base case of the implicit recursion is of type Y