where the process will reside in memory, then the compiler must generate relocatable memory

[Solved] Load time

Q.	Load time
A.	where the process will reside in memory, then absolute code can be generated
B.	where the process will reside in memory, then the compiler must generate relocatable memory
C.	if the process can be moved during its execution from one memory segment to another, then binding must be delayed until run time
D.	all of the above
Answer» B. where the process will reside in memory, then the compiler must generate relocatable memory

3.2k

Do you find this helpful?

View all MCQs in

Operating System Advanced

Discussion

No comments yet

Related MCQs

A Absolute loading B Re-locatable loading C Dynamic Run-Time loading; 1. For loader, load module, either is an absolute main memory address or specific address reference. 2. For loader, load modules have no absolute address. 3. For loader, load modules have all memory reference in relative form.
In uni-processor scheduling :A : Turnaround time, B : Response time, 1: A time interval between the submission of a process and its completion. 2: For interactive process, it is a time from the submission of a request until the response begins to received. 3: It includes actual execution time plus time spent waiting for resources.
A. Absolute Loading B. Relocatable Loading C. Dynamic Run-Time Loading; 1- It requires that a load module always be loaded into some location in main memory. 2- A load module can be located anywhere in main memory.
In memory management :A-Fixed allocation policy, B-Variable allocation policy: 1-It gives a process a fixed number of frames in main memory within which to execute. 2-It allows the number of page frames allocated to a process to be varied over the life time of the process. 3-In it a number of allocated frames are decided at initial load time.
For Load-time dynamic linking
In real time scheduling: A: Static table driven approach, B: Static priority driven preemptive approach, C: Dynamic planning based approach; 1- A static analysis of feasible scheduler of dispatching is done and implemented. 2- A static analysis of feasible schedules of dispatching is done and assigns priorities to tasks. 3- Feasibility is determined at run time.
In thread scheduling, load sharing is referred to
The Java run time environment is an example of
Which combination of the following features will suffice to characterize an OS as a multi programmed OS ? (i) More than one program may be loaded into main memory at the same time for execution. (ii) If a program waits for certain events such as I/O, another program is immediately scheduled for execution. (iii) If the execution of a program terminates, another program is immediately scheduled for execution.
Turnaround time is defined as