Question

Develop and write a procedure make-^ which inputs a single parameter n and which returns a procedure

raiseToNthPower. The procedure raiseToNthPower must itself input a single parameter b, and must

return b^n. You may assume that n is an integer.

please, use scheme language

Answer #1

**Solution:**

**Screenshot of
the code:**

**Sample
Output:**

**Code To
Copy:**

;Function to be used in raiseToNthPower().

(define (myabs x)

(cond ((< x 0) (* x -1))

((x >= 0) (* x 1))))

;Define the function to compute x ^ y.

(define (raiseToNthPower x y)

;Condition to check the value of x.

(cond ((< x 0) (* (cond ((odd? (myabs y)) -1)

(else 1))

(raiseToNthPower (myabs x) y)))

((< y 0) (/ 1 (raiseToNthPower x (myabs y))))

((= y 0) 1)

((> y 0) (* x (raiseToNthPower x (- y 1))))))

;Call the function by passing the values.

(raiseToNthPower 2 3)

Write a method called countChar which accepts a string parameter
and a character parameter and returns an integer, that is:
int countChar (String s, char c)
This method should count the number of occurrences of the
character c within the string s, and return the count to the
caller.
Also write a main method that tests countChar. All of the print
statements and user interaction belong in the main method, not in
countChar.

c++
Write a program that calls a function
calculateSum to calculate the sum from -1 to N.
The function calculateSum has one parameter N of type integer and
returns an integer which represents the sum from -1 to N,
inclusive.
Write another function calculateAverage that
calculates an average. This function will have two parameters: the
sum and the number of items. It returns the average (of type
float).
The main function should be responsible for all inputs and
outputs. Your...

Write a Python function called sumNxN with
three parameters. The first parameter is a nested list (matrix)
representing a matrix of size N x N. The second parameter is the
integer N, and the third is a list of N zeros.
Modify the list of zeros so that each entry is the sum of the
corresponding column. There is no return.
Note: You may assume the sizes provided are all correct.

Write a function called fun which has an object as its parameter
and returns the name of properties of that object in an array. For
instance, if it receives {a:1,b:3}, as its parameter, it should
return [a, b], or if it receives {u:4, k:3, h:5}, it should return
[u, k, h].
Answer:(penalty regime: 10, 20, ... %)

Write a function called odd_rms that returns orms, which is the
square root of the mean of the squares of the first nn positive odd
integers, where nn is a positive integer and is the only input
argument. For example, if nn is 3, your function needs to compute
and return the square root of the average of the numbers 1, 9, and
25. You may use built-in functions including, for example, sum and
sqrt, except for the built-in function...

Write a function called odd_rms that returns orms, which is the
square root of the mean of the squares of the first nn positive odd
integers, where nn is a positive integer and is the only input
argument. For example, if nn is 3, your function needs to compute
and return the square root of the average of the numbers 1, 9, and
25. You may use built-in functions including, for example, sum and
sqrt, except for the built-in function...

Write a program containing a function,
reverseDigit, that takes an integer as a parameter
and returns the number with its digits reversed, then printout the
return result. For example, the value of
reverseDigit(12345) is 54321; the value of
reverseDigit(5600) is 65; the value of
reverseDigit(7008) is 8007; and the value of
reverseDigit(-532) is -235.
Modify the following program to make a correct output.
/*
// Name: Your Name
// ID: Your ID
// Purpose Statement: ~~~
*/
#include <iostream>...

Write in C++ a function int sumofdigits( int n ) which computes
and returns the sum of the digits of
n.
Use the following main function to test your code:
int main()
{
int n, sn;
cout << "Enter q to quit or an integer: ";
while ( cin >> n )
{
sn = sumofdigits(n);
cout << "sumofdigits( " << n << " ) = " <<
sn;
cout << "\nEnter q to quit or an integer: ";
}...

Write a method which takes as input an integer, returns true if
the integer is prime, and returns false otherwise. Do not import
anything.
If the input is negative, 0 or 1, false should be returned.
If the input x is greater than 1, you can test if it is prime
(inefficiently) by checking if it is divisible by any integer from
2 up to half of x. If it is not divisible by any of these numbers,
then it...

Write a function that returns the largest element of an array?
Your function should accept a 1-D array as an input and return the
largest number. You may assume all numbers are integers. CODE IN
C++ PLEASE

ADVERTISEMENT

Get Answers For Free

Most questions answered within 1 hours.

ADVERTISEMENT

asked 3 minutes ago

asked 11 minutes ago

asked 22 minutes ago

asked 24 minutes ago

asked 31 minutes ago

asked 37 minutes ago

asked 38 minutes ago

asked 38 minutes ago

asked 38 minutes ago

asked 42 minutes ago

asked 43 minutes ago

asked 58 minutes ago