OPERATING SYSTEM
| 1. | Consider the following statements about process state transitions for a system using preemptive scheduling. I. A running process can move to ready state. II. A ready process can move to running state. III. A blocked process can move to running state. IV. A blocked process can move to ready state. Which of the above statements arc TRUE? | [GATE-2023: 1M] | |
|
I, II, III and IV
|
|||
|
II and III only
|
|||
|
I, II and IV only
|
|||
|
I, II and III only
|
|||
| 2. | A computer handles several interrupt sources of which of the following are relevant for this question. • Interrupt from CPU temperature sensor (raises interrupt if CPU temperature is too high) • Interrupt from Mouse (raises interrupt if the mouse is moved or a button is pressed) • Interrupt from Keyboard (raises interrupt when a key is pressed or released) • Interrupt from Hard Disk (raises interrupt when a disk read is completed) Which one of these will be handled at the HIGHEST priority? | [GATE-2011: 1M] | |
|
Interrupt from Hard Disk
|
|||
|
Interrupt from Mouse
|
|||
|
Interrupt from Keyboard
|
|||
|
Interrupt from CPU temperature sensor
|
|||
| 3. | Let the time taken to switch between user and kernel modes of execution be T1 while the time taken to switch between two user processes be T2. Which of the following is TRUE? | [GATE-2011: 1M] | |
|
T1 > T2
|
|||
|
T1 = T2
|
|||
|
T1 < T2
|
|||
|
Nothing can be said about the relation between T1 and T2
|
|||
| 4. | Consider an arbitrary set of CPU-bound processes with unequal CPU burst lengths submitted at the same time to a computer system. Which one of the following process scheduling algorithms would minimize the average waiting time in the ready queue? | [GATE-2016: 1M] | |
|
Shortest remaining time first
|
|||
|
Round – robin with time quantum less than the shortest CPU burst
|
|||
|
Uniform random
|
|||
|
Highest priority first with priority proportional to CPU burst length
|
|||
| 5. | A scheduling algorithm assigns priority proportional to the waiting time of a process. Every process starts with priority zero (the lowest priority). The scheduler re-evaluates the process priorities every T time units and decides the next process to schedule. Which one of the following is TRUE if the processes have no I/O operations and all arrive at time zero? | [GATE-2013: 1M] | |
|
This algorithm is equivalent to the first-come first-serve algorithm
|
|||
|
This algorithm is equivalent to the round-robin algorithm
|
|||
|
This algorithm is equivalent to the shortest-job-first algorithm
|
|||
|
This algorithm is equivalent to the shortest-remaining-time-first algorithm
|
|||
| 6. | Which of the following statements are true? I. Shortest remaining time first scheduling may cause starvation. II. Preemptive scheduling may cause starvation. III. Round robin is better than FCFS in terms of response time. | [GATE-2010: 1M] | |
|
I only
|
|||
|
I and III only
|
|||
|
II and III only
|
|||
|
I, II and III
|
|||
| 7. | If the time-slice used in the round-robin scheduling policy is more than the maximum time required to execute any process, then the policy will | [GATE-2008: 2M] | |
|
Degenerate to shortest job first
|
|||
|
Degenerate to priority scheduling
|
|||
|
Degenerate to first come first serve
|
|||
|
None of the above
|
|||
| 8. | A process executes the code: fork (); fork (); fork (); The total number of child processes created is | [GATE-2012: 1M] | |
|
3
|
|||
|
4
|
|||
|
7
|
|||
|
8
|
|||
| 9. | Which of the following is/are shared by all the threads in a process? I. Program counter II. Stack III. Address space IV. Registers | [GATE-2017: 1M] | |
|
I and II only
|
|||
|
III only
|
|||
|
IV only
|
|||
|
III and IV only
|
|||
| 10. | Threads of a process share | [GATE-2017: 1M] | |
|
Global variables but not heap
|
|||
|
Heap but not global variables
|
|||
|
Neither global variables nor heap
|
|||
|
Both heap and global variables
|
|||
View Answer
Discuss in Forum- «
- 1(curent)
- »