Write a C++ or Java program to simulate the following non-preemptive CPU scheduling algorithms to find turnaround time and waiting time. a) FCFS b) SJF c) Round Robin (pre-emptive) d) Priority

Question 3  Q20. Suppose a computer program has been initialized such that the following sets have been stored for use in any algorithm: A = {1, 2, 3, ..., 45}B = {-7, -6, -5, ..., 29} Consider the following algorithm, which represents one part of the whole computer program (comments may occur after the # symbol on any line and are not used in computations): #Part 1: computes A - B and its cardinality AminusB = set()for element in A:   # this line runs through every element in A    if not(element in B): #A - B is the set of elements that are in A and are not in B        AminusB.add(element) # Add to AminusB every element in A if the element is also not in B n = len(AminusB) #len() returns the number of elements in the arrayprint(n)    What value is printed as a result of executing this algorithm?

Multi-tasking can not be achieved with a single processor machine.  True  False       2. Async/Await is best for network bound operations while multi-threading and parallel programming is best for CPU-bound operations.  True  False     3. The following is a characteristic of an async method:The name of an async method, by convention, ends with an "Async" suffix.  True  False   4. Using asynchronous code for network bound operations can speed up the time needed to contact the server and get the data back.  True  False     5. Asynchronous programming has been there for a long time but has tremendously been improved by the simplified approach of async programming in C# 5 through the introduction of:  The Task class  True  False

Consider a computer system with multiple resources and concurrent processes competing for them. Deadlock is a situation that might arise in such a system. What conditions must hold simultaneously for a deadlock to occur in this system? A. Mutual Exclusion, Hold and Wait, No Preemption, Circular Wait B. Mutual Exclusion, First Come First Serve, Circular Wait, Limited Resources C. Mutual Exclusion, Hold and Wait, Priority Inheritance, Circular Wait D. Hold and Wait, No Preemption, Circular Wait, Resource Optimization