Answer:
zero ( 0) times.
Explanation:
In the code;
i = 2
while ( i > 2){
i = floor( i/2 );
z = z + 1;
}
the variable " i " is assigned the integer " 2 ", then the while statement loops with a condition of a greater " i " value and divides the value by two for every loop.
But in this case, the while statement is not executed as the value of " i " which is 2 is not greater than but equal to two.
some advantages of video conferencing include:
• you can talk no matter how far you are from the person
•you won’t have to go somewhere to talk
•there is no cost if you need to travel far
Answer:
a. Remove the affected servers from the network.
Explanation:
An organization's incident response process (IRP) can be defined as all of the process involved in the cleanup and recovery of data when they fall victim to an attack or cybersecurity breach. The incident response process comprises of six (6) important stages and these are;
1. Preparation.
2. Detection and analysis (identification).
3. Containment.
4. Eradication.
5. Recovery.
6. Review of incident activities.
When an organization's IRP prioritizes containment over eradication and an incident is discovered, where an attacker outside the organization installed a crypto-currency mining software on the organization's web servers. Given the organization's stated priorities, the cybersecurity engineer should remove the affected servers from the network.
A containment process is focused on taking steps to eliminate or contain the attack. It basically involves acting swiftly in response to the attack, so as to prevent it from spreading across board or in order to mitigate the damage already caused.
In this context, the cybersecurity engineer should remove the affected servers from the network in accordance with the organization's IRP priority (containment).
<em>Furthermore, he could take a step further to contain the attack by installing a firewall and updating their policies in the Intrusion Prevention System (IPS) of the organization. </em>
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.
