1. Create/Make grades.py to do the following:a) Create an empty list named grades.b) Add the following grades one at a time to grades.92, 51, 83, 37, 72Output Example:c) Compute the total of these grades using the index to reference each number in grades.[92, 51, 83, 37, 72]Average: 67.00d) Compute the average of these grades using the len method.Median: 83e) Print the average with a precision of two decimal places.[92, 83, 72]Average: 82.33f) Compute the location of the median grade using the len method.g) Print the median grade using index syntax.h) Remove all failing grades (lower than 60) one at time from the list.i) Print the updated list of grades.i) Print the updated average.Average = the sum of all elements divided by the number of elementsMedian = the middle element in a list of elements

below is the asked code with snapshot of output:

Answered: 1. Create/Make grades.py to do the…

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

10 - question You should use a Set instead of a List if you want to avoid duplicates (True/False)? a. True b. False
Inserting Nodes into the List In the following code (This is Code By C) : there are 3 functions : display, insert_begin, and delete. The request is add two functions : First Function (insert_last) : to insert values from last. Second Function (insert_mid): to insert values from Middle. The code: #include<stdio.h>#include<string.h>#include<stdlib.h>#include<math.h> struct node{int info;struct node* next;}; struct node* start; void display();void insert_begin(); void delete(); int main(){ int choice;start = NULL; while (1){printf("\n\t\t MENU \t\t\n");printf("\n1.Display\n");printf("\n2.Insert at the beginning\n");printf("\n3.Insert at the end\n");printf("\n4.Delete\n");printf("\n5.Exit\n"); printf("Enter your choice:\t");scanf_s("%d", &choice); switch (choice){case 1:display();break;case 2:insert_begin();break;case 3:delete();break;case 4:exit(0);break;default:printf("\nWrong Choice.\n");break;} }return 0;} void display(){struct node* temp;if (start ==…
For each of the following Python list methods indicate whether the method mutates the list. Write "yes" if the method mutates the list or "no" if the method does not mutate the list. append sort reverse index insert count remove pop
The elements in the set cannot be accessed using indexing and slicing, choose whether this statement is true or false. a. True b. False Clear my choice
Please answer the ques
def city_dict(adict): """ Question 6 -Given a dictionary that maps a person to a list of countries they want to travel to, return a dictionary with the value being the list sorted by the last letter in each countries name. If two countries have the same last letter, sort by the first letter. -For an extra challenge, try doing this in one line (Optional). Args: adict (dict) Returns: dict >>> city_dict({"Pablo": ["Belgium", "Canada", "Germany"], "Athena": ["Italy", "France", "Egypt"], "Liv": ["Japan", "Bolivia", "Greece"]}) {'Pablo': ['Canada', 'Belgium', 'Germany'], 'Athena': ['France', 'Egypt', 'Italy'], 'Liv': ['Bolivia', 'Greece', 'Japan']} >>> city_dict({"Jacob": ["Bahamas", "Brazil", "Chile"], "Lexi": ["Colombia", "Finland", "Panama"], "Emily": ["Ireland", "Russia", "Kenya", "Jordan"]}) {'Jacob': ['Chile', 'Brazil', 'Bahamas'], 'Lexi': ['Colombia', 'Panama', 'Finland'], 'Emily': ['Kenya',…
4 ete t of With the following lists: list1 = [x + y for x in ['a', 'b', 'c'] for y in ['1', '2', '3']] list2 = [[x + y for x in ['a', 'b', 'c']] for y in ['1', '2', '3']] which option is true? Select one: A. len(list1)> len(list2) B. 'a1' is an element (or subelement) for list1 whereas '1a' is for list2 C. list1 and list2 will error because numbers and letters cannot be added. D. Both A and B are true.
PYTHON QUESTION This assignment requires you to create a dictionary by reading the text file created for the Chapter 6 assignment. The dictionary should have player names for the keys. The value for each key must be a two-element list holding the player's goals and assists, respectively. See page 472! Start with an empty dictionary. Then, use a loop to cycle through the text file and add key-value pairs to the dictionary. Close the text file and process the dictionary to print the stats and determine the top scorer as before. In fact, much of the code used in program6_2.py can be copied and used for this program. Printing the stats for each player is the most challenging part of this program. To master this, refer to the examples in the zip file that can be downloaded from the "Dictionary values can be lists" link in the "Learn Here" part of this module. NOTE: you do not need to submit the text file. Submit just this program. The required output should be the same well-formatted table…
As part of this assignment, the program that you will be writing will store current grades in a dictionary using course codes as keys and with values consisting of percent grades in lists. The main functions of this program are to print a student's gradebook, to drop the lowest grade in each course, print the student's gradebook again, drop the course with lowest average, and finally printing the student's gradebook again. This program requires a main function and a custom value-returning function. In the main function, code these basic steps in this sequence (intermediate steps may be missing): start with an empty dictionary that represents a gradebook and then use a while loop to allow the input of course codes from the keyboard. End the while loop when the user presses enter without entering data.within the while loop:for each course entered, use a list comprehension to generate five random integers in the range of 70 through 100. These random integers in a list represent the…
Write the following function that partitions the list using the first element, called a pivot:def partition(lst): After the partition, the elements in the list are rearranged so that all the elements before the pivot are less than or equal to the pivot and the element after the pivot are greater than the pivot. The function also returns the index where the pivot is located in the new list. For example, suppose the list is [5, 2, 9, 3, 6, 8]. After the partition, the list becomes [3, 2, 5, 9, 6, 8]. Implement the function in a way that takes len(lst) comparisons. Write a test program that prompts the user to enter a list and displays the list after the partition.
Add distribution function in code Requirement 4: DESCENDING ORDER (NOT ASCENDING ORDER) 4. Produce a list of all vaccines and their distributed quantities . The system should allow the employees to list all distributed vaccines and their accumulated quantities read from the dist. txt file. Note: The vaccines and their distributed quantities need to be sorted in descending order (with highest quantity listed first followed by second highest and so on) using Bubble sort before displaying on the screen. MY CODE: #include <stdio.h> #include <stdlib.h> #include <string.h> // Function Declarations void create_inventory(); void update_vacc_qty(); int search_vaccine(); void display_vaccine(); // Main Function starts here int main() { create_inventory(); display_vaccine(); search_vaccine(); //update_vacc_qty(); return 0; } //Function to Create Vaccine.txt as per the given table void create_inventory() { int option = 1; // variables to collect data as per table given char…
In the function below, return the last element (the one at the last index) of the list provided as the parameter called list1. Assume that the argument is a list.

SEE MORE QUESTIONS

Recommended textbooks for you

Database System Concepts

Computer Science

ISBN:

9780078022159

Author:

Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:

McGraw-Hill Education

Starting Out with Python (4th Edition)

Computer Science

ISBN:

9780134444321

Author:

Tony Gaddis

Publisher:

PEARSON

Digital Fundamentals (11th Edition)

Computer Science

ISBN:

9780132737968

Author:

Thomas L. Floyd

Publisher:

PEARSON

Database System Concepts

Computer Science

ISBN:

9780078022159

Author:

Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:

McGraw-Hill Education

Starting Out with Python (4th Edition)

Computer Science

ISBN:

9780134444321

Author:

Tony Gaddis

Publisher:

PEARSON

Digital Fundamentals (11th Edition)

Computer Science

ISBN:

9780132737968

Author:

Thomas L. Floyd

Publisher:

PEARSON

C How to Program (8th Edition)

Computer Science

ISBN:

9780133976892

Author:

Paul J. Deitel, Harvey Deitel

Publisher:

PEARSON

Database Systems: Design, Implementation, & Manag…

Computer Science

ISBN:

9781337627900

Author:

Carlos Coronel, Steven Morris

Publisher:

Cengage Learning

Programmable Logic Controllers

Computer Science

ISBN:

9780073373843

Author:

Frank D. Petruzella

Publisher:

McGraw-Hill Education

SEE MORE TEXTBOOKS