Given six memory partitions of 300 kb(m1), 600 kb(m2), 350 kb (m3), 200 kb (m4), 750 kb(m5), and 125 kb(m6) (in order), how would the first-fit, best-fit, and worst-fit algorithms place processes of size p1-115 kb, p2- 500 kb, p3- 358 kb, p4 -200 kb, and p5 - 375 kb (in order)? rank the algorithms in terms of how efficiently they use memory.

answer: 0.95, d

step-by-step explanation:

first, you have to combine the percentages of costumers ordering pizza or salad. 25% (percent of salads ordered) plus 70% (percent of pizzas ordered) is equal to 95%. then, turn 95% into a fraction: 95/100. lastly, divide 95 by 100 and you will get 0.95, d.

i think it is c, not positive though

step-by-step explanation:

dont think so

step-by-step explanation:

the final amount you will pay is $68.04.

the tip is determined by the pre-tax amount, so we calculate the tip based on the original bill, not after we've added sales tax.

to find the tip:

we can divide 54.00 by 100 to get 1% of 54. then we multiply that by 18.

54 / 100 = .54

.54 x 18 = 9.72

tip = 9.72$

to find the tax:

we can divide 54.00 by 100 to get 1% of 54. then we can multiply that by 8 to get 8%.

54 / 100 = .54

.54 x 8 = 4.32

tax= 4.32

now we can add the tip and tax to the bill to get our total.

54 + 9.72 + 4.32 = 68.04

total: $68.04

step-by-step explanation: