Write the function print_stats_summary(stats_dict) that takes a dictionary where the keys are student names and the values are tuples containing the minimum, average, and maximum mark, respectively. The function should print the statistics for each student in the format show below. The students should be sorted by name and all the values should be printed to two decimal places. Notes: • You don't need to calculate the average, it is simply the second value in the tuple. For example if the tuple is (1, 10, 11) then the minimum mark is 1, the average is 10 and the maximum is 11. • There are two spaces at the start of each statistic line. For example: Test Result stats = {'Lee': (1.0, 10.0, 11.0), Aroha 'Aroha': (66.339, 76.339, 96.339), Minimum mark: 66.34 'Zip': (56.481, 56.7665, 57.052)} Average mark: 76.34 print_stats_summary(stats) Maximum mark: 96.34 Lee Minimum mark: 1.00 Average mark: 10.00 Maximum mark: 11.00 Zip Minimum mark: 56.48 Average mark: 56.77 Maximum mark: 57.05

Write the function print_stats_summary(stats_dict) that takes a dictionary where the keys are student names and the values are tuples containing the minimum, average, and maximum mark, respectively. The function should print the statistics for each student in the format show below. The students should be sorted by name and all the values should be printed to two decimal places. Notes: • You don't need to calculate the average, it is simply the second value in the tuple. For example if the tuple is (1, 10, 11) then the minimum mark is 1, the average is 10 and the maximum is 11. • There are two spaces at the start of each statistic line. For example: Test Result stats = {'Lee': (1.0, 10.0, 11.0), Aroha 'Aroha': (66.339, 76.339, 96.339), Minimum mark: 66.34 'Zip': (56.481, 56.7665, 57.052)} Average mark: 76.34 print_stats_summary(stats) Maximum mark: 96.34 Lee Minimum mark: 1.00 Average mark: 10.00 Maximum mark: 11.00 Zip Minimum mark: 56.48 Average mark: 56.77 Maximum mark: 57.05

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

The function below, get_value_if_key, takes two arguments: the dictionary data_dict and a key of any type my_key. Fix the code to return the value from data_dict for key my_key if that key exists. The function should not return anything otherwise (i.e. return None).
Q2
4. pet_shopping_list For the purposes of this question, if you have a pet of a certain type, that pet needs food, treats, a bed and a house -- but multiple animals of the same kind can share. This function takes what kind of animal or animals you have and returns a shopping list for your pet or pets. PLAN FOR THIS FUNCTION: determine the word for a single kind of the animal. if the input is "mice", then we want the output to contain "mouse" (don't worry about any other unusual plurals). Otherwise, look for words that end with "es" and remove the final "es", so "foxes" goes to "fox". Otherwise, remove a final "s". Otherwise, assume that the word is singular. build and return a shopping list, which will be a list of strings. shopping lists should be in the shape: ["mouse food", "mouse treats", "mouse bed", "mouse house"] Sample calls should look like: >>> pet_shopping_list("mice")['mouse food', 'mouse treats', 'mouse bed', 'mouse house']>>>…
Define the function print_trophic_class_summary(tli3_values) that accepts a list of trophic level index values and prints a summary outlining the number of lakes in each trophic classification, in order from highest trophic classification to lowest. See the examples for the required format. Notes: Your function must print the summary, not return it. In each state line, the initial number should be formatted with width 3. (Hint: :3 will be helpful) All possible states must be included in the output, even states with zero lakes. The following list will be helpful: ['Hypertrophic', 'Supertrophic', 'Eutrophic', 'Mesotrophic', 'Oligotrophic', 'Microtrophic', 'Ultra-microtrophic'] You must include and use one of your number_in_trophic_class functions (take your pick!), plus your trophic_class function. Basically, you can start with your answer to Question 5 or 6 and add your print_trophic_class_summary function definition after your previous definitions. For example: Test Result…
Q3] Create a new function with the name DrawHPyramid that takes one parameter r, which is the number of rows. This function rather than using the ghạracter it uses + and - to draw the pyramid, use recursion when implementing this function
Find Country Function Name: findCountry() Parameters: capitalList ( list ) Returns: Dictionary mapping each capital to its country( dict ) Description: Given a list of countries' capital cities, write a function that returns a dictionary that maps a capital to its country's name. Note: Assume that all capital cities provided are valid. example test cases: >>> findCountry(('tokyo', 'delhi', 'stockholm']) {'tokyo': 'Japan', 'delhi": 'India', 'stockholm': 'Sweden'} >>> findCountry(l'paris', 'canberra', 'copenhagen']) {'paris': 'France', 'canberra': 'Australia', 'copenhagen': 'Denmark'} For this assignment, use the REST countries API (https://restcountries.com/#api-endpoints-v2). For all of your requests, make sure you to use version 2 of the REST countries API (V2), not version 3 (V3.1). If you make a request with the URL: https://restcountries.com/v2/alpha/usa, you will receive the following response: { "name": "United States of America", "topLevelDomain": [".us"], "alpha2Code": "US",…
# Using the routes dictionary defining places your airline can go with #with mileage to each, create a function that determines the total #distance travelled by going to the airports in sequence defined by this # list itinerary and the routes dictionary. (No published answer... def summary (routesMap) : # Please do not change any code below... airports = list (routesMap.keys ()) for airport in airports: destinations = routesMap [airport] for n in range (0,len (destinations)): destinationInfo = destinations [n] destination = destinationInfo [0] mileage = destinationInfo [1] print (f"Leaving {airport} to {destination} for (mileage} miles.") def distanceUsing (routesMap, itinerary): milesTravelled = 0 ### Your code goes here. return milesTravelled def main (): # Please do not change this dictionary... routes = { main () "Austin": "Chicago": "Dallas": "Denver": "El Paso": "Houston": "Nashville": summary (routes) [["Chicago", 500], ["Houston", 180], ["Nashville", 86011, [["Austin", 500],…
Python code please help, indentation would be greatly appreciated
Write a function called count_duplicates that takes a dictionary as an argument and returns the number of values that appear two or more times.
We can acquire the complement of a DFA by swapping accept and non-accept states. Explain whether this method succeeds to build a TM complement. If yes, describe how; if no, explain why and suggest a TM supplement strategy.
Please use Python code to solve the following questions. Thank you
This code is a part of a C dictionary. Please write the code for the below requirements. dict_get Next, you will implement: char* dict_get (const dict_t* dict, const char* key); This function goes through the list given by dict. If you use the above structure, this means starting at el = dict->head and checking each time whether the key at el is key; if it is not, we set el = el->next, until either key is found, or we reach el == NULL. To compare key with el->key, we need to compare one by one each character in key with those in el->key. Remember that strings in C are just pointers (memory addresses) to the first character in the string, so comparing el->key == key will not do what you want. So how do you even get the length of a string s? You would start at memory location s and advance as long as the byte at s (i.e. *s) is not the end-of-string marker (\0, the NULL character). This can get a bit messy, so luckily, you are allowed to use the string comparison…