Write a class called Person that has two private data members - the person's name and age. It should have an init method that takes two values and uses them to initialize the data members. It should have a get_age method.Does the code have a get_age method? def std_dev(list) :sum = 0for p in list:sum += p.ageavg = sum/len(list)# variance is average of squares of difference of each number and their averagesquare_sum = 0;for p in list:square_sum += (p.age-avg)**2var = square_sum/len(list)# standard deviation is root of variancestd = var**0.5return stdclass Person:def_init_(self, name, age):self.name = nameself.age = agepl = Person("John", 36)p2 = Person("Rick", 49)p3 = Person("Kylie", 28)person_list = [p1,p2,p3]answer =std_dev(person_list)print("standard daviation is : ", answer)

The given code doesn't have get_age method Algorithm: Start Define a class with name and age as…

Write a class called Person that has two private data members - the person's name and age. It should have an init method that takes two values and uses them to initialize the data members. It should have a get_age method. Does the code have a get_age method

Write a class called Person that has two private data members - the person's name and age. It should have an init method that takes two values and uses them to initialize the data members. It should have a get_age method. Does the code have a get_age method

Np Ms Office 365/Excel 2016 I Ntermed

1st Edition

ISBN:9781337508841

Author:Carey

Publisher:Carey

Chapter3: Performing Calculations With Formulas And Functions

Section: Chapter Questions

Problem 3.9CP

See similar textbooks

Similar questions

