Answer:
In Python:
numberOfWholeSlices = int(22/7)
print(numberOfWholeSlices )
Explanation:
For each friend to get a whole number of slices, we need to make use of the int function to get the integer result when the number of slices is divided by the number of people.
So, the number of slice is: 22/7
In python, the expression when assigned to numberOfWholeSlices is:
numberOfWholeSlices = int(22/7)
Next, is to print the calculated number of slices
print(numberOfWholeSlices )
True??????????????????????????
Compaction often gives solutions to the issues regarding external fragmentation.
One technique for overcoming external fragmentation in dynamic partitioning is
Compaction.
The reason why this technique of overcoming external fragmentation may be inefficient is because:
- External fragmentation may need a lot of compaction and it is an expensive operation.
- The use of contiguous allocation is often hard to fit processes into memory and also it is so difficult to grow or shrink the amount of memory allocated to a process.
- Compaction only takes place when relocation is dynamic, and this also is expensive.
Compaction often shuffle memory notes or contents and then put or pile them up all in free memory and in one large block.
External fragmentation takes place when free memory is removed into small blocks.
Learn more from
brainly.com/question/23636593
Answer:
The answer is A
Explanation:
Basically, Shortest job first (SJF) is a scheduling policy that selects jobs on queue for execution within a short execution time.
From the definition of SJF above, it means that there are a lot of process on queue and the (SJF) job is to receive processes on queue to execute within a short execution time.
Therefore, if all the jobs or process arrives at the SJF at the same time, the SJF will forfeit one of its major purpose which is scheduling of jobs.
That will therefore not make Non-preemptive Shortest Job First (SJF) not function at its optimal point.
