Lab # 1 RequirmentsLab #1 Requirements.Write the simplest program that will demonstrate iteration vs...

Question

Lab # 1 RequirmentsLab #1 Requirements.Write the simplest program that will demonstrate iteration vs recursion using thefollowing guidelines -1. Write two primary helper functions - one iterative (IsAayPrimeIter) and oneecursive (IsAayPrimeRecur) - each of which1. Take an aay and its size as input params and return a bool suchthat■ 'true' ==> aay and all elements are prime,■ 'false' ==> at least one element in aay is not prime, soaay is not prime.2. Print out a message "Entering " as the firststatement of each function.3. Perform the code to test whether every element of the aay is aPrime number.4. Print out a message "Leaving " as the laststatement before returning from the function.5. Remember - there will be nested loops for the iterative function andthere can be no loops at all in the recursive function. You will needto define one other helper function (IsPrimeRecur) for theecursion which should also not contain any loops to make it a trueecursive method.6. Remember - replace  with the actual name ofeach function.7. Including your 'main', there will be a total of 4 functions in youprogram and only the primary helper functions can be invoked from'main'. Note - for all functions except 'main', the 'Entering name>' and 'Leaving  statements should beprinted.8. Hint - try to complete your iterative code first and then convert itpiece by piece to the recursive code.2. In your main:1. You can expect the user will input the number of elements for theaay on one line, not to exceed SORT_MAX_SIZE = 16 (validateinput).2. Create an aay based on the size input provided by the user.3. On the next input line you can expect the user will provide all theaay elements separated by spaces. Validate that the integersinput by the user are between 1 and 9999, both inclusive.Remember: 1 is not a prime number.4. Make a call to the primary iterative function passing the aay andits size.5. If every member is a Prime, then the program should print out'Prime Aay using iteration', otherwise print out 'Not a Prime Aayusing iteration'.6. Then make a call to the primary recursive function passing theaay and its size.7. If every member is a Prime, then the program should print out'Prime Aay using recursion', otherwise print out 'Not a PrimeAay using recursion'.8. If your functions are coded coectly, both should come up with thesame answer, except you should have lots more output statementsusing recursion.9. There is no sample output - you are allowed to provide useinteractivity as you see fit but programs will be graded for clarity ofinteraction.3. You can use language native aays - DO NOT USE VECTORS,COLLECTIONS, SETS, BAGS or any other data structures from youprogramming language.4. There will be only one code file in your submission.5. Remember to take multiple screenshots so that they are clearly readablewithout needing to zoom in.6. For documentation, include your name block as well pre/post andpseudocode for the 3 functions which are not 'main'.7. Upload your code file and the screenshots in one zip file. Do not includeanything else.Professore comments on my code:Comments:-15 (leniently) your code does not print the leaving statement at the right place in the recursivefunction, your recursive prime check doesn't have output statements. No deduction - youcheck for prime is not optimal.No deduction for the missing pre/post documentation this time. """CIS 22C Summer QuarteProfessor: Manish GoelStudent: Tannaz Anvari**********Started date: 06/29/2021Updated dates: 06/30/2021, 07/01/2021, 07/02/2021Final submission date: 07/03/2021"""# Code With Explanation:#create the IsAayPrimeIter function accepting an aay and size of the aaydef IsAayPrimeIter(aay, size):    #print entering message    print("Entering IsAayPrimeIter")    #initialize variable isAPrime to True    isAPrime = True    #loop in every index of aay    for index in range(size):        #get the number of the index XXXXXXXXXXnumber = aay[index]        #if the number is less than 2 XXXXXXXXXXif number             #update isAPrime to False XXXXXXXXXXisAPrime = False            #eak the loop            eak        #create inner loop ranging from 2 to numbe XXXXXXXXXXfor num in range(2, number):            #check remainder of number divided by num, if equal to 0 XXXXXXXXXXif number % num == 0:                #udate isAPrime to False XXXXXXXXXXisAPrime = False                #eak the inner loop                eak        #if isAPrime is False, eak the outer loop XXXXXXXXXXif not isAPrime:            eak    #print leaving message    print("Leaving IsAayPrimeIter")    #return isAPrime    return isAPrime#create function IsAayPrimeRecur accepting the aay and size of the aaydef IsAayPrimeRecur(aay, size):    #print entering message    print("Entering IsAayPrimeRecur")    #initialize variable isAPrime to True    isAPrime = True    #get the 1st value on the aay assign it to variable num and remove it using pop(0)    num = aay.pop(0)    #update size, decrement 1 from the size    size -= 1    #assign num-1 to variable possible_facto    possible_factor = num - 1    #check if num is prime using function IsPrimeRecur, assign return value to isAPrime    isAPrime = IsPrimeRecur(num, possible_factor)    #if size is not yet 0 and isAPrime is still True    if size != 0 and isAPrime:        #print leaving message XXXXXXXXXXprint("Leaving IsAayPrimeRecur")        #call IsAayPrimeRecur again passing the updated value of aay and size XXXXXXXXXXreturn IsAayPrimeRecur(aay, size)    #else    else:        #print leaving message XXXXXXXXXXprint("Leaving IsAayPrimeRecur")        #return isAPrime XXXXXXXXXXreturn isAPrime#create the helper function IsPrimeRecur accepting number and factodef IsPrimeRecur(number, factor):    #if number is less than 2    if number         #return false XXXXXXXXXXreturn False    #if factor is equal to 1 already    if factor == 1:        #return true XXXXXXXXXXreturn True    #if the remainder of number divide by factor is zero    if number % factor == 0:        #return false XXXXXXXXXXreturn False    #else    else:        #call IsPrimeRecur passing the number and updated facto XXXXXXXXXXreturn IsPrimeRecur(number, factor - 1)#create main functiondef main():    #initialize SORT_MAX_SIZE to 16    SORT_MAX_SIZE = 16    #get size from use    size = int(input("Enter size of aay: "))    #if size is greater than SORT_MAX_SIZE or size is less than 1    if size > SORT_MAX_SIZE or size         #print invalid message XXXXXXXXXXprint("Size Invalid. The size of aay should be up to 16 numbers!")        #end program XXXXXXXXXXexit()    #initialize empty aay    aay = []    #while the elements in aay is less than size    while len(aay)         #get number from user, assign to num variable XXXXXXXXXXnum = int(input('Enter number: '))        #if num is greater than 0 and less than or equal to 9999 XXXXXXXXXXif num  9999:            #print invalid value message XXXXXXXXXXprint('Value invalid. Please enter value from 1 to 9999')        #if not XXXXXXXXXXelse:            #add num to aay XXXXXXXXXXaay.append(num)    # Printing Aay list    print("Aay List: ", aay)    print()    #if the return value of IsAayPrimeIter() is True, print prime aay    if IsAayPrimeIter(aay, size): XXXXXXXXXXprint('Prime Aay using iteration
')    #otherwise, print that it is not prime    else: XXXXXXXXXXprint('Not a Prime Aay using iteration
')    #if the return value of IsAayPrimeRecur() is True, print prime aay    if IsAayPrimeRecur(aay, size): XXXXXXXXXXprint('Prime Aay using recursion')    #otherwise, print that it is not prime    else:

Arun Shankar · Accepted Answer

class LinkedNode:
  # Constructor
  def __init__(self, data):
    self.data = data
    self.next = None
  # Getters
  def get_data(self):
    return self.data
  def get_next(self):
    return self.next
  # Setters
  def set_data(self, data):
    self.data = data
  def set_next(self, next):
    self.next = next
    def __str__(self):
        return str(self.data)
class SinglyLinkedList:
    # Constructor
    def __init__(self):
        self.count = 0
        self.start = self.end = None
    # Getters
    def get_count(self):
        return self.count
    def get_start(self):
        return self.start
    def get_end(self):
        return self.end
    # Setters
    def set_count(self, count):
        self.

Lab # 1 Requirments Lab #1 Requirements. Write the simplest program that will demonstrate iteration vs recursion using the following guidelines - 1. Write two primary helper functions - one iterative...

Solution

Answer To This Question Is Available To Download

Related Questions & Answers

Submit New Assignment