Question

Write in Racket Language

Write a recursive Racket function "sum" that takes two integers as parameters, each greater or equal to zero, and evaluates to their sum. In this problem, you must use the built-in functions "add1" and "sub1" and may not use the built-in functions "+" or "-". For example, (sum 2 3) should evaluate to 5. Note: (add1 5) evaluates to 6 and (sub1 4) evaluates to 3. Hint: like you saw in the "append" lecture, treat one of the parameters as the size of the problem and recurse until it reaches your base case.

Answer #1

**Greetings!!!!!**

Please find the recursive racket function as below, which makes
use of **add1** and **sub1** built-in
funcitons. Screen shots of all possible sample run is also attached
below the function.

```
(define (sum n m)
(if (= n 0)
m
(if (= m 0)
n
(sum (add1 n) (sub1 m)))))
```

**Thank You**

***************PLEASE GIVE ANSWERS IN RACKET PROGRAMMING
LANGUAGE ONLY******************
Write a recursive Racket function "update-if" that takes two
functions, f and g, and a list xs as parameters and evaluates to a
list. f will be a function that takes one parameter and evaluates
true or false. g will be a function that takes one parameter and
evaluates to some output. The result of update-if should be a list
of items such that if x is in xs and (f x)...

Write a Racket
function "combine" that takes two functions, f and g, as parameters
and evaluates to a new function. Both f and g will be functions
that take one parameter and evaluate to some result. The returned
function should be the composition of the two functions with f
applied first and g applied to f's result.
For example (combine
add1 sub1) should evaluate to a function equivalent to (define (h
x) (sub1 (add1 x))). You will need to use...

Write a Racket function "combine" that takes two functions, f
and g, as parameters and evaluates to a new function. Both f and g
will be functions that take one parameter and evaluate to some
result. The returned function should be the composition of the two
functions with f applied first and g applied to f's result.
For example (combine add1 sub1) should evaluate to a function
equivalent to (define (h x) (sub1 (add1 x))). You will need to use...

-RACKET LANGUAGE ONLY-
Write a non-recursive Racket function "keep-short-norec" that
takes an integer and a list of strings as parameters and evaluates
to a list of strings. The resulting list should be all strings on
the original list, maintaining their relative order, whose string
length is less than the integer parameter. For example,
(keep-short-rec 3 '("abc" "ab" "a")) should evaluate to '("ab" "a")
because these are the only strings shorter than 3.
Your solution must not be recursive. You will...

write a recursive racket function "sum-alternate" that takes a
positive integer x as a parameter. The function should return the
sum of all the integers x, x-2, x-4, x-6, etc. as long as the
numbers are positive. For example, [sum-alternate 5] should
evaluate to 5 + 3 + 1, and [sum-alternate 6] should evaluate to
6+4+2.

In racket, implement a tail-recursive function
called sum-pairs that creates a new list by adding the elements of
an input list in pairs. That is the first element of the resulting
list is the sum of the first two elements of the input, the second
element of the resulting list is the sum of the 3rd and 4th
elements of the input, and so on. If there is an odd number of
elements, then the last element remains unchanged. As...

Python Question:
Write a function which returns the sum of squares of the
integers 1 to n. For example, the sum of the squares from 1 to 4 is
1 + 4 + 9 + 16, or 30. You may choose what should be returned if n
== 0
You may not use the built-in Python sum function.
The Solution Must be recursive
>>> sum_of_squares(1)
1
>>> sum_of_squares(4)
30
>>> sum_of_squares(8) # 64 + 49 + 36 + ... +...

Arrays, loops, functions: Lotto
Element Repeated Function
Write a function that that takes as parameters an array of ints,
an int value named element, and an int value named end. Return a
bool based on whether the element appears in the array starting
from index 0 and up to but not including the end index.
Generate Random Array
Write a function that takes as parameters an array of integers
and another integer for the size of the array. Create a...

Write a MASM program that computes the sum of the integers from
1 to N where N is a positive integer. Use the equal sign directive
to define N. Save the sum in the EAX register. You must use
loops.
For example,
1 = 1
1 + 2 = 3
1 + 2 + 3 = 6
1 + 2 + 3 + 4 = 10
1 + 2 + 3 + 4 + 5 = 15
Language ( Assembly)...

Write a Python function count_bigger that takes two parameters,
a nested list of objects and a threshold number. It returns an
integer specifying how many of the objects anywhere in the nested
list are numbers that are larger than the threshold. (For our
purposes, "numbers" are either integers or floats.) There may be
objects in the list other than numbers, in which case you would
simply ignore them. Here are a couple of examples of how the
function should behave...

ADVERTISEMENT

Get Answers For Free

Most questions answered within 1 hours.

ADVERTISEMENT

asked 1 minute ago

asked 8 minutes ago

asked 56 minutes ago

asked 1 hour ago

asked 3 hours ago

asked 3 hours ago

asked 3 hours ago

asked 3 hours ago

asked 3 hours ago

asked 3 hours ago

asked 4 hours ago

asked 4 hours ago