Question

higher order function in 18. Assume you are working with a scheme interpret that does not have a definition for the function 'map'. map is a common list. higher order Scheme. ap typically, takes a list and transforms it by applying a function to each of its elements. It returns the new transformed (fmap sqrt (o 14) For example: (map double '0) (map double (list 1 2 4 5) 3 (0.01.02.00 (2 4 68 10) Write a definition for the function map Write a scheme function that counts the number of items in the given including any nested sub lists Call this function mylength. Do not use the pre list, defined length function or the function flatten.) (9)))))) my-length (1 (2 (3 (4 (5 (6 (8 ngth (1 2 3)

Any help is appreciated , I am working on a practice review for my class.

Answer 1

48. function (define (map fl m) (if (null? m) (cons (fl (car m)) (map double 1 23 4 5)): returns double (eE) (define (double m) (cond ((null? m) ')) ( (ist? (cati m)) (ceas (double (carl m)) (double (cdt (number? m) (list m)) (else (cons 2 (carl m)) (double (dE m))) (gE) (map (lambda (m) (* m 2)) (1 2 3 4 5))

sqrt function (man sat (list 0 1 4)) Answer 0 1 2 (ex) Math sartlo 1 4) (9x) or sat(o 1 4)

49. (define (len L1) (if (null? L1) +1 n (sdx L)) (gx) (define (try lenthlist) ((null? ((list? (cond lengthlist (car '。) lengthlist) (+ (try (car lengthlist)) (try (cdr Lengthlist))) (else (+ 1 (tryicdr lengthlist) 9x) (define (my-lengthm) (cond (null? m) 0) (list? m) (+ (my-length (car m) (my-length (cdm) (else 1)

copyable code

48.

function

(define (map f1 m)

(if (null? m) ’()

(cons (f1 (car m))

(map f1 (cdr m)))))

(map double ’(1 2 3 4 5)) ;

returns double

(or)

(define (double m)

(cond ((null? m) '())

        ((list? (car1 m)) (cons (double (car1 m)) (double (cdr m))))

        ((number? m) (list m))

        (else (cons (* 2 (car1 m)) (double (cdr m))))

        ))           

(or)

(map (lambda (m) (* m 2)) '(1 2 3 4 5))

sqrt function

(map sqrt (list 0 1 4))

Answer

0 1 2

(or)

Math.sqrt(0 1 4)

(or)

sqrt(0 1 4)

49.

(define (len L1)

                  (if (null? L1)

                        0

                        (+ 1 (len (cdr L1)))))

(or)

(define (try lenthlist)
  (cond ((null? lengthlist '0)
        ((list? (car lengthlist) (+ (try (car lengthlist)) (try
          (cdr lengthlist)))
        (else (+ '1 (try(cdr lengthlist))))
))

(or)

(define (my-length m)

  (cond ((null? m) 0)

        ((list? m) (+ (my-length (car m)) (my-length (cdr m))))

        (else 1)))