uppose there is a class Roster. Roster has one variable, roster, which is a list of tuples containing the names of students and their numerical grades- for example, [('Richard',90), ('Belle',67), ('Christine',85), ('Francine',97)]. Roster has a function findValedictorian that returns the name of the student with the highest grade. Find the valedictorian of the Roster object englishClass and store it in the variable valedictorian. using python

uppose there is a class Roster. Roster has one variable, roster, which is a list of tuples containing the names of students and their numerical grades- for example, [('Richard',90), ('Belle',67), ('Christine',85), ('Francine',97)]. Roster has a function findValedictorian that returns the name of the student with the highest grade. Find the valedictorian of the Roster object englishClass and store it in the variable valedictorian. using python

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter13: Overloading And Templates

Section: Chapter Questions

Problem 20PE

See similar textbooks

Similar questions

Q2: Write aprogram in CT' using OOP to create a class (A) , that contain the iöllowingIUnction:— (drawl) to drawa line Of Stars (Then create a class (B) , with public visibility mode inherit from class (A) ,contain the following function:(draw2) to draw the shape bellow using the tilnction (drawl),
Implement the FindText() function, which has two strings as parameters. The first parameter is the text to be found in the user provided sample text, and the second parameter is the user provided sample text. The function returns the number of instances a word or phrase is found in the string. In the PrintMenu() function, prompt the user for a word or phrase to be found and then call FindText() in the PrintMenu() function. Before the prompt, call cin.ignore() to allow the user to input a new string.Ex: Enter a word or phrase to be found: more "more" instances: 5
a) Implement a class Point with three attributes, x, y, and z.b) Implement an init method with an optional parameter type: 1) Set the default value of x, y, and z to 0.c) Implement a display method to print the values of x, y, and z as the example output below.d) Instantiate two objects of type Point, one with arguments,1, 2, and 3, and the other one without any arguments.e) Call display() to print x, y, and z. Example Output(x, y, z): (1, 2, 3)(x, y, z) : (0, 0, 0)
solve the problem in java:Consider the are n=2 subjects and needed =[4,5]answered questions, to pass.The student has answered =[2,4] questions in the two subjects so far, and can answer another q=1 questions across all subjects combined. The best outcome is to answer an additional question in the second subject on order to pass it, as 2 more answers required to pass the first subject. the max number of subject s that can be passed is 1. the function must return an integer that can represent the max number of subjects that can be passed. public static int maxNumsub(List <Integer> answered, List<Integer> needed, int q){//write code here}
You are given a list of projects and a list of dependencies (which is a list of pairs ofprojects, where the second project is dependent on the first project). All of a project's dependenciesmust be built before the project is. Find a build order that will allow the projects to be built. If thereis no valid build order, return an error.EXAMPLEInput:projects: a, b, c, d, e, fdependencies: (a, d), (f, b), (b, d), (f, a), (d, c)Output: f, e, a, b, d, c
You are given a list of projects and a list of dependencies (which is a list of pairs ofprojects, where the second project is dependent on the first project). All of a project's dependencies must be built before the project is. Find a build order that will allow the projects to be built. If there is no valid build order, return an error.EXAMPLEInput:projects: a, b, c, d, e, fdependencies: (a, d), (f, b), (b, d), (f, a), (d, c)Output: f, e, a, b, d, c
We have a parking office class for an object-oriented parking management system using java Add (implement )a function to the Parking Office class to return a collection of customer ids (getCustomerIds) using java I have attached two class diagrams with definitions of all related classes in our system (i.e car, customer, .....). N.B. Parking office methods in the class definition like register, getcustomer and addcharge have already been implemented, we just need an additional getcustomerID function as mentioned above Explain the code you wrote with a few words
Write a program in C that simulates a checkout line at a supermarket. The line is a queue object. Customers (i.e.,customer objects) arrive in random integer intervals of 1–4 minutes. Also, each customer is served in randominteger intervals of 1–4 minutes. Obviously, the rates need to be balanced. If the average arrival rate is largerthan the average service rate, the queue will grow infinitely. Even with “balanced” rates, randomness can stillcause long lines. Run the supermarket simulation for a 12-hours a day (720 minutes) using the followingalgorithm:1. Choose a random integer from 1 to 4 to determine the minute at which the first customer arrives.2. At the first customer’s arrival time: Determine customer’s service time (random integer from 1 to 4);Begin servicing the customer. Schedule arrival time of next customer (random integer 1 to 4 added to the current time).3. For each minute of the day: If the next customer arrives, Say so, Enqueue the customer.Schedule the arrival time of…
in python """Write a function get_new_grades, such that given a string of grades as an input parameter,returns two objects:the initial grades as a list of numerical valuesas well asa new list with the numerical values, where the scores that are less than 50 are replaced by 50. """
Implement a function called tautology? that takes as input a fully parenthesized formula and returns true if it is a tautology and false otherwise. As was the case in the previous lab, the formula will contain at least one set of parentheses for each operator, but may contain more. The best strategy for doing is to use an insight called Quine's method. It is based on the observation that if a formula, such as (p or (not p)), is a tautology, the result of substituting p with true is a tautology and the result of substituting p with false is also a tautology. This implies a computational strategy: to evaluate whether a formula F is a tautology1. Collect all of the propositional variables.2. Substitute every occurrence of the first variable with #t and every occurrence ofthe same variable with #f3. Make two recursive calls to Tautology? “And” the results.4. When all possible substitutions have been made, i.e., the formula contains onlytruth values, evaluate the formula and return the…
Implement a function called tautology? that takes as input a fully parenthesized formula and returns true if it is a tautology and false otherwise. As was the case in the previous lab, the formula will contain at least one set of parentheses for each operator, but may contain more. The best strategy for doing is to use an insight called Quine's method. It is based on the observation that if a formula, such as (p or (not p)), is a tautology, the result of substituting p with true is a tautology and the result of substituting p with false is also a tautology. This implies a computational strategy: to evaluate whether a formula F is a tautology 1. Collect all of the propositional variables. 2. Substitute every occurrence of the first variable with #t and every occurrence of the same variable with #f 3. Make two recursive calls to Tautology? “And” the results. 4. When all possible substitutions have been made, i.e., the formula contains only truth values, evaluate the formula and return…
Implement the functions marked with ??? package iterators: /** * Returns an iterator that generates the prime numbers * 1,2,3,5,7,11,13,17,19,23,... * (Strictly speaking, 1 is not considered prime in most of the modern definitions as including it causes problems in some other definitions but let's consider it to be a prime in this exercise.) */ def primesIterator: Iterator[Int] = new Iterator[Int]: /* You'll need some private var or val to store the internal state. * Put it/them here */ /** * There is always the next prime number. * In reality, we should return false when the next prime would be larger than that can * be represented with an Int but, for the sake of focusing the exercise on the essential parts, * this consideration is not required for getting the points. */ def hasNext = true /** * Get the next prime number. * The first call should return 1, the next 2, then 3, 5, 7, 11 and so on.…