Write a python function sqr(n) that returns the square of its parameter n for example: Test Result print(sqr(-3)) 9 print(sqr(11)) 121

Prepare the SPIM program for the function: int fun(int n) { int i,f=1; for (i=n; i>0; i--) f=f+1; return f; }

Write a function count_evens() that has four integer parameters, and returns the count of parameters where the value is an even number (i.e. evenly divisible by 2). Ex: If the four parameters are: 1 22 11 40 then the returned count will be: 2 Hint: Use the modulo operator % to determine if each number is even or odd. Your program must define the function:count_evens(num1, num2, num3, num4) python # Define your function here if __name__ == '__main__': num1 = int(input()) num2 = int(input()) num3 = int(input()) num4 = int(input()) result = count_evens(num1, num2, num3, num4) print('Total evens:', result)

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]

The following is a implementation of the Ackermann function: public static long Ackermann(int m, int n){ 0) return n + 1; if (m == else if (n == return Ackermann(m 1, 1); else return Ackermann(m 1, Ackermann(m, n - 1));

In C++, m%n is the remainder when the integer m is divided by the integer n. We can define a function to test whether an integer is even as follows: bool even(int k) { if ( k % 2 == 1 ) return false; else return true;} Translate this function into a standard mathematical function specification.

Write a function safe(n) that takes a non-negative integer n as input where n has at most 2 digits. The function determines if n is a safe number. A number is not safe if it contains a 9 as a digit, or if it can be divided by 9. The function should test if n is safe and return True if n is safe and False otherwise

-Python- Write a function get_letter_grade, such that when given * a lab grade score and * a list of the grade cutoffsreturns the letter grade of that score.Note: Your function automatically returns A for the values that are >= to the first cutoff-value in the list, then A- for the second cutoff-value, B+ for the third and so on. The function returns None for anything that's below the score for B-. You test that get_letter_grade(97, [93, 90, 87, 83, 80]) correctly returns an A, and get_letter_grade(93, [97, 90, 87, 83, 80]) returns A-. DO NOT hard-code the cutoffs, since they can change! You can copy/paste the following template: def get_letter_grade(score, cutoffs): if score ... : return 'A' ...: return 'A-' ...: return 'B+' ...: return 'B' ...: return 'B-'

Define a function in the Python language that takes an integer parameter n and returns the absolute difference of that number n with 100. If the absolute difference is less than 100 then return 0.

In loop functions.py, define a function named permutations that takes two paramters, n and r, in that order. This function returns the number of different permutations of length r from set of size n. Essentially to calculate these permutations, the function should compute the product (n - r+1)*(n-r+2)*(n-r+3)*...*(n-2)*(n-1) or n!/(n-r)!. No if statements or built in math functions should be used. For or while loops are best reccomended.

Write a function using Java Function Name: winInRowParameters: board: 2D integer array, row: integer, piece: integerReturn: booleanAssume board is valid 2D int array, row is valid index in the board, piece is X==1/O==2Look at indicated row at given index in board. If that row has at least 3 consecutive entries withgiven type of piece (X/O) (3 in a row XXX, OOO), then return true, otherwise false.