Operating System (OS) In which of the storage placement strategies a program is placed in the largest available hole in the main memory? first fit best fit worst fit None of these buddy first fit best fit worst fit None of these buddy ANSWER DOWNLOAD EXAMIANS APP
Operating System (OS) Which of the following is a measure to test how good or bad a modular design is Module coupling None of these Module strength All of these Static analysis Module coupling None of these Module strength All of these Static analysis ANSWER DOWNLOAD EXAMIANS APP
Operating System (OS) A linker is not necessary with variable partitions None of these creates a load module must be run after the loader is not needed with a good compiler is not necessary with variable partitions None of these creates a load module must be run after the loader is not needed with a good compiler ANSWER DOWNLOAD EXAMIANS APP
Operating System (OS) The function(s) of the Storage Assignment is (are) to assign storage to all temporary locations that are necessary for intermediate results. to assign storage to literals, and to ensure that the storage is allocate and appropriate locations are initialized. None of these All of these to assign storage to all variables referenced in the source program. to assign storage to all temporary locations that are necessary for intermediate results. to assign storage to literals, and to ensure that the storage is allocate and appropriate locations are initialized. None of these All of these to assign storage to all variables referenced in the source program. ANSWER DOWNLOAD EXAMIANS APP
Operating System (OS) A form of code that uses more than one process and processor, possibly of different type, and that may on occasions have more than one process or processor active at the same time, is known as multiprogramming multithreading None of these time sharing broadcasting multiprogramming multithreading None of these time sharing broadcasting ANSWER DOWNLOAD EXAMIANS APP
Operating System (OS) The FIFO algorithm None of these executes first the job that first entered the queue executes first the job with the least processor needs executes first the job that last entered the queue execute first the job that has been in the queue the longest None of these executes first the job that first entered the queue executes first the job with the least processor needs executes first the job that last entered the queue execute first the job that has been in the queue the longest ANSWER DOWNLOAD EXAMIANS APP
EXAMIANS