Basic Operating System MCQ
Basic Operating System MCQ
491. Banker's algorithm for resource allocation deals with
- deadlock prevention
- deadlok avoidance
- deadlock recovery
- mutual exculsion
492. The dispatcher
- actually schedules the tasks into the processor
- is always very small and simple
- puts tasks in wait
- Nnone of these
493. A set or resource allocations such that the system can allocate resources to each process in some order, and still avoids a deadlok is called
- Unsafe state
- safe state
- starvation
- Greedy allocation
494. processor-bound tasks
- use the processor more often
- use more processor time
- use less processor time
- always take longer to execute
495. The following resources can cause deadlocks
- Read only files
- Shared programs
- Printers
- All of the above
496. Complex scheduling algorithms
- use more resources than they gain
- Recover more resoruces than they use
- always use many resources
- are most appropriate for very large computers
497. The intensive jobs
- use less processor time than most jobs
- you are constrained by their I/O Requirements
- run more quickly than processor-intensive jobs
- Should all be executed at the same time
498. The FIFO algorithm
- executes first the job that last entered the queue
- executes first the job that first entered the queue
- executes first job with the least processor needs
- executes first the job that has been in the queue the longest
499. Check pointing a job
- allows it to be completed successfully
- allows it to continue executing later
- prepares it for finishing
- occurs only when there is an error in it
500. Windows is an
- operating system
- operating environment
- user interface
- programming platform