Question

*****************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) is true, then (g x) is in the list. The output list's elements should keep the input list's items in the same relative order.

For example (update-if even? add1 '(1 2 3 4)) should evaluate to '(3 5) because 2 and 4 make even? true and add1 turns 2 and 4 into 3 and 5.

#lang racket

(provide update-if)

; do not change any code above this line. Write your code below
it.

(define (update-if f g xs) ... )

FINISH THIS CODE IN RACKET ONLY

Answer #1

```
(define (split left? lst)
(let loop ((lst lst) (a '()) (b '()))
(if (null? lst)
;; you don't need to use values. `cons` or `list` are sometimes preferred
(values (reverse a) (reverse b))
(let ((e (car lst)))
(if (left? e)
(loop (cdr <???>) (cons <???> <???>) <???>)
(loop (cdr <???>) <???> (cons <???> <???>)))))))
(split odd? '(1 2 3 4 ...))
; ==>
; (1 3 ...)
; (2 4 ...)
```

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

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

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.

Write an Oz program (having an Oz recursive function/procedure)
which takes in the input a list, say L, and two positive integers,
M and N. The function should return another list Lâ€™, which
represents the sub-list of L containing all the elements from index
M to index N in reverse order. For example, if the input list is [a
2 g 5 4 k] and M is 2 and N is 5, then the output list should be [4
5...

using dr.racket programing language
If we write a function that tests whether a list contains only
strings, odd numbers, or even numbers, you will notice that the
code that iterates through the list stays the same, with the only
change being the predicate function that checks for the desired
list element. If we were to write a new function for each of the
tests listed above, it would be more error-prone and an example of
bad abstraction. We could write...

In C programming language write a function that takes an integer
n as input and prints the following pattern on the screen:
1 (n times)
2 (n-1 times)
.n (1 time)
For example, if n was 5, the function should print
1 1 1 1 1
2 2 2 2
3 3 3
4 4
5

Please write the code
in Python.
Write a
program/function in any Object-Oriented programming language that
will implement Queue Abstract Data Type with the following
functions/methods. Any build-in/pre-defined Queue
function/library (e.g., java.util.Queue in Java) is
NOT allowed to use in your code.
push(Element): insert the
input Element (e.g., String or Integer in Java) to the end
of the queue.
pop(): remove
the head element of the queue and print the head element on
screen.
count(): return the total number of
elements in the queue...

Write a function num_day that takes a
number in the range of 1 through 7 as a parameter and
returns a string representing the corresponding day of the week,
where 1=Monday, 2 =Tuesday,
3= Wednesday, 4 = Thursday, 5 = Friday, 6 = Saturday, and 7 =
Sunday.
The function should return the string "Error" if the parameter
is that is outside the range of 1 through 7.
You may assume that the parameter will be only numbers.
Save the...

ADVERTISEMENT

Get Answers For Free

Most questions answered within 1 hours.

ADVERTISEMENT

asked 17 minutes ago

asked 17 minutes ago

asked 32 minutes ago

asked 34 minutes ago

asked 41 minutes ago

asked 48 minutes ago

asked 56 minutes ago

asked 59 minutes ago

asked 1 hour ago

asked 1 hour ago

asked 1 hour ago

asked 1 hour ago