Computers and Technology, 09.04.2020 04:31 vanessa7714102010

(1) Output a menu of automotive services and the corresponding cost of each service. (2 pts) Ex: Davy's auto shop services Oil change -- $35 Tire rotation -- $19 Car wash -- $7 Car wax -- $12

(2) Prompt the user for two services from the menu. (2 pts) Ex: Select first service: Oil change Select second service: Car wax

(3) Output an invoice for the services selected. Output the cost for each service and the total cost. (3 pts) Davy's auto shop invoice Service 1: Oil change, $35 Service 2: Car wax, $12 Total: $47

(4) Extend the program to allow the user to enter a dash (-), which indicates no service. (3 pts)

Ex: Select first service: Tire rotation Select second service: - Davy's auto shop invoice Service 1: Tire rotation, $19 Service 2: No service Total: $19

Has to work in Python 3

Answers: 1

Show answers

Another question on Computers and Technology

Computers and Technology, 21.06.2019 21:30

Asuccessful format string attack attempted to steal user account information by reading from unauthorized memory. answer the followings with proper explanation a)this attack will lead to violation of which security policies?

Answers: 2

Answer

Computers and Technology, 22.06.2019 01:00

)a grad student comes up with the following algorithm to sort an array a[1..n] that works by first sorting the first 2/3rds of the array, then sorting the last 2/3rds of the (resulting) array, and finally sorting the first 2/3rds of the new array. 1: function g-sort(a, n) . takes as input an array of n numbers, a[1..n] 2: g-sort-recurse(a, 1, n) 3: end function 4: function g-sort-recurse(a, `, u) 5: if u â’ ` â‰¤ 0 then 6: return . 1 or fewer elements already sorted 7: else if u â’ ` = 1 then . 2 elements 8: if a[u] < a[`] then . swap values 9: temp â† a[u] 10: a[u] â† a[`] 11: a[`] â† temp 12: end if 13: else . 3 or more elements 14: size â† u â’ ` + 1 15: twothirds â† d(2 â— size)/3e 16: g-sort-recurse(a, `, ` + twothirds â’ 1) 17: g-sort-recurse(a, u â’ twothirds + 1, u) 18: g-sort-recurse(a, `, ` + twothirds â’ 1) 19: end if 20: end function first (5 pts), prove that the algorithm correctly sorts the numbers in the array (in increasing order). after showing that it correctly sorts 1 and 2 element intervals, you may make the (incorrect) assumption that the number of elements being passed to g-sort-recurse is always a multiple of 3 to simplify the notation (and drop the floors/ceilings).

Answers: 3

Answer

Computers and Technology, 22.06.2019 10:50

Write a 3-4 page apa formatted paper comparing your organization’s it strategy with the best practices outlined in your course text. content should include, but not be limited to: developing and delivering on the it value, developing it strategy for the business value and linking it to business metrics. your paper should include an abstract and a conclusion and a reference page with 3-5 references

Answers: 1

Answer

Computers and Technology, 22.06.2019 17:50

Farah works in an office with two other employees. all three share a printer and an internet connection. the utility that makes this possible is defragger quicktime soho winzip

Answers: 1

Answer

You know the right answer?

(1) Output a menu of automotive services and the corresponding cost of each service. (2 pts) Ex: Dav...

Questions