Use Scheme Language Write a Scheme function that takes a list and returns a list identical...

Use Scheme Language

Write a Scheme function that takes a list and returns a list identical to the parameter except the third element has been deleted. For example, (deleteitem '(a b c d e)) returns ‘(a b d e) ; (deleteitem '(a b (c d) e)) returns ‘(a b e).

Expert Solution

Code to Copy;

   (define (deleteitem list)
   (unless (or (null? list)
               (null? (cdr list))
               (null? (cddr list)))
       (set-cdr! (cdr list) (cdddr list)))
   list)

(display (deleteitem '(a b c d e)))

(display (deleteitem '(1 2 3 4 5)))

(display (deleteitem '(a b (c d) e)))

Output Screenshots:

i). output for (display (deleteitem '(a b c d e)))

ii). output for (display (deleteitem '(1 2 3 4 5)))

iii). output for (display (deleteitem '(a b (c d) e)))

venereology answered 2 years ago

scheme: Write a recursive Scheme function (subst x y L), which returns a list identical to...

scheme: Write a recursive Scheme function (subst x y L), which returns a list identical to L except that every occurrence of x has been replaced with y. The following example illustrates the use of this function: > (subst 'c 'k '(c o c o n u t)) (k o k o n u t) Write a recursive Scheme function (all-different? L), which determines whether all elements of list L are distinct (that is, not equal?). The following example illustrates...

Write a Scheme function that takes a list of integers and returns all odd integers on...

Write a Scheme function that takes a list of integers and returns all odd integers on the list in the original order: (odd-numbers `(2 4 9 16 25 7)) (9 25 7) Hint: 2 (remainder 13 5) 3 Please explain every step

Write a Scheme function that takes a positive integer n and returns the list of all...

Write a Scheme function that takes a positive integer n and returns the list of all first n positive integers in decreasing order: (decreasing-numbers 10) (10 9 8 7 6 5 4 3 2 1) Please explain every step

Write a Scheme function that takes two integers and returns the list of all integer numbers...

Write a Scheme function that takes two integers and returns the list of all integer numbers between these two integers (inclusively) in increasing order. (numbers 10 20) (10 11 12 13 14 15 16 17 18 19 20) Please explain every step.

Write a function that takes a list of integers as input and returns a list with...

Write a function that takes a list of integers as input and returns a list with only the even numbers in descending order (Largest to smallest) Example: Input list: [1,6,3,8,2,5] List returned: [8, 6, 2] Do not use any special or built in functions like append, reverse etc.

Write a Python function that takes a list of integers as a parameter and returns the...

Write a Python function that takes a list of integers as a parameter and returns the sum of the elements in the list. Thank you.

Write a Python function that takes a list of integers as a parameter and returns the...

Write a Python function that takes a list of integers as a parameter and returns the sum of the elements in the list. Thank you.

We were asked this: Write a function that takes a list, and returns a list representing...

We were asked this: Write a function that takes a list, and returns a list representing each word whose reverse is also in the list. def find_reversals(lst: List[str]) -> List[str]: Each pair, such as 'abut', 'tuba', should be represented by the first element encountered. Don't report the same pairs twice. Don't list palindromes. I wrote this, which might not be optimal but passes the unit test! def find_reversals(lst): #Place to save to found_reversals=[] #Make each string lowercase for i...

USING PYTHON, write a function that takes a list of integers as input and returns a...

USING PYTHON, write a function that takes a list of integers as input and returns a list with only the even numbers in descending order (Largest to smallest) Example: Input list: [1,6,3,8,2,5] List returned: [8, 6, 2]. DO NOT use any special or built in functions like append, reverse etc.

1.Write a function div7(lst) which takes in a list of integers, and returns a list of...

1.Write a function div7(lst) which takes in a list of integers, and returns a list of booleans of the same length, such that for each integer in the original list, the boolean in the output list is True if that integer was divisible by 7, or False if not. Use list comprehensions in python, the function only could be at most two lines long. Here is some examples: >>> div7([14, 5, 7, 3, 29, 28, 10]) [True, False, True, False,...

Question

Use Scheme Language Write a Scheme function that takes a list and returns a list identical...

Solutions

Expert Solution

Related Solutions

scheme: Write a recursive Scheme function (subst x y L), which returns a list identical to...

Write a Scheme function that takes a list of integers and returns all odd integers on...

Write a Scheme function that takes a positive integer n and returns the list of all...

Write a Scheme function that takes two integers and returns the list of all integer numbers...

Write a function that takes a list of integers as input and returns a list with...

Write a Python function that takes a list of integers as a parameter and returns the...

Write a Python function that takes a list of integers as a parameter and returns the...

We were asked this: Write a function that takes a list, and returns a list representing...

USING PYTHON, write a function that takes a list of integers as input and returns a...

1.Write a function div7(lst) which takes in a list of integers, and returns a list of...