In software: Logical Volume. In hardware it's usually called RAID (Redundant Array of Inexpensive Devices).
Answer:
Option d) is correct
Explanation:
To optimize the processing of a warehouse’s operations, products are stored on warehouse racks when they arrive. The items that arrive last are the first to go out to minimize the time it takes to retrieve an item. The items that arrive need to be represented and the warehouse should be left in a data structure. The data structure which should you use to represent this situation is a queue.
Option d) is correct
earliest = ""
while True:
month = int(input("Enter a date (month): "))
day = int(input("Enter a date (date): "))
year = int(input("Enter a date (year): "))
if month == 0 and day == 0 and year == 0:
break
if month < 10:
month = "0"+str(month)
if day < 10:
day = "0"+str(day)
string_date = str(month)+"/"+str(day)+"/"+str(year)
print(string_date)
if earliest == "":
earliest = string_date
else:
year,month,day=int(year),int(month),int(day)
lst = list(map(int,earliest.split("/")))
if year < lst[2]:
earliest = string_date
elif year == lst[2] and month < lst[0]:
earliest = string_date
elif year == lst[2] and lst[0] == month and day < lst[1]:
earliest = string_date
print(earliest,"is the earliest date")
I wrote my code in python 3.8. Best of luck.
Answer:
<u>algorithm</u>
original = float(raw_input("Enter initial balance: "))
interest = float(raw_input("Enter promised return: "))
expenses = float(raw_input("Enter monthly expenses: "))
interest = interest / 100 / 12
month = 0
balance = original
if balance * interest - expenses >= 0:
print "You don't need to worry."
else:
while balance + balance * interest - expenses >= 0: # negation of the if condition
balance = balance + interest * balance # in one month
balance = balance - expenses
month = month + 1
print month, balance
print month / 12, "years and", month % 12, "months"
Answer:
here is my crude attempt:
import turtle
t = turtle.Turtle()
t.speed(0)
colors = ["black", "yellow"]
SQUARES = 8
SQUARESIZE = 20
def rectangle(color, s):
t.begin_fill()
t.pendown()
t.color(color)
for i in range(4):
t.forward(s)
t.right(90)
t.end_fill()
t.penup()
for row in range(SQUARES):
for col in range(SQUARES):
t.setpos(row*SQUARESIZE, col*SQUARESIZE)
rectangle(colors[(row+col)%2], SQUARESIZE)