Part 1: Sin Tax Syntax [NEW PROBLEM] Complete the function sin_tax, which computes and returns the total cost to purchase several items, some of which might be subject to sin taxes. The function takes three arguments: items: a list of items to purchase (strings). If an item appears more than once, this means we want to buy it more than once. prices: a dictionary that maps an item (string) to its price (float) • tax rates: a dictionary that maps an item (string) to its sin tax rate (float). The rate is given as a decimal (e.g., 0.08 to represent 8%). ● If an item from items does not appear in tax rates, then that item is not subject to a sin tax. Assume that every string in items is a valid key in prices. Example #1: items: ['beer', 'wine', 'cigarettes'] prices {'beer': 18.95, 'cigarettes': 12, "wine': 20.0} tax rates: {'beer': 0.03, 'cigarettes': 0.1, 'wine': 0.05) 53.72 Returned: Example #2: items: ['wine', 'beer', 'wine', 'cigarettes', 'wine'] prices: {'beer': 15.5, 'cigarettes': 13, soda': 8.0, 'wine': 25.0} tax rates: {'beer': 0.035, 'cigarettes': 0.12, 'wine' : 0.07} Returned: 110.85

Part 1: Sin Tax Syntax [NEW PROBLEM] Complete the function sin_tax, which computes and returns the total cost to purchase several items, some of which might be subject to sin taxes. The function takes three arguments: items: a list of items to purchase (strings). If an item appears more than once, this means we want to buy it more than once. prices: a dictionary that maps an item (string) to its price (float) • tax rates: a dictionary that maps an item (string) to its sin tax rate (float). The rate is given as a decimal (e.g., 0.08 to represent 8%). ● If an item from items does not appear in tax rates, then that item is not subject to a sin tax. Assume that every string in items is a valid key in prices. Example #1: items: ['beer', 'wine', 'cigarettes'] prices {'beer': 18.95, 'cigarettes': 12, "wine': 20.0} tax rates: {'beer': 0.03, 'cigarettes': 0.1, 'wine': 0.05) 53.72 Returned: Example #2: items: ['wine', 'beer', 'wine', 'cigarettes', 'wine'] prices: {'beer': 15.5, 'cigarettes': 13, soda': 8.0, 'wine': 25.0} tax rates: {'beer': 0.035, 'cigarettes': 0.12, 'wine' : 0.07} Returned: 110.85

C++ for Engineers and Scientists

4th Edition

ISBN:9781133187844

Author:Bronson, Gary J.

Publisher:Bronson, Gary J.

Chapter7: Arrays

Section7.5: Case Studies

Problem 3E

See similar textbooks

Similar questions

