Answer: Even though the hardware is inexpensive the writing of program is not efficient through this method as proper development of program is necessary for the clear execution due to factors like:-
- The facility of writing program even the cost of hardware is less but it is not a free facility.
- It also has a slower processing for the execution of the program
- The construction of the efficient program is necessary for the compilation and execution of it rather than poorly constructed program is worthless and inefficient in working.
Answer:
subset([],[]).
subset([X|L],[X|S]) :-
subset(L,S).
subset(L, [_|S]) :-
subset(L,S).
Success:
subset([1,3], [1,2,3]).
subset(X, [1,3,4]). % error handling to compare sets in a given order
Fail:
subset([2,1], [1,2,3]). % compares in a different order from the first.
Explanation:
The function "Subset" in the source code above accepts two sets, then checks if the first set is a subset of the second. The code returns true if the condition is met.
Answer: d. the time quantum should be as small as possible.
Explanation: Round robin is a CPU scheduling algorithm. If the time quantum is extremely small, number of context switches is very high, round robin scheduling will be same as processor sharing algorithm. Then the algorithm is good. Very large time quantum will make response time of processes too much which may not be tolerated in interactive environment.
I think it might be short range and long-term
