Answer:
Single-evidence form
Explanation:
Single-evidence form dedicates a page for each item retrieved for a case; it allows investigators to add more detail about exactly what was done to the evidence each time it was taken from the storage locker.
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:
#code (count_seq.py)
def count_seq():
n='2'
while True:
yield int(n)
next_value=''
while len(n)>0:
first=n[0]
count=0
while len(n)>0 and n[0]==first:
count+=1
n=n[1:]
next_value+='{}{}'.format(count,first)
n=next_value
if __name__ == '__main__':
gen=count_seq()
for i in range(10):
print(next(gen))
Explanation:
- Start with number 2. Use string instead of integers for easy manipulation
.
- Loop indefinitely
.
- Yield the integer value of current n
.
- Loop until n is an empty string
.
- Loop as long as n is non empty and first digit of n is same as first
.
- Append count and first digit to next_value
.
Ctrl button and the square with two lines at the top of the keyboard.
Answer: apply heading styles to text.
Explanation: