Question

Important: you are required to use only the functional features of Scheme; functions with an exclama- tion point in their names (e.g., set!) and input/output mechanisms other than load and the regular read-eval-print loop are not allowed. (You may find imperative features useful for debugging. That’s ok, but get them out of your code before you hand anything in.)

1. (10 pts) Write a function atLeast that returns true if a list is at least as long as the argument value, and false otherwise. Use predicate functions and recursion, and assume that the length given is at least 0 (i.e., the first parameter cannot be negative).

> (atLeast 5 ’(1 2 3 4))

#f

> (atLeast 5 ’(2 4 6 8 10))

#t

using the programming language scheme

Answer 1

Code:

(define (atLeast n list) ;;MAIN_FUNCTION
(cond ((= n 0) #t) ;;If n = 0 returns true
((>= (length list) n) #t) ;;if length of list is atleast n then returns true
(else #f))) ;;else returns false

(define (length list) ;;Helper_Function returns the length of list
(cond ((null? list) 0) ;;if list is empty returns 0
(else (+ 1 (length (cdr list)))))) ;;else count element and continue wih rest of the lise

Snapshot of Code and Output: