Answer:
Following are the algorithm to this question:
y = 0 // initialize variable y that assigns the value 0
p = 1 // initialize value 1 in the variable p which also known as starting position
init num = 1//define variable num that assign value 1
for j = 1 to n: //defining loop
y = m[j] - m[p]
if (y > 10) //defining if block
num++; //increment num variable
p=i; //holding loop value in p variable
y= 0//assign value 0 in y variable
Explanation:
Following are the runtime analysis of the above-given algorithm:
The above-provided algorithm is greedy, but if it doesn't exceed the scope, it operates by greedily choosing its next object. Therefore the algorithm selects the fewest number of pens.
Running time:
This algorithm merely iterates once over all the points. The run-time is therefore O(n).
Answer:
informed; consent
Explanation:
According to the ethical computer use policy, users should be informed of the rules and, by agreeing to use the system on that basis, consent to abide by the rules.
Answer:
a.material control failure
Explanation:
A material control failure is a material deficiency, or combination of significant deficiencies, that results in more than a remote likelihood that a material mis-statement in the annual or interim financial statements will not be prevented or detected.
<span>An item such as a smart card is an example of the something you have form of authentication.
A smart card is very similar to credit card because of its shape and size, however inside it is totally extraordinary. As a matter of first importance, it has an inside - an ordinary charge card is a basic bit of plastic. Within a smart card for the most part contains an inserted microchip.
</span>
