Downloads/CSE110 Lab Assignment 7 (Sortin xO localhost:8890/notebooks/Downloads/CSE110%20Lab%20Assignment%207%20(Sorting%20and%20Searching).ipynbjupyter CSE110 Lab Assignment 7 (Sorting and Searching) Last Checkpoint: 11 minutes ago (autosaved)LogoutFileEditViewInsertCellKernelWidgetsHelpTrustedPython 3 O> RunCodeMuskElonTuringAlanTask 6Suppose you have a list named my_list as given below. Your task is to sort the list in ascending order and print the count of numbers that have changed theirpositions in the process of sorting.my_list = [4, 2, 3, 1, 6, 5]Sorted list would be [1, 2, 3, 4, 5, 6] where 4 numbers (4, 1, 6 and 5) have changed their positions. Therefore our sample output here would be 4. Pleasecheck if your code is working correctly by changing the above list and using the knowledge given here to verify whether your code gives correct output for alldifferent lists.Sample Output for the above list4In [ ]:Task 7Write a python program that takes two lists from the user, merges the two lists, sorts the resulting list, and then finds the median of the elements in the twolists.Sample Input 1list_one = [1, 2, 1, 4]list_two = [5, 4, 1]9:22 PM12/27/2021

NOTE - As per our guideline we are supposed to solve only one question, please repost other parts as…

Answered: Task 6 Suppose you have a list named…

Computer Networking: A Top-Down Approach (7th Edition)

7th Edition

ISBN:9780133594140

Author:James Kurose, Keith Ross

Publisher:James Kurose, Keith Ross

Chapter1: Computer Networks And The Internet

Section: Chapter Questions

Problem R1RQ: What is the difference between a host and an end system? List several different types of end...

See similar textbooks

Similar questions

1. The codewords will be scrambled words. You will read the words used for the codes from a file and store it into an array. There are 60 words in the file that range in size from 3 characters to 7 characters. The file is called wordlist.txt and can be found attached to the assignment in IvyLearn.2. Start with input for an integer seed for the random number generator. There is no need to put a prompt before the cin operation.3. Ask the Player if they are ready to play and only proceed if they type a Y or y. If the user types an N or n then the program should finish. a. INPUT VALIDATION: Make sure the user has typed either y, Y, n, or N4. Create a variable to keep track of the number of guesses the user has made.5. Use the random number generator to pick a word from the list of words.6. Once you have chosen a word as the codeword you will need to scramble the letters to make it into a code. You should use the random number generator to help you mix up the letters.7. Display to the user…
28. You are given a name arranged in bibliography (reverse) format. This line of names is then read and stored in a list so that the first element is the last name, the middle element is a comma and the last element is the first name (Assuming: the author's name only consists of 2 words). You are asked to rewrite the name in the standard format: First name + Last name. Which of the following program code fits the task? Sample Input: Putro , Hanson Sample Output : Hanson Putro A name - input ().split () print (name (1] +" +name (2) } name - input (). split () print (name (1] +" tname [0]) B C name - input ().split () print (name (2] +" "+name (0] ) name - input().split () print (name (0] +" "+name (1) ) D
Complete the doctring.def average_daily_temp(high_temps: List[int], low_temps: List[int]) -> List[float]: """high_temps and low_temps are daily high and low temperatures for a series of days. Return a new list of temperatures where each item is the daily average. Precondition: len(high_temps) == len(low_temps) >>> average_daily_temp([26, 27, 27, 28, 27, 26], [20, 20, 20, 20, 21, 21]) [23.0, 23.5, 23.5, 24.0, 24.0, 23.5] """
A user is going to enter numbers one at a time, entering 'q' when finished. Put the numbers in a list, sort it in numerical order, and print out the list. Then print out the middle element of the list. (If the list has an even number of elements, print the one just after the middle.) Remember that a list 1st of numbers can be sorted numerically by calling 1st.sort(), and can be printed with print(1st). You can assume that every entry is either a valid integer or is the letter 'q'. Examples: If the input is 4 3 6 7 3 q The output is [3, 3, 4, 6, 7] 4 If input is 4 3 6 7 3 2 q The output is [2, 3, 3, 4, 6, 7] 4
Written in python with docstrings if applicable. Thanks
***NEED HELP WITH THIS**** write a code that replicates the list's insert() method. Recall that insert(index, item) method inserts the item at specified index in the list. Write a code that: Asks the user to input 5 items in a list and display the list. Ask the user to input the index where they would like to insert a new item. Ask the user to input the item that they would like to insert into the list. Inserts the new item into the list and displays the modified list. If the index is greater than the length of the list, simply insert the new item at the end of list. Also i dont need to use the list's insert() method to do this program. I dont need to write a function, just the code to replicate the functionality of insert() method.
How do I make a program that keeps track of a phone speed dialer directory which has 5 fixed slots, without changing the starter code. # Program to simulate a speed dialer# Complete the functions listed below that work with# two lists that manage a dialer with 5 fixed slots.def printList(names,numbers):'''function to show the current dialer data as shown in sample runs'''#Implement this functionpassdef updateSlot(names,numbers):'''Function to handle update by slot number command whichprompts the user for the slot number to be updatedUses try-except to handle error cases:if slot number not within valid rangeif user enters non-integer inputIf slot number is valid, thenprompts the user for the new name and new numberand updates entries for the slot number.prints "Updated slot number X" where X is the slot number user entered.'''#Implement this functionpassdef dialByName(names,numbers):'''Function to handle dial by name command whichprompts the user for the namechecks if the name is…
Instructions Write a program to test various operations of the class doublyLinkedList. Your program should accept a list of integers from a user and use the doubleLinkedList class to output the following: The list in ascending order. The list in descending order. The list after deleting a number. A message indicating if a number is contained in the list. Output of the list after using the copy constructor. Output of the list after using the assignment operator. An example of the program is shown below: Enter a list of positive integers ending with -999: 83 121 98 23 57 33 -999 List in ascending order: 23 33 57 83 98 121 List in descending order: 121 98 83 57 33 23 Enter item to be deleted: 57 List after deleting 57 : 23 33 83 98 121 Enter item to be searched: 23 23 found in the list. ********Testing copy constructor*********** intList: 23 33 83 98 121 ********Testing assignment operator*********** temp: 23 33 83 98 121 Your program should use the value -999 to denote the end of the…
Write a function called find_duplicates which accepts one list as a parameter. This function needs to sort through the list passed to it and find values that are duplicated in the list. The duplicated values should be compiled into another list which the function will return. No matter how many times a word is duplicated, it should only be added once to the duplicates list. NB: Only write the function. Do not call it. For example: Test Result random_words = ("remember","snakes","nappy","rough","dusty","judicious","brainy","shop","light","straw","quickest", "adventurous","yielding","grandiose","replace","fat","wipe","happy","brainy","shop","light","straw", "quickest","adventurous","yielding","grandiose","motion","gaudy","precede","medical","park","flowers", "noiseless","blade","hanging","whistle","event","slip") print(find_duplicates(sorted(random_words))) ['adventurous', 'brainy', 'grandiose', 'light', 'quickest', 'shop', 'straw', 'yielding']…
Using Clojure Write a procedure, called count-to-1, that takes a positive integer n, and returns a list of the integers counting down from n to 1. For example, given input 3, it will return (list 3 2 1). Hint: Use the procedures reverse and count-to-n that you wrote in the previous problems. (Shown in attached image)
Complete the method “readdata”. In this method you are to read in at least 10 sets of student data into a linked list. The data to read in is: student id number, name, major (CIS or Math) and student GPA. You will enter data of your choice. You will need a loop to continue entering data until the user wishes to stop. Complete the method “printdata”. In this method, you are to print all of the data that was entered into the linked list in the method readdata. Complete the method “printstats”. In this method, you are to search the linked list and print the following: List of student’s id and names who are CIS majors List of student’s id and names who are Math majors List of student’s names along with their gpa who are honor students (gpa 3.5 or greater) All information for the CIS student with the highest gpa (you may assume that different gpa values have been entered for all students) CODE (student_list.java) You MUST use this code: package student_list;import…
Write a procedure called check_if_odd_time. The function will be accepting a list as a parameter. The list will contain numbers between 1 and 60 which represent minutes. Analyse the numbers.In the order that the numbers occur in the parameter list. Print the number, followed by the statement "This minute is odd." if it is an odd number. Or print "Not an odd minute." if it is an even number.NB: The apostrophes ("") around the messages are not displayed in the print. They are there to help you copy paste the statements in your code. Look at the output of the examples.Do not call the procedure. For example: Test Result check_if_odd_time([1, 4, 5]) 1This minute is odd.4Not an odd minute.5This minute is odd.

Recommended textbooks for you

Computer Networking: A Top-Down Approach (7th Edi…

Computer Engineering

ISBN:

9780133594140

Author:

James Kurose, Keith Ross

Publisher:

PEARSON

Computer Organization and Design MIPS Edition, Fi…

Computer Engineering

ISBN:

9780124077263

Author:

David A. Patterson, John L. Hennessy

Publisher:

Elsevier Science

Network+ Guide to Networks (MindTap Course List)

Computer Engineering

ISBN:

9781337569330

Author:

Jill West, Tamara Dean, Jean Andrews

Publisher:

Cengage Learning

Computer Networking: A Top-Down Approach (7th Edi…

Computer Engineering

ISBN:

9780133594140

Author:

James Kurose, Keith Ross

Publisher:

PEARSON

Computer Organization and Design MIPS Edition, Fi…

Computer Engineering

ISBN:

9780124077263

Author:

David A. Patterson, John L. Hennessy

Publisher:

Elsevier Science

Network+ Guide to Networks (MindTap Course List)

Computer Engineering

ISBN:

9781337569330

Author:

Jill West, Tamara Dean, Jean Andrews

Publisher:

Cengage Learning

Concepts of Database Management

Computer Engineering

ISBN:

9781337093422

Author:

Joy L. Starks, Philip J. Pratt, Mary Z. Last

Publisher:

Cengage Learning

Prelude to Programming

Computer Engineering

ISBN:

9780133750423

Author:

VENIT, Stewart

Publisher:

Pearson Education

Sc Business Data Communications and Networking, T…

Computer Engineering

ISBN:

9781119368830

Author:

FITZGERALD

Publisher:

WILEY

SEE MORE TEXTBOOKS