The program from the previous question is Pylint compliant (note the appropriate use of global constants, docstrings, and the main function). However, it still has room for improvement. Using the functional decomposition skillsyou learned earlier, refactor the program so that it behaves exactly as before but now defines and calls the following functions:read_int: As defined previously.get_names: Prompts the user for student names and returns them as a list.get_marks: Takes a list of student names, prompts the user for each student's mark, and returns the marks as a mapped list.• grades: Takes a list of marks and returns a mapped list of the corresponding letter grades.• print_results: Takes mapped lists of student names, their marks, and their corresponding grades and prints out the class results.After refactoring, your main function should look like this:def main():""Prompts the user to enter student names and marks,calculates their grades, and prints the resultsnames = get_names ()numerical_marks = get_marks(names)letter_grades = grades (numerical_marks)print_results ( names, numerical_marks, letter_grades)Notes:• The answer box has been pre-loaded with the main function and the headers for each of the required support functions.No function in your program is allowed to be longer than 10 statements.• Be sure to include the entire program, including your call to the main function, in the answer box.For example:TestInput Result# This test simply runs the program,# so make sure you include the call to main() Bella Enter student's name or 'quit' if finished: BellaAngus Enter student's name or 'quit' if finished: AngusEnter student's name or 'quit' if finished: CamEnter student's name or 'quit' if finished: DaniEnter student's name or 'quit' if finished: quitEnter Angus's mark: 51Enter Bella's mark: 67CamDaniquit516778Enter Cam's mark: 7894Enter Dani's mark: 94CLASS RESULTSAngus: C- (51%)Bella: B- (67%)Cam: B+ (78%)Dani: A+ (94%) 1 # YOUR CODE HERE: Write your module docstring here,followed by any global constants.4 def read_int(prompt):*i"Prompts the user for a valid int and returns it."""# YOUR CODE HERE CHint: you already wrote this one earlier.)79 def get_names():10111213"Prompts the user for student names and returns them as a list"""# YOUR CODE HERE14 def get_marks(students):1516171819"Takes a list of student names, prompts the user for each student's mark,and returns the marks as a mapped list.# YOUR CODE HEREdef grades(marks):"Takes a list of marks and returns a mapped list of the correspondingletter grades.# YOUR CODE HERE28 v def print_results(students, marks, letter_grades):*"Takes mapped lists of studént names, their marks, andtheir corresponding letter grades and prints out the class results.# YOUR CODE HEREdef main():"""Prompts the user to enter student names and marks,calculates their grades, and prints the results38names = get_names()numerical_marks = get_marks(names)letter_gradesprint_results(names, numerical_marks, letter_grades)4041grădes(numerical_marks)4345 Imain()

No function in your program is allowed to be longer than 10 statements. • Be sure to include the entire program, including your call to the main function, the answer box. For example: Test Input Result # This test simply runs the program, Angus Enter student's name or 'quit' if finished: Angus # so make sure you include the call to main() Bella Enter student's name or 'quit' if finished: Bella Enter student's name or 'quit' if finished: Cam Enter student's name or 'quit' if finished: Dani Enter student's name or 'quit' if finished: quit Cam Dani quit 51 Enter Angus's mark: 51 67 Enter Bella's mark: 67 78 Enter Cam's mark: 78 94 Enter Dani's mark: 94 CLASS RESULTS Angus: C- (51%) Bella: B- (67%) Cam: B+ (78%) Dani: A+ (94%)

No function in your program is allowed to be longer than 10 statements. • Be sure to include the entire program, including your call to the main function, the answer box. For example: Test Input Result # This test simply runs the program, Angus Enter student's name or 'quit' if finished: Angus # so make sure you include the call to main() Bella Enter student's name or 'quit' if finished: Bella Enter student's name or 'quit' if finished: Cam Enter student's name or 'quit' if finished: Dani Enter student's name or 'quit' if finished: quit Cam Dani quit 51 Enter Angus's mark: 51 67 Enter Bella's mark: 67 78 Enter Cam's mark: 78 94 Enter Dani's mark: 94 CLASS RESULTS Angus: C- (51%) Bella: B- (67%) Cam: B+ (78%) Dani: A+ (94%)

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

