Operating System (UGC/NET)
Operating System concepts covering memory management, process scheduling, file systems, deadlocks, threads, and real-time systems for UGC/NET exam preparation.
Questions
The paging activity in which a process having less number of frames than required or when a process is executing with a minimum set of frames allocated to it is _____________.
- demand paging
- FIFO page replacement algorithm
- thrashing
- optimal page replacement algorithm
- virtual memory
The operation performed on a file in which the file attributes are not changed but the file has a reduced size because the user deletes information in the file is _______________.
- truncating a file
- deleting a file
- reading a file
- writing a file
- creating a file
The type of fetch that is dependent upon some defined criterion and makes use of main memory rather than the cache to hold the information is called __________________.
- pre-fetch
- selective fetch
- demand fetch
- always fetch
- pre-cleaning
____________ is the directory structure in which directory is a tree of height two with the master file directory at the root having user directories as descendants.
- Single level directory
- Two-level directory
- Tree structure directories
- Directory
- File
The approach in multiple processor scheduling in which multiple virtual CPUs are used instead of multiple physical CPUs is ______________.
- contention scope
- symmetric multithreading
- processor affinity
- load balancing
- pull migration
The type of memory mapping in cache where the cache consists of normal high speed random access memory and each location in the cache holds the data is _____________.
- II set-associative mapping
- I direct mapping
- III sector mapping
- fully associative mapping
- cleaning policy
The condition required for deadlock to occur states that each process is waiting to obtain a resource which is held by another process is ______________.
- mutual exclusion
- hold and wait
- no preemption
- circular wait
- livelock
The process state of UNIX operating system which states that the process is ready to run, but the swapper must swap the process into main memory before the kernel can schedule it to execute is ______________.
- swapped
- preempted
- ready to run, in memory
- created
- sleeping
The type of scheduling that is intended to pick the quickest and fastest little job that needs to be done by the CPU is __________.
- FCFS
- round-robin
- SJF
- multilevel queue
- priority
The type of threads that require non-blocking system call, i.e. a multithreaded kernel, otherwise the entire process will be blocked in the kernel even if there are runable threads left in the processes, are _________________.
- kernel level threads
- user level threads
- ready
- running
- blocked
The type of computing which is used in a system that requires to complete a critical task within a guaranteed amount of time is _______________.
- soft real time systems
- hard real time systems
- multilevel feedback queue scheduling
- round-robin scheduling
- multiple processor scheduling
The type of buffering that consists of a queue having finite length and thus, can have 'N' messages reside in it is _____________.
- zero capacity
- unbounded capacity
- bounded capacity
- bounded waiting
- mutual exclusion
The type of allocation that divides primary memory into multiple memory partitions, usually contiguous areas of memory and is required for multiprogramming, is
- single partition allocation
- multiple partition allocation
- paging
- fragmentation
- swapping
The part of Process Control Block which is particularly a register that holds the address of next instruction to be executed is ________________.
- process state
- CPU registers
- program counter
- CPU scheduling information
- memory management information
The method of relocating processes in memory so that the fragmented holes are converted into contiguous holes in memory is _______________
- swapping
- compaction
- segmentation
- program counter
- MAR