Answer:
In assembly language, two instructions control the use of the assembly language procedure.
CALL pushed the control to the return address onto the stack and transferred the control.
RET instruction returns the address that placed on the stack by a call instruction.
Explanation:
Action RET instruction
- The RET instruction pops the address and returns off the stack, which is pointed by the stack pointer.
- The stack is LIFO in memory at a particular location, and the pointer points offset from the stack location.
RET instruction does its job by consulting the register and memory state at the point when it is executed.
In RET instruction, only register and memory state is executed. Call instruction must save that address that figure out in a register and memory location.
Answer:
Quite simply, when you double your ISO speed, you are doubling the brightness of the photo. So, a photo at ISO 400 will be twice brighter than ISO 200, which will be twice brighter than ISO 100.
Explanation:
ISO most often starts at the value of ISO 100. This is the lowest, darkest setting, also called the base ISO. The next full stop, ISO 200, is twice as bright, and ISO 400 is twice as bright than that. Thus, there are two stops between ISO 100 and 400, four stops between 100 and 1600, and so on.
Answer: C because bill gates is the owner
GFE stands for Government Furnished Equipment. While AUP is Acceptable Use Policy (AUP). The AUP should be read and signed by employees annually. <span><span> </span></span>The statement that "When issued a GFE device, you are required to sign an AUP" is true.
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