get_total_cases() takes the a 2D-list (similar to database) and an integer x from this set {0, 1, 2} as input parameters. Here, 0 represents Case_Reported_Date, 1 represents Age_Group and 2 represents Client_Gender (these are the fields on the header row, the integer value represents the index of each of these fields on that row). This function computes the total number of reported cases for each instance of x in the text file, and it stores this information in a dictionary in this form {an_instance_of_x : total_case}. Finally, it returns the dictionary and the total number of all reported cases saved in this dictionary.
During tough times like these, investment becomes more uncertain with more dangers. To solve it, we might try to train a model to decide when to buy or sell. Therefore, to provide it with correct data, we plan to design an algorithm that answers: what is the perfect moment to buy and when to sell to maximize your profit? Assume you must buy Input: changes : array listing changes in the prices, where indices represent days; it has at least two values Output: i : index of the change before which we buy j: index of the change before which we sell maxProfit : the profit of this interval Example: Assume the below table contains the prices of a particular stock over days prices changes Day Value 50 1 63 13 70 7 3 40 -30 55 15 65 10 6 60 -5 7 72 12 8 79 7 9 68 -11 10 74 6 Therefore, the output of maxProfit([13,7,-30,15,10, -5,12,7, -11,6]) should be (3, 7, 39) . This is because our maximum profit would be 39 when we buy the stock at day 4, index of 3, and sell after day 8, index of 7. Then,…
PYTHON prov_records_per_date() takes a 2-D list (similar to the database) and an integer representing the province ID. This function returns another 2-D list, where each element of this list stores information in the following format. [ [day1, total number of patients (both icu and non-icu) in this provice reported in day1], [day2, total number of patients (both icu and non-icu) in this provice reported in day2], ... ] >>> results = prov_records_per_date(database, 35) >>> display_dict(result) >>> display_list(result) ['2022-01-31', 239] ['2022-02-05', 393] >>> results = prov_records_per_date(database, 10) >>> display_dict(result)['2022-02-02', 225] >>> results = prov_records_per_date(database, 81) >>> display_dict(result)No data in list
ntify the choice that best cómpleles 1. The following procedure is intended to return the number of times the value val appears in the list myList. The procedure does not work as intended. Line 01: PROCEDURE countNumOccurences (myList, val) Line 02: { Line 03: FOR EACH item IN myList Line 04: } Line 05: count 0 Line 06: IF(item = val) %3D } count count + 1 Line 07: Line 08: Line 09: { Line 10: } Line 11: RETURN(count) Line 12: } Which of the following changes can be made so that the procedure will work as intended? a. Moving the statement in line 5 so that it between lines 2 and 3 c. Changing line 6 to IF(myList[item] = val) appears b. Changing line 6 to IF(item = count) d. Moving the statement in line 11 so that it appears between lines 9 and 10 1.
from typing import List, Tuple, Dict from poetry_constants import (POEM_LINE, POEM, PHONEMES, PRONUNCIATION_DICT, POETRY_FORM_DESCRIPTION) # ===================== Provided Helper Functions ===================== def transform_string(s: str) -> str: """Return a new string based on s in which all letters have been converted to uppercase and punctuation characters have been stripped from both ends. Inner punctuation is left untouched. >>> transform_string('Birthday!!!') 'BIRTHDAY' >>> transform_string('"Quoted?"') 'QUOTED' >>> transform_string('To be? Or not to be?') 'TO BE? OR NOT TO BE' """ punctuation = """!"'`@$%^&_-+={}|\\/,;:.-?)([]<>*#\n\t\r""" result = s.upper().strip(punctuation) return result def is_vowel_phoneme(phoneme: str) -> bool: """Return True if and only if phoneme is a vowel phoneme. That is, whether phoneme ends in a 0, 1, or 2. Precondition:…
Complete the calculate_average () function that takes a list of integers called numbers as its parameter. The function returns the average of the integers in this list, which is calculated as follows: 1. Only non-negative integer values are considered when calculating the average. 2. If the integer 99999 is encountered in the list, subsequent integers are not considered when calculating the average. 3. The integer 99999 is not considered when calculating the average. 4. If there are no non-negative integers encountered before the integer 99999, then the average is set to 0.0. The function returns the average rounded to 2 decimal places. For example: Test numbers = [-6, 4, 6, -10, 17, 17, 18, 99999, 18, 6] print("The average value is:", calculate_average (numbers)) numbers = [99999, -8, -8, 0, 5, 17, -8, 4, -2, -17] print("The average value is:", calculate_average (numbers)) Result The av The av
What precautions should be taken when using the STRING_SPLIT function for large datasets?
int[] list = {-35,4,-50,2} and the length= 4 details based on the given tracking Show the value of low, high, indexOfMin, min, swapping and the call. Sort the list and show the steps in table. The first function call is sort(list, 0, list.length - 1); The source code is eprivate static void sort(int [] list, int low, int high) { if (low < high) { // Find the smallest number and its index in list(low .. high) int indexOfMin = low; int min = list[low]; for (int i = low + 1; i <= high; i++) { e if (list[i] < min) { min = list[i]; indexOfMin = i; }// if }// for // Swap the smallest in list(low .. list[indexOfMin] list[low] = min; // Sort the remaining list(low+1 sort(list, low + 1, high); }// outer if } // end of function high) with list(low) list[low]; high) low high if (low < high) IndexOfmin=low min=list[low]i list[i] < min list min = indexOfMin = i; list[i] Swapping: list[indexOfMin] list[low];
List pressure_data contains integers read from input, representing data samples from an experiment. Initialize variable sum_passed with 0. Then, for each element in pressure_data that is both at an odd-numbered index and greater than 65: Output 'Index ', followed by the element's index, ': ', and the element's value. Increase sum_passed by each such element's value. # Read input and split input into tokenstokens = input().split() pressure_data = []for token in tokens: pressure_data.append(int(token)) print(f'All data: {pressure_data}') ''' Your code goes here ''' print(f'Sum of selected elements is: {sum_passed}')
Domino cycledef domino_cycle(tiles):A single domino tile is represented as a two-tuple of its pip values, such as (2,5) or (6,6). This function should determine whether the given list of tiles forms a cycle so that each tile in the list ends with the exact same pip value that its successor tile starts with, the successor of the last tile being the first tile of the list since this is supposed to be a cycle instead of a chain. Return True if the given list of domino tiles form such a cycle, and False otherwise. tiles Expected result [(3, 5), (5, 2), (2, 3)] True [(4, 4)] True [] True [(2, 6)] False [(5, 2), (2, 3), (4, 5)] False [(4, 3), (3, 1)] False
reverse_number_in_list(number_list:list)-> list  This function will be given a list of numbers your job is to reverse all the numbers in the list and return a list with the reversed numbers. If a number ends with 0 you need to remove all the trailing zeros before reversing the number. An example of reversing numbers with trailing zeros: 10 -> 1, 590 -> 95. None of the numbers in the number_list will be less than 1. Example: number_list = [13, 45, 690, 57] output = [31, 54, 96, 75]
hdex mplete the following function according to its docstring using a while loop. The lists we test will not all be sho cribed in English. If you fail any test cases, you will need to read the description and make your own test. def smaller_index(items: list[int]) -> int: 3\ Return the index of the first integer in items that is less than its index, 4. or -1 if no such integer exists in items. 6. >>> smaller_index([2, 5, 7, 99, 6]) 7. -1 8 >>> smaller_index([-5, 8, 9, 16]) 9. 10 >>> smaller_index([5, 8, 9, 0, 1, 3]) 11 3 12 for i in range (len(items)): if items [i] < i: 13 14 15 return i 16 return -1 History X Your solution passed 0 out of 6 cases!