CodingExam2.py

# Jacob Auman
#CS152 Coding Exam 2


def generatingNewList(lst1, lst2):
    newLst = []
    if len(lst1) != len(lst2):
        print('Inputs not the same length!')
        newLst = []
    else:
        for index in range(len(lst1)):
            if (lst1[index] % 2 == 0) and (lst2[index] % 2 == 0):
                newLst.append(lst1[index] + lst2[index])
            elif (lst1[index] % 2 != 0) and (lst2[index] % 2 != 0):
                newLst.append(lst1[index] * lst2[index])
            else:
                newLst.append(lst1[index] - lst2[index])

    return newLst

    # '''
    # Generates a new list based on the following rules:
    #     - compare elements in the same index for both lists
    #
    #     - if the elements in the same index on lst1
    #     and lst2 are both even, add those elements and
    #     store the result in the same index in the new list
    #
    #     - if the elements in the same index on lst1
    #     and lst2 are both odd, multiply those elements and
    #     store the result in the same index in the new list
    #
    #     - if one of the element in the same index is even and
    #     the other element in the same index is odd, subtract
    #     the element in lst2 from lst1
    #
    #     For example:
    #     lst1   = [ 2,  3, 40, 7]
    #     lst2   = [10,  5, 15, 2]
    #     newLst = [12, 15, 25, 5]
    #
    # This function will return the new list when both parameters
    # (lst1 and lst2) have the exact same length.
    # If the parameters do not have the same length, the
    # function will return an empty list.
    #
    # Parameters
    # ----------
    # lst1 : non empty list of integers
    #
    # lst2 : non empty list of integers
    #
    #
    # Returns
    # -------
    # newLst: a new list considering the rules described above
    #         or an empty list if the parameters have a
    #         different length
    #
    # '''


def generateListPrime(lst):
    prime_lst = []
    for val in lst:
        if val > 1:
            for i in range(2, val):
                if (val % i) == 0:
                    break
            else:
                prime_lst.append(val)
    return prime_lst

     # '''
    # From the parameter lst, generate a new list containing the numbers of lst
    # that are prime numbers. Prime numbers are numbers greater than 1.
    # They only have two factors, 1 and the number itself.
    # This means these numbers cannot be divided by any number other than 1
    # and the number itself without leaving a remainder.
    #
    # Parameters
    # ----------
    # lst : list
    #     list of positive integer numbers.
    #
    # Returns
    # -------
    # A new list containing only the prime numbers presented in the lst parameter
    #
    # '''

def main():
    print("Making the calls of the implemented methods")
    # call the method generateListPrime
    # if the method return an empty list you need to print
    # "No prime number in the list"
    # if the list returned is not empty you will print the list
    # that was returned

    # call the method generatingNewList
    # if the method returns an empty list you need to print
    # "Not possible to generate the new list"
    # if the list returned is not empty, print the list
    # that was returned

    #Testing
    print("Testing", "\n",
        generatingNewList([2, 3, 40, 7], [10, 5, 15, 2]) ,"\n",  # the function would return [12, 15, 25, 5]
        generatingNewList([2, 4, 6, 8], [10, 20, 30, 40]), "\n",   # the function would return [12, 24, 36, 48]
        generatingNewList([3, 5, 7, 9], [11, 1, 5, 3]), "\n",  # the function would return [33, 5, 35, 27]
        generatingNewList([2, 3], [10, 5, 15, 2]) ,"\n",  # the function would return []
        generatingNewList([2, 4], [40]), "\n",  # the function would return []
        generateListPrime([7, 9, 3, 11, 15, 12, 21, 41]), "\n",  # the function would return [7, 3, 11, 41]
        generateListPrime([4, 6, 8, 10, 12]),"\n" # the function would return []
    )

if __name__ == "__main__":
    main()