Operating Systems Concepts
Test your knowledge of operating system fundamentals including process management, CPU scheduling, memory management, and concurrency control mechanisms.
Questions
Which of the following process states ensures that the process is said to be running if it currently has the CPU at a particular instant?
- Ready state
- Blocked state
- Running state
- New state
- Terminated state
Which of the following attributes in process control block stores related information about process like identifier of current process and identifier of the process which created this process, etc.?
- Processor state information
- Process identification
- Process control information
- Context switching
- Deadlock
Which of the following replacement algorithms is the one in which the page which least likely to be referenced is selected?
- Least recently used
- Optimal
- FIFO
- L1 cache
- L2 cache
Which of the following memory management techniques is the one which allows a limited number of blocks with the same index and different tags in the cache and can therefore be considered as a compromise between a fully associative cache and a direct mapped cache?
- III Sector Mapping
- II Set-associative mapping
- I Direct Mapping
- Fully associative mapping
- Fetch operation
Which of the following terms refers to the scope in which threads compete for the use of physical CPUs?
- Thread scheduling
- Context switching
- Contention scope
- Processor affinity
- Multiprocessing
Which of the following process states in UNIX operating system is the one in which kernel preempts current process and switch to schedule another process?
- Sleeping
- Zombie
- Preempted
- Ready
- Asleep
Which of the following scheduling algorithms selects the fastest little job that needs to be done by the CPU?
- FCFS
- SJF
- Priority scheduling
- Round Robin scheduling
- Multilevel queue scheduling
Which of the following terms refers to a strategy where whenever a resource is requested, it is only granted if it cannot result in deadlock?
- Deadlock avoidance
- Preemption
- Deadlock prevention
- Livelock
- Rollback
Which of the following types of interrupts in context switching allows process to switch from running state to ready state and another process must be dispatched for execution?
- Memory fault
- I/O interrupt
- Clock interrupt
- Trap
- System call
Which of the following fetch policies is the simplest among all others and does not require any additional hardware or tags in the cache recording the references?
- Selective fetch
- Pre-fetch
- Demand fetch
- Write operation
- Placement policy
Which of the following techniques in memory management deals with 'when a modified page should be written out to secondary memory'?
- Page buffering
- Fetch policy
- Cleaning policy
- Replacement policy
- Placement policy
Which of the following methods of mutual exclusion is the one in which context switching from one process to another process can only occur on interrupts?
- Mutual exclusion by using Lock variable
- Mutual exclusion by disabling interrupts
- Mutual exclusion by strict alternation
- Mutual exclusion by petersons method
- Mutual exclusion by using special machine instructions
Which of the following conditions for the deadlock to occur, states that once a process holds a resource, it cannot be taken by another process or the kernel?
- Mutual exclusion
- Hold and Wait
- No preemption
- Circular wait
- Hit ratio
Which of the following is a mechanism that prevents two or more processes from accessing a shared resource simultaneously?
- Mutual exclusion
- Semaphore
- Critical section
- Race condition
- Cache memory