Answer:
a = 6, b = 0
Explanation:
The loop ran 3 times before b == 0. The statement "while ((b != 0)" is essentially saying: 'While b is not equal to 0, do what's in my loop'. Same general thing with "&& ((a / b) >= 0)". The "&&" is specifying that there should be another loop condition. The final part of the while loop states: 'as long as a ÷ b is greater than 0, do what's in my loop'. If all of these conditions are met, the loop will run. It will continue to run until at least one of the conditions are not met.
<em />
<em>Side note: I can't help but notice you posted the same question a while ago, so I just copied and pasted my previous response with some tweaking here and there. Hope this helps you! :)</em>
Answer:
Explanation:
( n cards are there initially )
we pick out the first card in random it takes n-1 comparisons to figure out
its Equivalence card - n-1 steps
Two cards have been eliminated ( this leaves us with 2 and n-2 cards)
we pick out the 2nd card in random it takes n-3 comparisons to figure out
its Equivalence card - n-3 steps
we continue to do this.. till all cards are exhausted ( leaves us with 2
and n-4 cards again)
the last comparison will
have
- n-(n-3)
the sum of all these steps - (n-1) + (n-3) + (n-5) + .........+
(n-(n-3))
if you draw this in the form of a tree.
n - n
2
n-2 - n
2
n-4 - n-2
2
n-6 - n-4
2
n-8 - n- 6
the height of the tree will be log n , sum @ each level is at most n
The program is an illustration of file manipulations
<h3>What are file manipulations?</h3>
File manipulations are program statements that are used to write & append to file, and also read from the file
<h3>The actual program in Python</h3>
Assume the file name is top10.txt, the program in Python where comments are used to explain each line is as follows:
#This opens the file
a_file = open("top10.txt")
#This reads the file contents
file_contents = a_file.read()
#This prints the contents
print(file_contents)
Read more about file manipulations at:
brainly.com/question/15683939
se definen como un medio de estudio en estos momentos de cuarentena
en la que nos ayuda a sentirnos mas cerca de las clases
Answer:
B. False
Explanation:
A page-replacement policy can be defined as a set of algorithm that instructs the operating systems on what memory page is to be swapped, paged out or written to disk in order to allocate more memory as they're required by various active processes during virtual memory management.
Some of the algorithms or techniques used by the operating system for page-replacement policy are;
1. Last In First Out (LIFO).
2. First In First Out (FIFO).
3. Least Recently Used (LRU).
4. Least Frequently Used (LFU).
5. Optimal (OPT or MIN).
Hence, the page-replacement policy means that pages are placed to make more space and to minimize the total number of page that would be missing.
