Question

Using Scheme:

Write a function absDiff that calculates the absolute difference of the corresponding elements of two lists. The function also evaluates to a list. (absDiff'(1 3 5 6) (3 5 2 1)). - (2 2 3 5). The function must also work if the two input lists are not the same length. We ask you to create two versions of this function: Assume that the missing elements in the shorter list have the value of 0. The result will be of length equal to the longer list. (3 5 2 1)). (absDiffA (1 3 5 6 2 5) > (2 2 3 5 2 5) (3 5 2 1 2 5)) (absDiffA '(1 3 5 6) > (2 2 3 5 2 5) b) Ignore the extra values of the longer list. The result will be of length equal to the shorter list. (3 5 2 1) ). (absDiffB (1 3 5 6 2 5) > (2 2 3 5). (absDiffB '(1 3 5 6) > (2 2 3 5) (3 5 2 1 2 5)).

Answer 1

Code for #1

(define (absDiff lstA lstB)
(if
(and (null? lstA) (null? lstB))
'(0)
(if (eq? (length lstA) (length lstB))
(map (lambda (number1 number2)
(- number1 number2))
lstA
lstB)
'(0))
)
)
(display (absDiff '(10 25) '(12 5)))
(newline)

output:

Result... CPU Time: 8.88 sec(s), Memory: 8372 kilobyte(s) K-2 20) define (absDiff 1stA 1stB) (if and (null? 1stA) (null? 1stB)) (if (eq? (length 1stA) (length 1stB)) (map (1ambda (number1 number2) - numberl number2)) 1stA 1stB) (display (absDiff '(10 25) '(12 5))) (newline)

a)

(define (absDiffA lstA lstB)
(if
(and (null? lstA) (null? lstB))
'(0)
(if (> (length lstA) (length lstB))
(for ([number1 lstA]
[number2 lstB])
(- number1 number2)
)
(if (eq? (length lstA) (length lstB))
(map (lambda (number1 number2)
(- number1 number2))
lstA
lstB))
)
)
)

b)

(define (absDiffB lstA lstB)
(if
(and (null? lstA) (null? lstB))
'(0)
(if (< (length lstA) (length lstB))
(for ([number1 lstA]
[number2 lstB])
(- number1 number2)
)
(if (eq? (length lstA) (length lstB))
(map (lambda (number1 number2)
(- number1 number2))
lstA
lstB))
)
)
)