The FIFO algorithm
The FIFO algorithm A. executes first the job that last entered the queue B. executes first the job that first entered the queue C. execute first the job that has been in the queue the longest D. executes first the…
The FIFO algorithm A. executes first the job that last entered the queue B. executes first the job that first entered the queue C. execute first the job that has been in the queue the longest D. executes first the…
Memory A. is a device that performs a sequence of operations specified B. is the device where information is stored C. is a sequence of instructions D. is typically characterized by interactive processing and time-slicing of the CPU’s time Answer:…
Which of the following systems software does the job of merging the records from two files into one? A. Security software B. Utility program C. Networking software D. Documentation system Answer: Option B
Which of the following refers to the associative memory? A. the address of the data is generated by the CPU B. the address of the data is supplied by the users C. there is no need for an address i.e.…
Which of the following is a service not supported by the operating system? A. I/O operation B. Compilation C. Accounting D. Protection Answer: Option B
Page fault occurs when A. the page is in main memory B. the page is not in main memory C. one tries to divide a number by 0 D. the page is corrupted by application software Answer: Option B
Concurrent processes are processes that A. overlap in time B. do not overlap in time C. are executed by a processor at the same time D. none of the above Answer: Option A
With a single resource, deadlock occurs A. if there are only two processes competing for that resource B. if there is a single process competing for that resource C. if there are more than two processes competing for that D.…
a multiprogramming environment A. more than one process resides in the memory B. the programs are developed by more than one person C. the processor executes more than one process at a time D. a single user can execute many…
Disk scheduling involves deciding A. which disk should be accessed next B. the order in which disk access requests must be serviced C. the physical location where files should be accessed in the disk D. none of the above Answer:…