▾ Part 2: Course Registration The time has come to register for courses at Stony Brook University. Complete the function register, which takes three arguments: a dictionary that maps a course's name to its number of credits (course_credits); a list of courses a student wants to take (courses); and a maximum number of credits the student is willing to take (max_credits). The function iterates over the courses list and attempts to register the student for each course, in sequence (use a for-loop, not a while-loop). "Registering" for a course means to add the number of credits of a course to a running total. If registering for a course would bring the total number of credits over max_credits, skip that course and continue on to the next one in the courses list. The function returns the total number of credits the students successfully registered for. Example #1: register ({'MAT 131': 4, 'PHY 131': 3, 'AST 200': 1, 'WRT 102': 3, 'PHY 133': 1}, ['MAT 131', 'WRT 102'], 12)) Return value: 7…
Data structures find_color(colors:set, values:list) -> list The function will have two parameters. The first parameter is a set of strings known as Colors. A second parameter is a list of tuple-2 known as Values. Colors will contain a set of randomly selected colors. Values will contain a list of tuples of size 2. Each tuple will contain color (str) and a number (int). The function should look at each tuple in Values. For each tuple, add the number (the second value in the tuple) to a list of numbers if the color in the tuple (the first value in the tuple) is in Colors. In other words, find all tuples that have a color in the Colors and add the tuples numbers to a list. Finally, the function should return the list of numbers collected in the order they are found in the values list. Example: Colors: {'black', 'pink', 'yellow'} values: [('green', 100), ('yellow', 13), ('red', 6)] Expected: [13] Colors: {'yellow'} values: [('black', 54), ('pink', 5)] Expected: [] Colors: {'black',…
python exercise: Write a Python function called get_top_students that takes the list of dictionaries as input and returns a dictionary containing the name and GPA of the top two students in the list. Each dictionary has the following keys: "name", "age", "major", and "gpa".
Data structures dict_from_string(dict_str:str)->dict This function will be given a single parameter, a string representing a dictionary. Your job is to convert the string into an actual dictionary and return the dictionary. Make sure all key-value pairs in the string exist in the newly created dictionary. The string will contain only numbers or single letters as key values pairs. Make sure all letters are kept as strings and all numbers are converted to integers in the newly created dictionary. Example: String Input: '{9: 'V', 'G': 0, 'M': 9, 'u': 3, 2: 'o', 8: 'u', 'q': 9, 'D': 1}' Expected: {9: 'V', 'G': 0, 'M': 9, 'u': 3, 2: 'o', 8: 'u', 'q': 9, 'D': 1} String Input: '{10: 'D', 1: 'Z', 5: 'a'}' Expected: {10: 'D', 1: 'Z', 5: 'a'} String Input: '{'M': 2, 'V': 0, 3: 'x', 6: 'J', 5: 'J', 7: 'T', 8: 'P', 4: 'q', 1: 'h'}' Expected: {'M': 2, 'V': 0, 3: 'x', 6: 'J', 5: 'J', 7: 'T', 8: 'P', 4: 'q', 1: 'h'} String Input: '{3: 'D', 10: 'T', 7: 'm', 'u': 9, 't': 5, 6: 'Z', 'H': 10, 'B':…
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
C++ language Write a program that creates a list of 10 cars. Each car has the following information:1. Registration No2. Model: e.g., 20103. Made: e.g., GLI4. Purchase PriceAlso, create functions to delete and modify a car
Homework Assignment-1Topics: Functions, Dictionary, ImportProblem description: Write a python application to simulate an online clothing system. Thepurpose of this assignment is to gain experience in Python dictionary structure, create basicPython functions and import a module.Design solution: The template file contains a list of clothes item sold, each item in the listcontains the item id, name of the item and the prices. The program will generate an items_dictwhere each key is the item id of the cloth and the values will be a list of item name and priceinformation. A customer will be presented with a main menu with 4 different options: displayall items, add an item to cart, checkout and exit the program. A customer can buy an item byentering the ID of the item. This program implements a dictionary called cart, where each key isthe item id and the values are the list of name, price and quantity that user chooses topurchase. The program keeps repeating by displaying the main menu to…
Question > Not complete Marked out of 1.50 Flag question Previous page Write a recursive function named get_palindromes (words) that takes a list of words as a parameter. The function should return a list of all the palindromes in the list. The function returns an empty list if there are no palindromes in the list or if the list is empty. For example, if the list is ["racecar", "hello", "noon", "goodbye"], the function should return ["racecar", "noon"]. A palindrome is a word that is spelled the same forwards and backwards. Note: The get_palindromes() function has to be recursive; you are not allowed to use loops to solve this problem. For example: Test words = ["racecar", "hello", "noon", "goodbye", "test", 'aibohphobia'] ['racecar', 'noon', 'aibohphobia'] print (get_palindromes (words)) print (get_palindromes ([])) print (get_palindromes (['this', 'is', 'test'])) Answer: (penalty regime: 0, 0, 5, 10, 15, 20, 25, 30, 35, 40, 45, 50 %) Result Precheck Check [] [] Next page
String Manipulation In this question, you will be implementing the following functions int findChar(char * str, char c); Searches for the character c in the string str and returns the index of the character in the string. If the character does not exist, returns -1 int replaceChar(char * str, char c1, char c2); Searches for the character c1 in the string str and if found, replace it with c2.The function returns the number of replacements it has performed. If the character does not exist, returns 0. int removeChar(char * str1, char * str2, char c); Creates a copy of str1 into str2 except for the character c that should be replaced with ‘*’ For example, if str1=”Hello World” and c=’l’ then the function should make str2=”He**o Wor*d” int isPalindrome(char * str) Checks to see if a string is Palindrome(reversible). If it is, returns 1, otherwise returns 0. A palindrome string reads similarly from left to right and from right to left like madam, level, radar, etc. int reverseString(char…
Python Write a function that takes a string argument and returns a dictionary data structure containing the number of times each letter occurs in the string.
Description Write a short program that will define a function called make_book that will have 3 parameters: book_title book_author book_length with a default value of 100 It will return a dictionary with the keys 'title', 'author', and 'length'. You will then call this function 2 times (not in a loop): • The first time specifying all parameters by order: Ulysses by James Joyce with 762 pages • The second time specifying the title and author by keyword: The Odyssey by Homer And print the dictionary returned by the function in a simple print statement. Specification • You should submit a single file called MidtermExam3.py • It should follow the submission standards outlined above. The assignment name will be Midterm Exam 3 • Each print statement should be sent a single f-string as an argument or nothing at all. For example: • Don't do this: print("My variable is ", myvarl) • This is ok: print (f"My variable is (myvar1}") • This is ok: print() Hard-code There is nothing to hard-code in…
palindromes Write a function palindromes that accepts a sentence as an argument. The function then returns a list of all words in the sentence that are palindromes, that is they are the same forwards and backwards. Guidelines: • punctuation characters .,;!? should be ignored • the palindrome check should not depend on case Sample usage: >>> palindromes ("Hey Anna, would you prefer to ride in a kayak or a racecar?") ['Anna', 'a', 'kayak', 'a', 'racecar'] >>> palindromes ("Able was I ere I saw Elba.") ['I', 'ere', 'I'] >>> palindromes ("Otto, go see Tacocat at the Civic Center, their guitar solos are Wow!") ['Otto', 'Tacocat', 'Civic', 'solos', 'wow'] >>> palindromes ("Otto, go see Tacocat at the Civic Center, their guitar solos are wow!")==['Otto', 'Tacocat', 'Civic', 'solos', 'wow'] True