Which of the following two operations are provided by the IPC facility?

A Process Control Block(PCB) does not contain which of the following?

A single thread of control allows the process to perform __________
The child process can __________
If an OS design needs to maximize flexibility and allow custom resource management by applications,
which structure would be most suitable?
In order to allow only one process to enter its critical section, binary semaphore are initialized to;
Two atomic operations permissible on Semaphore are;
Test and Set instruction is executed _________.
What is Dispatch latency?
Scheduling is done so as to ____________
What is Response time?
Deadlock prevention is a set of methods ____________
Each request requires that the system consider the _____________ to decide whether the current request
can be satisfied or must wait to avoid a future possible deadlock

If a process of size 30 KB arrives, and the available memory partitions are 45 KB, 50 KB, and 40 KB,
which block will First Fit allocate?

When the memory allocated to a process is slightly larger than the process, then ____________

In fixed size partition, the degree of multiprogramming is bounded by ___________

The address of a page table in memory is pointed by ____________
In which type of memory allocation scheme is compaction most commonly used?
Out of the following, which algorithm chooses the page that has not been used for the longest period of
time whenever the page required to be replaced
A page fault occurs when
When the page fault rate is low ____________
If no frames are free, _____ page transfer(s) is/are required.
Optimal page replacement algorithm is difficult to implement, because
Which algorithm selects the disk I/O request that requires the least movement of the disk arm from the
current position?
Which algorithm may lead to starvation of some requests?
The signal operation of the semaphore basically works on the basic _______ system call.
A process executes the code;
for(i=1; i <= 3; i++)
fork();
fork();

How many new processes are created?

Consider the set of 5 processes whose arrival time and burst time are given below-
Process Id Arrival time Burst time
P1 0 5
P2 1 3
P3 2 1
 P4 3 2
P5 4 3 If the CPU scheduling policy is Round Robin with time quantum = 2 unit, calculate the average
waiting time.

An operating system uses Shortest Remaining Time first (SRTF) process scheduling algorithm. Consider
the arrival times and execution times for the following processes: Process Execution time Arrival time
P1 20 0
P2 25 15
P3 10 30
P4 15 45
A system is having 3 user processes P1, P2 and P3 where P1 requires 3 units of resource R, P2 requires 2
units of resource R, P3 requires 4 units of resource R. The minimum number of units of R that ensures no
deadlock is _____?
A system has 64 MB of RAM and uses 4 KB pages. How many frames are available in the physical
memory?
With segmentation, if there are 64 segments and maximum segment size is 128 words; How many bits is
the length of logical address?
Logical address is 1100, page size is 256 bytes. The Page Table has an entry (Page 4, Frame 12). What is
the physical address?
If a page size is 2 KB and logical address is 5000, Calulate the page no. for the provided values
Calculate the size of memory if its address consists of 32 bits and the memory is 2-byte addressable.
For 5 page frames, the following is the reference string:
24516730237034214231
How many page faults does the LRU page replacement algorithm produce?
Consider the following page reference string. 1 2 3 4 2 1 5 6 2 1 2 3 7 6 3 2 1 2 3 6 For FIFO page
replacement algorithms with 3 frames, the number of page faults is?
Consider the following page reference string.
1234215621235432
For Optimal page replacement algorithms with 3 frames, the number of page faults is?
A system uses FIFO policy for page replacement. It has 3 page frames with no pages loaded to begin
with. The system first accesses 100 distinct pages in some order and then accesses the same 100 pages but
now in reverse order. How many page faults will occur?
Consider a single level paging scheme with a TLB. Assume no page fault occurs. It takes 20 ns to search
the TLB and 100 ns to access the physical memory. If the effective memory access time is 130 ns, TLB
hit ratio is ____.
Consider a disk queue with requests for I/O to blocks on cylinders 96, 176, 37, 122, 14, 124, 65, 69. The
FCFS scheduling algorithm is used. The head is initially at cylinder number 45. The cylinders are
numbered from 0 to 199. The total head movement (in number of cylinders) incurred while servicing
these requests is:
Consider a disk queue with requests for I/O to blocks on cylinders 4, 34, 10, 7, 19, 73, 2, 15, 6, 20. The
SSTF scheduling algorithm is used. The head is initially at cylinder number 50. The cylinders are
numbered from 0 to 99. The total head movement (in number of cylinders) incurred while servicing these
requests is:
Consider a disk queue with requests for I/O to blocks on cylinders 98, 183, 41, 122, 14, 124, 65, 67. The
C- SCAN scheduling algorithm is used. The head is initially at cylinder number 53. The cylinders are
numbered from 0 to 199. The total head movement (in number of cylinders) incurred while servicing
these requests is:
Consider a disk queue with requests for I/O to blocks on cylinders 98, 183, 41, 122, 14, 124, 65, 67. The
LOOK scheduling algorithm is used. The head is initially at cylinder number 53. The cylinders are
 numbered from 0 to 199. The total head movement (in number of cylinders) incurred while servicing
