Register

Recent questions tagged tbb-os-2

2 votes
1 answer
1
Test by Bikram | Operating Systems | Test 2 | Question: 30
Consider the following 3 processes with 3 binary semaphores with initial values $S_{0}=0, S_{1}=0, S_{2}=1$ ... $3$ processes? $211$ $200$ $210$ $201$
Consider the following 3 processes with 3 binary semaphores with initial values $S_{0}=0, S_{1}=0, S_{2}=1$$$ \begin{array}{|c|c|c|} \hline \textbf{P} & \textbf{Q} & \tex...
User Avatar
2 votes
3 answers
2
Test by Bikram | Operating Systems | Test 2 | Question: 29
In a paged memory, the page hit ratio is $0.35$. The time required to service the page fault is $100$ ns. Time required to access a page in primary memory is $10$ ns. The average time required to access a page is ________ ns
In a paged memory, the page hit ratio is $0.35$. The time required to service the page fault is $100$ ns. Time required to access a page in primary memory is $10$ ns.The ...
User Avatar
1 votes
1 answer
4
Test by Bikram | Operating Systems | Test 2 | Question: 27
A counting semaphore is initialized to $10$. The $6$ P(wait) operations and $4$ V(signal) operations were completed in this semaphore. The resulting value of semaphore is: $0$ $8$ $10$ $12$
A counting semaphore is initialized to $10$. The $6$ P(wait) operations and $4$ V(signal) operations were completed in this semaphore. The resulting value of semaphore is...
User Avatar
0 votes
1 answer
11
Test by Bikram | Operating Systems | Test 2 | Question: 20
Consider a demand-paging system with the following time-measured utilization: ... ? Increase the degree of multiprogramming Add pre paging to the page fetch algorithms Increase the page size none of the above
Consider a demand-paging system with the following time-measured utilization:$\begin{array}{ll} \text{COU Utilization} & 20 \% \\ \text{Paging disk} & 97.7 \% \\ \text{Ot...
User Avatar
3 votes
1 answer
13
Test by Bikram | Operating Systems | Test 2 | Question: 18
Consider a system with five processes $P0$ to $P4$ and three resources $R1$, $R2$ and $R3$, each having $10, \ 5, \ 7$ instances respectively. The system table at time $T0$ ... $P1, P4, P2, P3, P0$ $P3, P1, P2, P4, P0$ $P1, P4, P3, P0, P2$
Consider a system with five processes $P0$ to $P4$ and three resources $R1$, $R2$ and $R3$, each having $10, \ 5, \ 7$ instances respectively. The system table at time $T...
User Avatar
1 votes
1 answer
16
Test by Bikram | Operating Systems | Test 2 | Question: 15
There are $5$ processes which require resource instances of same type in quantities $23, \ 35, \ 12, \ 43, \ 15$ respectively. The minimum number of resource instances required for preventing deadlock is _______
There are $5$ processes which require resource instances of same type in quantities $23, \ 35, \ 12, \ 43, \ 15$ respectively. The minimum number of resource instances re...
User Avatar
0 votes
1 answer
20
Test by Bikram | Operating Systems | Test 2 | Question: 11
Suppose that a disk drive has $5000$ cylinders, numbered $0$ to $4999$. The drive is currently serving a request at cylinder $143$, and the previous request was at cylinder $125$ ... $7081, \ 1745, \ 7081$ $1745, \ 1004, \ 9600$ $9769, \ 1745, \ 7081$
Suppose that a disk drive has $5000$ cylinders, numbered $0$ to $4999$. The drive is currently serving a request at cylinder $143$, and the previous request was at cylind...
User Avatar
1 votes
1 answer
21
Test by Bikram | Operating Systems | Test 2 | Question: 10
Consider a logical address space of eight pages of $1024$ words each mapped onto a physical memory of $32$ frames. The number of bits are there in the logical address is _______
Consider a logical address space of eight pages of $1024$ words each mapped onto a physical memory of $32$ frames. The number of bits are there in the logical address is ...
User Avatar
0 votes
1 answer
23
Test by Bikram | Operating Systems | Test 2 | Question: 8
The arrival time, burst time and priorities of five processes are given as: ... For the priority scheduling algorithm the average response time is ________ minutes . Ignore the context switching overhead.
The arrival time, burst time and priorities of five processes are given as:$\begin{array}{|c|c|c|c|} \hline \text{Process} & \text{Arrival Time} & \text{Burst time} & \te...
User Avatar
1 votes
1 answer
24
Test by Bikram | Operating Systems | Test 2 | Question: 7
A computer system has $6$ tape drives with n process competing for them. Each process may need up-to $2$ tape drives. The maximum value of n from which the system is guaranteed to be deadlock free is: $2$ $3$ $4$ $1$
A computer system has $6$ tape drives with n process competing for them. Each process may need up-to $2$ tape drives. The maximum value of n from which the system is guar...
User Avatar
1 votes
1 answer
29
Test by Bikram | Operating Systems | Test 2 | Question: 2
Consider an operating system containing $n$ processes each requiring $4$ resources. The maximum number of processes that can be executed without any deadlock if there are $21$ resources is available ______
Consider an operating system containing $n$ processes each requiring $4$ resources. The maximum number of processes that can be executed without any deadlock if there are...
User Avatar
1 votes
1 answer
30
Test by Bikram | Operating Systems | Test 2 | Question: 1
Assume that a certain process executes the following code segment. for (i =0, i <=8, i++ ) fork() ; The number of new processes created is _______
Assume that a certain process executes the following code segment.for (i =0, i <=8, i++ ) fork() ;The number of new processes created is _______
User Avatar
To see more, click for the full list of questions or popular tags.