Question

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 a generic function that can test lists with any predicate function if we provided it as one of the inputs.

Write a function list-o f-all? that takes as input a predicate function and a list and tests if all the elements of the list satisfy the input predicate. The function should behave as following:

> (list-o f-all? string? 0 (“a” “b” “42”))

#t

> (list-o f-all? number? 0 (1 2 3 “not-a-number”))

# f

> (list-o f-all? (lambda (n) (and (integer? n) (odd? n))) 0 (1 3 5))

#t

Please do not use the library function listo f for this question. Your solution should be general and should be able to test using any predicate function. Please do not hard code functions such as number? or even? in your implementation.

Answer #1

Here is the complete Dr. Racket code for the given task. I have added comments for a better understanding of the same:

(define (list-of-all? p k l)

(if (null? l) #t ( ; if the list is empty returns true

if(p (car l)) (list-of-all? p (+ k 1) (cdr l)) #f

; Otherwise recurse

)))

*You
can comment below the answer in case of any doubts and I will be
happy to help.*

*Please give a
thumbs up if the answer could be of help!*

*All
the best!*

Use the Design Recipe to write a function
count_evens_NxN, that consumes a
nested list representing a matrix of size
NxN. The function should return the
number of even numbers in the matrix. For
this function, 0 is considered an even
number. Include a Docstring!
Note: You may assume the list argument passed
to the function is a nested list of
integers.
Write 3 assert_equal statements to test your
function.

In R- Studio : Write a function that takes as an input a
positive integer and uses the print() function to print out all the
numbers less than the input integer. (Example: for input 5, the
function should print the numbers 1,2,3,4 { for input 1, the
function should not print a number.) Write a recursive function, do
not use any of the loop commands in your code.

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

5.34 Write a function statement() that takes as input a list of
floating-point numbers, with positive numbers representing deposits
to and negative numbers representing withdrawals from a bank
account. Your function should return a list of two floating-point
numbers; the first will be the sum of the deposits, and the second
(a negative number) will be the sum of the withdrawals.
>>> statement([30.95, -15.67, 45.56, -55.00, 43.78])
[120.29, -70.67]

Create a function called, convert. This function receives a
string parameter called word which only contains digits (the string
represents a positive number) and returns a list of numbers. This
is how the function works:
- This function calculates the number of times each digit has
repeated in the input string and then generates a number based on
that using the following formula and adds it to a list. For
instance, if the digit x has been repeated n times,...

(a) Write an algorithm (use pseudo-code) to determine whether a
function
f ∶ Z100 → Z100 is surjective. That is, supply a “Method” to go
with
Input: A function (array) f with f(i) ∈ Z100 for i = 0, 1, . . . ,
99.
Output: Boolean B. B=‘true’ if f is surjective, ‘false’
otherwise.
Try to make your algorithm as efficient as possible.
Do NOT include an implementation of your algorithm in a programming
language.
(b) How many comparisons...

Solve the following problem using the MATLAB environment
Write a function [approx_root, num_its] = bisection(f,a,b,tol)
that implements the bisection method. You function should take as
input 4 arguments with the last argument being optional, i.e, if
the user does not provide the accuracy tol use a default of 1.0e-6
(use varargin to attain this). Your function should output the
approximate root, approx_root and the number of iterations it took
to attain the root, num_its. However, if the user calls the...

USING MATLAB
Write a program called
QuadProg that determines the roots of a quadratic equation. Use
functions to implement each action. Zip you directory of *.m files
into a single file and turn this in on BBLearn under Class
Activities.
QuadProg
write a function called getInputs to get a
single input value.
write a function called findDiscriminant
write a function called findDenominator
write a function called findRoot
which will be used for both roots
write a function called displayResults
displayResults...

APPLIED STATISTICS 2
USE R CODE ! SHOW R CODE!
Write a function to calculate the sum of cubes from 1 to
n, but skip the multiple of 5. Say, if n=10, the result is
1^3+2^3+3^3+4^3+6^3+7^3+8^3+9^3. The input is the value of n, the
output is the summation. (you need if statement to check whether a
number is a multiple of 5.In R, a%%b is the remainder for a divided
by b. So, we have 10%%5=0)
APPLIED STATISTICS 2
USE...

ADVERTISEMENT

Get Answers For Free

Most questions answered within 1 hours.

ADVERTISEMENT

asked 9 minutes ago

asked 9 minutes ago

asked 18 minutes ago

asked 18 minutes ago

asked 20 minutes ago

asked 26 minutes ago

asked 32 minutes ago

asked 33 minutes ago

asked 34 minutes ago

asked 38 minutes ago

asked 38 minutes ago

asked 41 minutes ago