C. Send it to the recycle bin and empty the recycle bin
Hello, you haven't provided the programing language in which you need the code, I'll explain how to do it using Python, and you can follow the same logic to make a program in the programing language that you need.
Answer:
1. # -*- coding: utf-8 -*-
2. #Python
3. class Calculator:
4. def add(self):
5. print(a + b)
6. def sub(self):
7. print(a - b)
8. def mul(self):
9. print(a * b)
10. def div(self):
11. print(a / b)
12.
13. obj = Calculator()
14. choice = 1
15. while choice != 0:
16. a = int(input("\nEnter first number: "))
17. b = int(input("Enter first number: "))
18.
19. print("\n0. EXIT")
20. print("1. DIVISION")
21. print("2. ADDITION")
22. print("3. SUBTRACTION")
23. print("4. MULTIPLICATION")
24.
25. choice = int(input("\nEnter your choice: "))
26. if choice == 1:
27. obj.div()
28. elif choice == 2:
29. obj.add()
30. elif choice == 3:
31. obj.sub()
32. elif choice == 4:
33. obj.mul()
34. else:
35. break
Explanation:
- From lines 1 to 12 we define the object with four methods, addition, subtraction, multiplication, and division. Each method contains the operation between two variables inside a print function
- On line 13 we instantiate our class
- On line 14 we declare the variable choice that is going to store the operation that the user wants to perform
- On line 15 we declare a while loop, this is going to keep running the program until the user wants to exit
- From line 16 to 18 we ask the user to enter two numbers
- From line 19 to 24 we print the possible operation, assigning a number for each operation, this indicates to the user what number to press for what operation
- On line 25 we ask the user for the operation
- From lines 26 to 35 we check the user input an accordingly we call the corresponding method to performs the operation
Answer:
Answer in the below
Explanation:
Redo means the previous one and undo means removing it... i am not so sure..
Answer:
C. FIFO
Explanation:
The first-in, first-out (FIFO) page replacement algorithm is a low-overhead algorithm that requires work on the part of the operating system. On a page fault, the frame that has been in memory the longest is replaced.
Using FIFO algorithm implies that
a page which was brought into memory first will be removed first since variable was initialized very early. it is in the set of first in pages that will be removed.
It is the simplest page replacement algorithm. The operating system keeps track of all pages in the memory in a queue, the oldest page is in the front of the queue. When a page needs to be replaced page in the front of the queue is selected for removal that is first in first out.
A memory page containing a heavily used variable that was initialized very early and is in constant use is removed, then the page replacement algorithm used is called First In First Out.
Answer: Sorry to break this to you but you can't.
Explanation:
