Process Scheduling
Deadlocks
Paging
Synchronization
100
What is turnaround time?
Total time from submission to completion
100
What is a process?
A program in execution
100
What is a frame?
A fixed-size block of physical memory
100
When outcome depends on execution order
Race Condition
200
What is context switching?
Switching CPU from one process to another
200
What is hold and wait?
Process holds one resource and waits for another
200
What is internal fragmentation?
Unused space within a page
200
What are the two operations on semaphore?
Wait and signal
300
How can starvation be avoided in priority scheduling?
By aging
300
What is deadlock prevention?
Ensuring at least one deadlock condition never occurs
300
If page size = 4KB, how many bits for offset?
12 bits
300
What is bounded buffer?
Limited-size shared storage
400
Which scheduling algorithm gives minimum average waiting time (theoretically)?
SJF
400
Deadlock
400
If page size increases, what happens to page table size?
Decreases
400
Dinning Philosophers problem
500
| P1 | P2 | P3 | P1 | P2 | P1 |
0 2 4 6 8 10 12
Which scheduling algorithm is shown?
Round Robin
500
If resources can be preempted, which condition is broken?
No preemption
500
MMU stands for
Memory Management Unit
500
What is condition variable?
signalling /waiting in monitors