Artificial Intelligence Practice with Scheme 1. Write a function in Scheme to re

Question

Artificial Intelligence

Practice with Scheme

1. Write a function in Scheme to return –1, 0, +1 depending on two parameters a and b:

a < b return –1

a > b return +1

a = b return 0

2. Write a recursive function in Scheme, called “get-element” which takes two parameters, an index and a list. The function returns the element at the given index position in the list or #f if element is not contained. Indices start at 1 and go to the length of the list.

3. Question: How would you change the function so it returns the whole list if the element is not contained?

Explanation / Answer

I have writing a code in python

def dependencyFun(a,b):
if a<b:
return -1
elif a>b:
return 1
elif a==b:
return 0
x=dependencyFun(4,5)
print (x)
OUTPUT: -1

2
def get_element(index,list):
length=len(list)
if(index<=length-1):
return list[index-1]
else:
return '#f'
list=[1,2,3,4,5,6]
y=get_element(3,list)
print (y)
OUTPUT : 3
3:
def get_elementOrList(index,list):
length=len(list)
if(index<=length-1):
return list[index-1]
else:
return list
list=[1,2,3,4,5,6]
z=get_element(6,list)
print (z)
OUTPUT: 6

If you want some other language please mention ,

which language you want

Related Questions

Navigate

• Browse (All)
• Browse A
• Subjects

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.