Question

plz in Scheme

b. [2 marks] Create a function (alternate listi list2) that creates a list by alternating elements from the two given input lists. E.g.: (alternate '(0 000) '(1 1 1 1 1 1)) + (010101 c. [2 marks] Create a procedure (count x L) that returns the number of instances of the value x in the list L. E.g.: (count 3 '(1 4 3 6 2 3 3 1 4 3 5 7)) + 4 (count 'b'(4 b a 32 c b1 b2 da)) + 3 d. [4 marks] Create a procedure (mode L) that returns the most common value in the list L. Hint: this question is asking that you find the item with the largest count. In the case of a tie return the value closest to the front of the list (ie the first one encountered). E.g., (mode '(a bac add a b ca b)) → a (mode '(2 ba 3 2 c bi b 2 d a)) + 2 e. [5 marks] Create a procedure (decreasing L) that returns a list of all of the consecutive decreasing subseqeuences in the input list. E.g. (decreasing '(3 6 8 9 7 4 8 6 3)) + ((974) (14) (decreasing '(7 6 5 4 8 5 2 5 1 5 2 1)) + ((7 6 5 4 (decreasing '(1 2 3 4 5)) ()

Answer 1

def alternate(list1,list2):

    i=0

    j=0

    new_list=[]

    while(i<len(list1) and j<len(list2)):

        new_list.append(list1[i])

        new_list.append(list2[j])

        i+=1

        j+=1

    while(i<len(list1)):

        new_list.append(list1[i])

        i+=1

    while(j<len(list2)):

        new_list.append(list2[j])

        j+=1

    return new_list

def count_x(x,new_list):  #x is a number to be counted

    return new_list.count(x)

def max_count(new_list):

    num_counts={}

    a=set(new_list)

    a=tuple(a)

    for number in new_list[::-1]:

        num_counts[number]=new_list.count(number)

    return max(num_counts)

def decreasing_instance(new_list):

    dec_nums=[]

    temp=[]

    flag='t'

    for i in  range(len(new_list)-1):

        if(new_list[i]>new_list[i+1]):

            if(flag=='t'):

                temp.append(new_list[i])

                flag='f'

            temp.append(new_list[i+1])

        elif(new_list[i]<new_list[i+1]):

            dec_nums.append(temp)

            flag='t'

            temp=[]

    for k in dec_nums:

        if len(k)==0:

            dec_nums.remove(k)

    dec_nums.remove([])

    return dec_nums

if __name__=='__main__':

    list1=list(map(int,input('Enter elements in list 1(Separated by space):').split()))

    list2=list(map(int,input('Enter elements in list 1(Separated by space):').split()))

    new_list=alternate(list1,list2)

    while(1):

        print('\n1.Print alternate list')

        print('\n2.Count any number')

        print('\n3.Maximum counts of any number')

        print('\n4.Decreasing instances from alternate list')

        print('\n5.Exit')

        choice=int(input('Enter your choice:'))

        if choice==1:

            print(new_list)

        elif choice==2:

            x=int(input('Enter any number to count:'))

            print(count_x(x,new_list))

        elif choice==3:

            print(max_count(new_list))

        elif choice==4:

            print(decreasing_instance(new_list))

        elif choice==5:

            import sys

            sys.exit()

#code written in python