Question

1. Write a Python file containing the following functions. Also turn in the output from testing the functions. All arguments to the functions may be hard-coded.
   1. Function 1 takes a list of strings as a parameter and returns a list of strings consisting of all the strings in the original list that have identical consecutive letters. For example:

fun1 ([llama, good, cat, abba, abab, 112, dog])

returns [llama, good, abba, 112]

2. Function 2 takes an integer (n), representing the number of toggle light switches in a hall. Pressing the switch changes the state of the light from off to on or from on to off. Assume that someone went down the hall n times and for all j, on the jth trip down the hall pressed only those switches whose position number was divisible by j.

Determine the final state of the last bulb (position n) after all trips down the hall are completed. The function should return True for on and False for off.

For example: n is 3 returns False

n is 4 returns True.

3. Function 3 takes an integer (n) and returns the how many numbers less than or equal to n have a return value of True from function 2.

4. Function 4 takes a list of mixed types and returns the number of lists in the list. For example:

fun4 ([1, [A, [2]], B, 3, C, [4, [D, 5]]])

returns the value 4 – for [A [2]], [2], [4, [D, 5]] and [D, 5]   

5. Function 5 takes a list of anything and removes the odd position elements from the list (counting from 0). For example:

fun5 ([A, [A, B], C, D, [A, B]])

returns [A, C, [A, B]]

Answer 1

Thanks for the question.

Question # b and # c is confusing I am unable to provide help on it. Rest all the remaining function has been implemented.

If you could add more clarity to question #b and #c I will do it, no need to post another question for this. Sorry for the inconvenience.


Thank You !

===========================================================================

# a
def fun1(strings):
    consecutive_letter_word_list = []
    for word in strings:

        for i in range(0, len(word) - 1):
            if word[i] == word[i + 1]:
                consecutive_letter_word_list.append(word)
                break

    return consecutive_letter_word_list


print(fun1(['llama', 'good', 'cat', 'abba', 'abab', '112', 'dog']))


# d

def fun4(types):
    count = 0
    for element in types:
        if isinstance(element, list):
            count += 1
            for inner_element in element:
                if isinstance(inner_element, list):
                    count += 1
    return count


c = fun4([1, ['A', [2]], 'B', 3, 'C', [4, ['D', 5]]])
print(c)


# e
def func5(arr):
    count_to_be_deleted = (len(arr) ) // 2
    index=1
    while count_to_be_deleted > 0:
        del arr[index]
        count_to_be_deleted-=1
        index+=1


arr=['A', ['A', 'B'], 'C', 'D', ['A', 'B']]
print('Before deleting: ',arr)
func5(arr)
print('After deleting: ',arr)

=========================================================================

I 1: Proj def funl (strings) : consecutive_letter_word_list = [] for word in strings: for i in range (0, len (word) - 1): if word[i] == word[i + 1]: consecutive_letter_word_list.append(word) break return consecutive_letter_word_list print (funl (['llama', 'good', 'cat', 'abba', 'abab', '112', 'dog'])) def fun 4 (types): count = 0 for element in types: if isinstance (element, list): count += 1 for inner_element in element: if isinstance (inner_element, list): count += 1 return count : Structure : Favorites c = fun4([1, ('A', [2]], 'B', 3, 'C', [4, ['D', 5]]]) print (c)

def func5 (arr) : count_to_be_deleted = (len (arr) ) // 2 index=1 while count_to_be_deleted > 0: del arr[index] count_to_be_deleted-=1 index+=l 1. 7: Structure arr=['A', ['A', 'B'], 'C', 'D', ['A', 'B']] print (arr) func5 (arr) print (arr)