Answer:
Number 2 Polygonal lasso tool
Explanation:
Answer and explanation :
the three control problems associated with competing process are
- MUTUAL EXCLUSION : We know that some resources are shareable and some are not shareable. which means only one process can access the resource at a time this type of resources are called critical resources this code can be access at only one process at a time. the other process if required to access should not be allowed
- DEADLOCK: this hold the process without complete for example suppose there are two resources R1 and R2 and two process P1 and P2 and P1 use R1 and P2 use R2 but after some time when P1 needs R2 but R2 is not available as it is used by P2 so the all process will be on hold
- STARVATION : when priorities are given to the process as high priorities and low priorities. And high priorities process always competing then low priorities process have to wait for very long time this is called starvation
I have a very good example of the program you need written on Python. You can use this (sorry for bad tabulation):
import math
import math
def main():
function = input("Enter a function f(x):\n")
x = 0
y = 0
for rows in range(10,-11,-1):
for col in range(-10,11,1):
x=col
roundfx = round(eval(function))
if roundfx == rows:
print("o", end="")
if rows==0 and col==0 and not rows == roundfx:
print("+", end="")
if col == 0 and not rows == 0 and not rows == roundfx:
print("|", end="")
if rows==0 and not col==0 and not rows == roundfx:
print("-", end="")
else:
if not rows == 0:
if not col == 0:
if not rows == roundfx:
print(" ", end="")
print()
main()
names = ["Kevin", "Joe", "Thor", "Adam", "Zoe"]
names.sort()
for x in names:
if x == "Thor":
break
else:
print(x)
I made up my own names for the sake of testing my code. I wrote my code in python 3.8. I hope this helps.
Answer:
EOF stands for End Of File
Google explains it well: EOF is a condition in a computer operating system where no more data can be read from a data source. The data source is usually called a file or stream.
