Que: (11).
Which CPU scheduling algorithm selects the ready process with the smallest next CPU burst and, in its non-preemptive form, runs it until completion or blocking?
Que: (12).
A Round Robin CPU scheduler uses a time quantum of 4 ms. Three processes P1, P2 and P3 arrive at time 0 with CPU burst times of 5 ms, 3 ms and 1 ms, respectively. If the initial ready queue is P1, P2, P3, what is the completion time of P1?
Que: (15).
Three processes P1, P2 and P3 arrive at time 0 with CPU burst times of 6 ms, 2 ms and 4 ms, respectively. Under non-preemptive SJF scheduling, what is the average waiting time?
Que: (17).
Consider three processes P1, P2 and P3, all arriving at time 0, with burst times of 5 ms, 3 ms and 1 ms, respectively. Under non-preemptive priority scheduling, the priorities are P1 = 2, P2 = 1 and P3 = 3, where a smaller number indicates a higher priority. What is the execution order?
Que: (19).
A process arrives at time 3 ms and completes at time 12 ms. If its CPU burst time is 5 ms, what are its turnaround time and total waiting time, respectively?
Que: (22).
A binary semaphore is initialized to 1. A process successfully executes wait() and enters its critical section. What is the semaphore value immediately after the wait() operation?
Que: (24).
Which synchronization construct encapsulates shared data and operations and generally allows only one process or thread at a time to execute within its procedures?
Que: (26).
In the bounded-buffer producer-consumer problem, a buffer has N slots. Which initial semaphore values are conventionally used for empty slots, full slots and mutual exclusion, respectively?
Que: (30).
A system has three resource types. Before granting a resource request, the operating system checks whether the resulting state remains safe. Which deadlock-handling technique is being used?
Que: (31).
A system has 10 instances of a resource. The current allocation is P1 = 2, P2 = 2 and P3 = 1. Their maximum demands are P1 = 5, P2 = 4 and P3 = 3. What is the current Available amount of the resource?
Que: (35).
A memory system has 1000 KB of free memory divided into partitions of 200 KB, 300 KB and 500 KB. Which type of partitioning uses fixed-size partitions determined before process allocation?
Que: (36).
A process is allocated a 100 KB memory partition but requires only 70 KB. What type of fragmentation is primarily caused by the unused 30 KB inside the allocated partition?
Que: (40).
Free memory blocks are 100 KB, 500 KB, 200 KB, 300 KB and 600 KB. A process requires 212 KB. Which block will Best Fit allocate to the process?
Que: (42).
Free memory blocks are 100 KB, 500 KB, 200 KB, 300 KB and 600 KB. A process requires 212 KB. Which block will Worst Fit allocate to the process?
Que: (50).
A system has three page frames and uses FIFO page replacement. For the reference string 1, 2, 3, 1, 4, 2, 5, how many page faults will occur?
Que: (52).
A system has three page frames and uses the Optimal page replacement algorithm. For the reference string 1, 2, 3, 4, 1, 2, 5, how many page faults occur?
Que: (62).
A file requires 5 disk blocks. Under contiguous allocation, the first block is 100 and the file occupies consecutive blocks. What will be the block numbers allocated to the file?
Que: (65).
A disk head is initially at cylinder 50. The request queue is 82, 170, 43, 140, 24 and 16. Using FCFS disk scheduling, what is the total head movement?
Que: (68).
A disk has cylinders 0 to 199. The head is at 50 and is moving toward higher cylinders. The pending requests are 82, 140, 20 and 10. Under SCAN, which request will be serviced first?
Que: (70).
A disk has cylinders numbered 0 to 199. If the C-SCAN head is moving toward higher cylinders and reaches cylinder 199, where does it move next for continuing the circular scan?
Que: (78).
Which I/O technique allows a device controller to transfer a block of data directly between an I/O device and main memory without continuous CPU intervention?
Que: (82).
Which of the following is a security threat in which an attacker attempts to obtain confidential information by pretending to be a trusted entity?
Que: (84).
Which operating system concept allows multiple programs to reside in main memory at the same time so that the CPU can switch to another program when one is waiting for I/O?
Que: (86).
A computer system has two or more CPUs that can execute processes simultaneously. Which operating system concept is associated with this system?
Que: (87).
Which type of operating system manages a group of networked computers and makes their resources appear to users as part of a coordinated system?
