Write a Python3 function sqr(n) that returns the square of its numeric parameter n

Task 6. Consider a paging system with the one-level page table stored in memory. (a) If a memory reference takes 10 ns (nanoseconds), how long does a paged memory reference take? (b) If we add TLBS, and if 90 percent of all page-table references are found in the TLBS, what is the effective memory reference time? (Assume that finding a page-table entry in the TLBS takes 0.5 nanoseconds, if the entry is present.)

How to write a function in python that takes a string s = kkeeepinng and returns the non-repeating character from strrint s. Such that the output should be as follows:  p i g

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.

In Haskell: Code a function "rangeProduct" that takes two arguments. The function should return 0 if the second argument is smaller than the first, otherwise it should return the product of the range between two numbers, ex: rangeProduct 3 5 --> 60 (because 3*4*5 = 60) What to do for negative numbers to do (if anything) is up to you. Write the program without recursion first and then write it with recursion.

-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-'

Write a lisp program (please provide photos that it works)