ANSWER a,b, c only Write a program that will initially create a SORTED list containing the following and then  run the program: Diane Jack Katherine Mitch Robbie   Answer and explain the following questions below: a) If we check the memory location of each element in the list, what would it be? What  index represent each element? b) What happens if we add Morrie in the list? What will be its index value?  c) What does the new list looks like? Where do you think Morrie should be placed  and why?

121: Write a Python program that prompts the user to enter 3 numbers, store these numbers in a list, and then calculate the average of the numbers stored in the list. Your average calcualtion cose should work for any number of items in the list (Hint: use the len() method)

The chapter is nested lists  Create code in python using for loops  Thanks!

write basic python code adn create a list  list_append: adds a new element to the end of the list. then print

**Cenaage Python** Question: A sequential search of a sorted list can halt when the target is less than a given element in the list. Modify the program to stop when the target becomes less than the current value being compared. In a sorted list, this would indicate that the target is not in the list and searching the remaining values is unnecessary. CODE: def sequentialSearch(target, lyst):     """Returns the position of the target item if found,     or -1 otherwise.     The lyst is assumed to be sorted in ascending order."""     position = 0     while position < len(lyst):         if target == lyst[position]:             return position         position += 1     return -1 def main():     """Tests with three lists."""     print(sequentialSearch(3, [0, 1, 2, 3, 4]))     print(sequentialSearch(3, [0, 1, 2]))     # Should stop at second position.     print(sequentialSearch(3, [0, 4, 5, 6])) if __name__ == "__main__":     main()

Perform the following operations utilizing c++ code.N.b array size to be used is ten.a)enqueue() i.e enqueue the list; Two,three,four,five,six,seven and eight and after display enqued list.b)dequeue() i.e delete or remove any two elements in the queue in a) above and after display the updated queue after deletion.c)ISfull() i.e Display if the queue is Full or not.d)Isempty() i.e Display if the queue is Empty or not.e)print() i.e print the final list of the elements of the Queue after performing tasks of a) - d).

Python Smallest and largest numbers in a list   Write a program that reads a list of integers into a list as long as the integers are greater than zero, then outputs the smallest and largest integers in the list. Ex: If the input is: 10 5 3 21 2 -6 the output is: 2 and 21 You can assume that the list of integers will have at least 2 values.

Put the following code in a main.py file and a module.py file. Define the names sort, list_max and sum_of_list after putting the code into a main file and a module file   #predefined modules import random import math #function to sort the list in ascending order def sort(x):     #predefined function sort()     x.sort()     #print the sorted list     print("\nSorted list is: ",str(x)) #function to find the sum of list elements def sum_of_list(x):     #predefined function sum()     Sum=sum(x)     #return the sum of list elements     return Sum #function to list the maximum from the list def list_max(x):     #predefined function max()     maximum=max(x)     #return maximum     return maximum #function to test the above three function def main():     #set a flag variable     flag=True     #create a list     list1=list()     #initialize the list element by using randrange() predefined function of random module     list1=[random.randrange(1, 50, 1) for i in range(0,7)]     #print the…

using python in google colab

5 partition_list (head) This is a little like split_list() from the Short problem, except that, instead of splitting the list into two by cutting it into the middle, you will now build two lists to return, using alternate values. The first value in the input list should be returned at the head of the first new list; the second value should be the head of the second list. Keep on alternating from there, putting one new value on the first list, and one on the second. (But remember that the length of the input list might be odd.) Example Suppose you have the following input list: 10 - 13 -> -1 -> 1000 - 0 It should return the following two lists: 10 1 0 13 -> 1000