Consider this scheme function and explain it
Homework Answers
Please let me know if you still need more information:-
-----------------------------------------------------------------------------
Main functionalities are :-
1.iterator
2.condition check for null
check for number if[number] sum the number and recall the
method.
just call the method again
3. this it one type of recursion calling [calling one method itself ]
----------------------------------------------------------------------------
Please find below explanation:-
----------------------------------------------------------------
Thanks
Add Answer to:
Consider this scheme function and explain it
Consider the following Scheme function: (define f (lambda (1st)...
Explain the evaluation of the following Scheme code: (define x 10) (define y 11) (define proc2...
Explain the evaluation of the following Scheme code: (define x 10) (define y 11) (define proc2 (lambda () (cons x (cons y '())))) (define proc1 (lambda (x y) (proc2))) (define main (lambda () (cond ((zero? (read)) (proc1 5 20)) (else (proc2))))) (main)
Using Racket Recursion, tail-recursion, high-order functions and functional programming. 1. Modify our filter function so that...
Using Racket Recursion, tail-recursion, high-order functions and functional programming. 1. Modify our filter function so that it is tail-recursive. You may use the letrec form but do not use any additional forms and functions besides those we've talked about in class. (define filter (lambda (input-list func) (cond ((null? input-list) '()) ((func (car input-list)) (cons (car input-list) (filter (cdr input-list) func))) (else (filter (cdr input-list) func))))) 2. Test your filter function on '(25 -22 44 56...
In scheme coding language Write a function filterN that returns only the numbers n through m...
In scheme coding language Write a function filterN that returns only the numbers n through m from a lat. For example: (filterN 4 6 (1 turkey 5 9 4 bacon 6 cheese)) returns (5 4 6). Use only functions add1, sub1, and, or, <, >, null?, number?, zero?, define, lambda, cond, and else in the code. Assume n < m
Which of the following statements best describes the following function. (define foo (lambda (L) (if (null?...
Which of the following statements best describes the following function. (define foo (lambda (L) (if (null? L) foo (or (null? (car L)) (foo (cdr L))) ) This is not a tail-recursive function but can easily be transformed into a tail- recursive function by using a helper function This is not a recursive function This is not a tail-recursive function and cannot be easily be transformed into a tail-recursive function This is not a tail-recursive function but can easily be transformed...
urgent please Consider the following Scheme program' (define mult *) (define div /) (define myfunc (lambda...
urgent please Consider the following Scheme program' (define mult *) (define div /) (define myfunc (lambda (arg1 arg2 arg3) (arg3 arg1 arg2))) If this program were used to evaluate the expression (myfunc 6 3 div), what numerical value would be assigned to this expression?
7. Suppose that the equal 1ists function (page 49 of Sebesta) is called with the lists...
7. Suppose that the equal 1ists function (page 49 of Sebesta) is called with the lists ((A (B)) (C) ) and ((A (B)) (C)) as the arguments. How many calls of equal lists will be performed altogether, including the original call and all recur- sive calls? The following is an example of a Lisp program: Lisp Example function The following code defines a Lisp predicate function that takes two lists as arguments and returns True ;if the two lists are...
Use scheme to solve this: MUST USE A COMBINATION OF MAP AND FILTER or MAP AND...
Use scheme to solve this:
MUST USE A COMBINATION OF MAP AND FILTER or MAP AND
APPLY:
THIS ANSWER IS NOT WHAT I NEED:
(define perfect-square-helper
(lambda (x y)
(if (null? x)
(reverse y)
(if (integer? (sqrt (car x)))
(perfect-square-helper (cdr x) (cons (car x) y))
(perfect-square-helper (cdr x) y)))))
(define perfect-square
(lambda (x)
(perfect-square-helper x '())))
(define x '(1 2 9 16 5 64))
(perfect-square x)
Map/Apply/Filter 7. Perfect Squares (10 Points) Using a combination of map, apply and/or...
USING SCHEME PROGRAMMING LANGUAGE define a function addSubList that processes a list of lists of numbers...
USING SCHEME PROGRAMMING LANGUAGE define a function addSubList that processes a list of lists of numbers and adds up all sub-lists. The output of your function is a flat list of numbers. (You can assume that your function only receives valid input). Example: (define Q '(1 2 (3 4) 1 5 (7 8))) ;;;;;;;;;;;;;;;;;;;;; ; (addSubList Q) ; => '(1 2 7 1 5 15) ;;;;;;;;;;;;;;;;;;;
1. Explain the function/purpose of the following sequence of program statements by expressing the postcondition and...
1. Explain the function/purpose of the following sequence of program statements by expressing the postcondition and then prove that the program is correct using the axiomatic verification method. Precondition: {x = A and y = B} t=x x=y y=t Postcondition:________________ 2. Prove that the following grammar is ambiguous. <stmt> -> <assign> | <if-stmt> <assign> -> <id> := <expr> <if-stmt> -> if <bool> then <stmt> | if <bool> then <stmt> else <stmt> Modify the grammar above to make it unambiguous: 3....
LISP lambda calculate， expression 3) Consider reducing the following λ-expression to its normal form. Show the...
LISP lambda calculate， expression
3) Consider reducing the following λ-expression to its normal form. Show the sequence of normal order reductions the sequence of applicative order reductions. · · 4) Consider the following function: Fx) ifx-0) then return 0 else return x+1 a) Express F as a lambda calculus expression b) Evaluate F(0) as a lambda expressiorn c) Evaluate F(1) as a lambda expression HINT: Use the representations introduces in Section 10. 5) Describe a function to compute the sum...
Explain the evaluation of the following Scheme code: (define x 10) (define y 11) (define proc2 (lambda () (cons x (cons y '())))) (define proc1 (lambda (x y) (proc2))) (define main (lambda () (cond ((zero? (read)) (proc1 5 20)) (else (proc2))))) (main)
Which of the following statements best describes the following function. (define foo (lambda (L) (if (null? L) foo (or (null? (car L)) (foo (cdr L))) ) This is not a tail-recursive function but can easily be transformed into a tail- recursive function by using a helper function This is not a recursive function This is not a tail-recursive function and cannot be easily be transformed into a tail-recursive function This is not a tail-recursive function but can easily be transformed...
7. Suppose that the equal 1ists function (page 49 of Sebesta) is called with the lists ((A (B)) (C) ) and ((A (B)) (C)) as the arguments. How many calls of equal lists will be performed altogether, including the original call and all recur- sive calls? The following is an example of a Lisp program: Lisp Example function The following code defines a Lisp predicate function that takes two lists as arguments and returns True ;if the two lists are...
Use scheme to solve this:
MUST USE A COMBINATION OF MAP AND FILTER or MAP AND
APPLY:
THIS ANSWER IS NOT WHAT I NEED:
(define perfect-square-helper
(lambda (x y)
(if (null? x)
(reverse y)
(if (integer? (sqrt (car x)))
(perfect-square-helper (cdr x) (cons (car x) y))
(perfect-square-helper (cdr x) y)))))
(define perfect-square
(lambda (x)
(perfect-square-helper x '())))
(define x '(1 2 9 16 5 64))
(perfect-square x)
Map/Apply/Filter 7. Perfect Squares (10 Points) Using a combination of map, apply and/or...
LISP lambda calculate， expression
3) Consider reducing the following λ-expression to its normal form. Show the sequence of normal order reductions the sequence of applicative order reductions. · · 4) Consider the following function: Fx) ifx-0) then return 0 else return x+1 a) Express F as a lambda calculus expression b) Evaluate F(0) as a lambda expressiorn c) Evaluate F(1) as a lambda expression HINT: Use the representations introduces in Section 10. 5) Describe a function to compute the sum...
Most questions answered within 3 hours.
-
what is the duistribution channels of HUL in india and how they
distribute?
how is this...
asked 1 minute ago -
Batteries play an important role in our everyday lives. From
making many devices mobile, to allowing...
asked 13 minutes ago -
It is possible to iterate through an array quickly and easily
using a loop?
asked 21 minutes ago -
Determine the pHpH of an HFHF solution of each of the following
concentrations. The KAKA value...
asked 16 minutes ago -
Two point charges of 7.0mL are initially 11.5m apart. What is
the change in potential energy...
asked 18 minutes ago -
Please write as a short answer
You have heartburn and a two hour working session on...
asked 22 minutes ago -
Please solve with excel and mention the excel function.
Thanks
Kevin deposits $10,000 in a savings...
asked 24 minutes ago -
Which Special Journal would the following transaction be
journalized in?
Sold merchandise on account to Customer...
asked 36 minutes ago -
Assuming 100% dissociation, calculate the freezing point (?fTf)
and boiling point (?bTb) of 1.45 ? K3PO4(aq)1.45...
asked 38 minutes ago -
An inflated helium balloon with a volume of 0.35L at
sea level (1.0 atm) was allowed...
asked 40 minutes ago -
Python 3.0 Please
Write a function that takes, as arguments, a binary string, a
list of...
asked 1 hour ago -
(a) Calculate the momentum of a 2150 kg elephant charging a
hunter at a speed of...
asked 55 minutes ago