Finally, create your own example of a function that modifies a list passed in as an argument. Describe what your function does in terms of arguments, parameters, objects, and references.
Write a program called p3.py that contains a function called reveal_recursive() that takes a word (string) and the length of the word (int) as input and has the following functionality: 1. prints the word where all characters are replaced by underscores 2. continue to print the word revealing one character at a time. i.e., the second line printed should print the first character followed by “_”’s representing the rest of the word. (see example below) 3. the function should end after printing the entire word once. 4. This function should be recursive Example: #the word is kangaroo ________ k_______ ka______ kan_____ kang____ kanga___ kangar__ kangaro_ kangaroo
On Assignment 4, Question 1, you were asked to solve the Assignment Difficulty problem.Now you're working on a function that you could use as part of your solution,and have come up with the following code."""def smallest_score(lst: list[int]) -> int:'''Valid sublists have at least 2 elements.Return the smallest score of any valid sublist of lst.lst is guaranteed to have at least 2 elements.'''in_order = lst[:]in_order.sort()res = in_order[1] - in_order[0]for i in range(len(in_order) - 1):res = min(res, in_order[i+1] - in_order[i])return res"""Unfortunately, your code is not correct.Below, write a Pytest test case that fails,but that should pass if your smallest_score function were correct.Write ONLY the Pytest test case; don't try to fix the busted smallest_score code."""# TODO Your pytest test function here
In this task you will work with the linked list of digits we have created in the lessons up to this point. As before you are provided with some code that you should not modify: A structure definition for the storage of each digit's information. A main() function to test your code. The functions createDigit(), append(), printNumber(), freeNumber(), readNumber() and divisibleByThree() (although you may not need to use all of these). Your task is to write a new function changeThrees() which takes as input a pointer that holds the address of the start of a linked list of digits. Your function should change all of those digits in this linked list that equal 3 to the digit 9, and count how many replacements were made. The function should return this number of replacements. Provided code
Modify the function joinLine so that it right align the line to lengthlineLen by adding the appropriate number of space at the beginning ofthe line. (in Haskell) code: joinLine :: Line -> String joinLine [] = [] joinLine (w:ws) = w ++ " " ++ (joinLine ws)
Look at the differences between max1 and max22. What is the difference?3. Do the two functions do the same amount of computation?4. If so, do you think that the two functions will run in the same amount of time? #include <stdio.h>#include <time.h>#include <stdlib.h> // For the assignment, be sure to run unmodified code, but you are free to // play around with the code to try out different parameters or different// implementations. // arrs is a 16384 element array of 256 integer arrays (a 2D array)// each function is run 50 times (numiters) in order to increase the runtime// into the range of seconds (which is the time printed) int max1(int** arrs, int narrs, int arrlen) { int max = 0; for (int i=0; i<narrs; i++) { for (int j=0; j<arrlen; j++) { if (arrs[i][j] > max) max = arrs[i][j]; } } return max;} int max2(int** arrs, int narrs, int arrlen) { int max = 0; for (int j=0; j<arrlen; j++) { for (int i=0; i<narrs; i++) {…
Trace through (show all the steps as we did in class) for the following java code for the factorial function. Show all the steps (illustrate, do not code) that lead to the final answer when myFactorial(6) is called: int myFactorial( int integer) { if( integer == 1) return 1; else { return(integer*(myFactorial(integer-1); } }
Please answer it in Python Write a double_consonant function , It takes a word as a parameter and has two return values ： A Boolean value equals True If the word contains a double consonant （ The same consonant twice in a row ）, under these circumstances , The second value returned is the double consonant ; If there are no double consonants , Function should return False and None. relevant information ： To simplify the exercise , We don't use words that contain multiple double consonants （ for example ,“successor”） Test your functionality on . Example ： double_consonne('arrivee') vaut True, 'r'.double_consonne('bonbon') vaut False, Nonedouble_consonne('reussite') vaut True, 's'
Please answer it in Python Write a function last_consonant that takes as an argument a word and returns two return values: the index of its last consonant as well as the last consonant (as for lists, we will consider that the index of the first letter is zero). We will not deal with the problematic case where the word does not contain a consonant. Example: last_consonant('arrivee') returns 4, 'v' Write a function double_consonant that takes as an argument a word and has two return values: a Boolean worth True if the word contains a double consonant (twice the same consonant in a row), and in this case the second return value is the consonant that is doubled; If there is no doubled consonant, the function must return False and None. If the word contains several double consonants (for example, 'successor'), true will be returned and the first double consonant appearing in the word. Examples: double_consonant('arrive') is true, 'r'. double_consonant ('candy') is false, None…
You are tasked with writing a small part of a museum's ticketing system. The museum calculates ticket prices using the following rules: $20.00 per admission. Children under 15 get a 50% discount. Seniors (60 years and older) get a 25% discount. Write a Python function that takes a list of customers' ages and returns the total cost for the group. Your function must match the docstring below. You do not need to include the docstring in your solution. '''Function -- get_ticket_costCalculates the cost of museum admission for a group.Parameter:group_ages -- A list of integers representing customer ages.Returns:The total cost for the group, a float. The return value is not rounded.''' Example get_ticket_cost([10, 39, 40]) returns 50.0
Question: First write a function mulByDigit :: Int -> BigInt -> BigInt which takes an integer digit and a big integer, and returns the big integer list which is the result of multiplying the big integer with the digit. You should get the following behavior: ghci> mulByDigit 9 [9,9,9,9] [8,9,9,9,1] Your implementation should not be recursive. Now, using mulByDigit, fill in the implementation of bigMul :: BigInt -> BigInt -> BigInt Again, you have to fill in implementations for f , base , args only. Once you are done, you should get the following behavior at the prompt: ghci> bigMul [9,9,9,9] [9,9,9,9] [9,9,9,8,0,0,0,1] ghci> bigMul [9,9,9,9,9] [9,9,9,9,9] [9,9,9,9,8,0,0,0,0,1] ghci> bigMul [4,3,7,2] [1,6,3,2,9] [7,1,3,9,0,3,8,8] ghci> bigMul [9,9,9,9] [0] [] Your implementation should not be recursive. Code: import Prelude hiding (replicate, sum)import Data.List (foldl') foldLeft :: (a -> b -> a) -> a -> [b] -> afoldLeft =…
‘Write a function nesting(), which takes an arbitrary number of parameters, and returns a list containing the arguments. Write another function unnesting(), which takes a list L as the parameter and retums a 1D list. Notice that, you should be able to use loops to solve thisproblem and should not use recursive functions (which we will not cover in this course). ‘Write assertions to test the two functions.For example nesting(1, nesting(2, 3, nesting(4, 5, [6])), [7, 8], 9)unnesting([1, [2, 3, [4, 5, [6]]], [7. 8], 9]) (1, [2, 3, [4, 5, [6]]], [7, 8], 9][1, 2,3, 4, 5, 6, 7, 8 9]