The answer to this question is C.
Answer:
The time complexity of the code is O(log₇n).
Explanation:
The i is updated by 7*i.On each iteration i is multiplied by 7.So on finding the time complexity of the code given above it will come out to be log base 7.
When we divide the input by 2 the time complexity is log base 2.
So on dividing it by 7 we get the time complexity of log base 7.
Answer:
Select the Zoom tool, and then do any of the following:
<h2>#1. </h2>
Click and hold in the image to zoom in. Press Alt (Windows) or Option (Mac OS) to zoom out.
<h2>#2!</h2>
In the options bar, select Scrubby Zoom. Then drag to the left in the image to zoom out, or to the right to zoom in.
<h2>psst! pls, brailiest!</h2>
Answer and explanation :
the three control problems associated with competing process are
- MUTUAL EXCLUSION : We know that some resources are shareable and some are not shareable. which means only one process can access the resource at a time this type of resources are called critical resources this code can be access at only one process at a time. the other process if required to access should not be allowed
- DEADLOCK: this hold the process without complete for example suppose there are two resources R1 and R2 and two process P1 and P2 and P1 use R1 and P2 use R2 but after some time when P1 needs R2 but R2 is not available as it is used by P2 so the all process will be on hold
- STARVATION : when priorities are given to the process as high priorities and low priorities. And high priorities process always competing then low priorities process have to wait for very long time this is called starvation
It depends on the problem. If you are solving a conplex one or simple
