Question

-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
want to pass a lambda function to "filter" to solve this problem.
Note: (string-length s) evaluates to the length of string s.

Answer #1

A few notes on how to use filter:

filter function takes an anonymous(lambda function) and a list as argument. The filter automatically applies the lambda function to each element of the list and retains only those items which satistfy the condition given in the lambda function [for which lambda returns true].

The program:

```
(define (keep-short-norec x y)
(filter (lambda (i) (< (string-length i) x)) y))
(write (keep-short-norec 3 '("abc" "ab" "a")))
```

Output:

`("ab" "a")`

Also, the filter function maintains the relative order of the items in the list.

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

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 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 Python function that takes two parameters: the first a
list of strings and the second a single string. The function should
return True or False depending on whether the string is in the list
or not. For example, if the list contains eggs, milk, bananas, and
the second parameter is pumpkin, the function should return False.
Thank you.

Write a Python function that takes two parameters: the first a
list of strings and the second a single string. The function should
return True or False depending on whether the string is in the list
or not. For example, if the list contains eggs, milk, bananas, and
the second parameter is pumpkin, the function should return False.
Thank you.

Write a Python function that takes two parameters: the first a
list of strings and the second a single string. The function should
return True or False depending on whether the string is in the list
or not. For example, if the list contains eggs, milk, bananas, and
the second parameter is pumpkin, the function should return False.
Thank you.

Write a Python function that takes two parameters: the first a
list strings and the second a single string. The function should
return True or False depending on whether the string is in the list
or not. For example, if the list contains eggs, milk, bananas, and
the second parameter is pumpkin, the function should return
False.

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

ADVERTISEMENT

Get Answers For Free

Most questions answered within 1 hours.

ADVERTISEMENT

asked 9 minutes ago

asked 40 minutes ago

asked 50 minutes ago

asked 55 minutes ago

asked 58 minutes ago

asked 1 hour ago

asked 1 hour ago

asked 1 hour ago

asked 1 hour ago

asked 1 hour ago

asked 1 hour ago

asked 1 hour ago