these requests is:
Disk requests come to a disk driver for cylinders in the order 10, 22, 20, 2, 40, 6 and 38 at a time when
the disk drive is reading from cylinder 18. The seek time is 6 ms/cylinder. The total seek time, if the disk
arm scheduling algorithms is shortest seek time first is
A process executes the code;

fork();
fork();
fork();

Find the total number of child processes created.

Consider the set of 5 processes whose arrival time and burst time are given below-
Process Id Arrival time Burst time
P1 0 5
P2 1 3
P3 2 1
P4 3 2
P5 4 3 If the CPU scheduling policy is Round Robin with time quantum = 2 unit, calculate the average
TAT.
Consider the following processes, with the arrival time and the length of the CPU burst given in
milliseconds. The scheduling algorithm used is preemptive shortest remaining-time first. The average turn
around time of these processes is ___________ milliseconds. Process Id Arrival time Burst time
P1 0 10
P2 3 6
P3 7 1
P4 8 3
A system is having 3 user processes P1, P2 and P3 where P1 requires 31 units of resource R, P2 requires
41 units of resource R, P3 requires 21 units of resource R. The minimum number of units of R that
ensures no deadlock is _____?
A system uses a segmented paging scheme with 16-bit virtual addresses. It has 4 segments, and each page
is 512 bytes in size. How many bits are used for the page number?
Find TLB Access Time Given:
Memory access time = 100 ns
TLB hit ratio = 80%
TLB miss penalty = 200 ns (includes both page table + memory access)
Effective Access Time (EAT) = 140 ns
Find the TLB access time.
Consider a single level paging scheme. The page size is 4 KB and page table entry size is 4 bytes. The
size of page table is 4 KB. Give the division of virtual address space.
A system has a 20-bit physical address and a page size of 1 KB. How many frames are there in the
system?
Calculate the number of bits required in the address for memory having size of 64 GB. Assume the
memory is 4-byte addressable,
Consider the following page reference string.
1234215621236321236
For LRU page replacement algorithm with 4 frames, the number of page faults is?
For 4 page frames, the following is the reference string:
24516730237034214231
How many page faults does the FIFO page replacement algorithm produce?
 A system uses FIFO policy for page replacement. It has 5 page frames with no pages loaded to begin
with. The system first accesses 100 distinct pages in some order and then accesses the same 100 pages but
now in reverse order. How many page faults will occur?
Consider the following page reference string.
1234215621237632123
For Optimal page replacement algorithms with 3 frames, the number of page faults is?
Consider a single level paging scheme with a TLB. Assume no page fault occurs. It takes 100 ns to access
the physical memory. If TLB hit ratio is 60% and TLB access time is 20 ns, calculate the effective
memory access time.
Consider a disk queue with requests for I/O to blocks on cylinders 93, 176, 37, 122, 14, 124, 65, 61. The
FCFS scheduling algorithm is used. The head is initially at cylinder number 55. The cylinders are
numbered from 0 to 199. The total head movement (in number of cylinders) incurred while servicing
these requests is:
Consider a disk queue with requests for I/O to blocks on cylinders 93, 183, 37, 122, 14, 124, 65, 67. The
SSTF scheduling algorithm is used. The head is initially at cylinder number 53. The cylinders are
numbered from 0 to 199. The total head movement (in number of cylinders) incurred while servicing
these requests is:
Consider a disk queue with requests for I/O to blocks on cylinders 95, 180, 34, 119, 14, 62, 64. The C-
SCAN scheduling algorithm is used. The head is initially at cylinder number 50. The cylinders are
numbered from 0 to 199. The total head movement (in number of cylinders) incurred while servicing
these requests is:
Consider a disk queue with requests for I/O to blocks on cylinders 95, 180, 34, 119, 14, 62, 64. The
LOOK scheduling algorithm is used. The head is initially at cylinder number 50. The cylinders are
numbered from 0 to 199. The total head movement (in number of cylinders) incurred while servicing
these requests is:
Disk requests come to a disk driver for cylinders in the order 10, 22, 20, 2, 40, 6 and 38 at a time when
the disk drive is reading from cylinder 18. The seek time is 6 ms/cylinder. The total seek time, if the disk
arm scheduling algorithms is SCAN is