Register
Filter

Answers by Bikram

2 votes
521
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...
1 votes
523
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...
6 votes
529
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...
1 votes
533
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...
5 votes
538
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 ...
2 votes
540
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...
1 votes
541
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...
1 votes
544
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...
1 votes
545
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 _______
2 votes
546
ACE test series
I am getting 676
I am getting 676
2 votes
547
Test by Bikram | Compiler Design | Test 1 | Question: 30
Consider the following grammar: $S \rightarrow L = P \mid P$ $L \rightarrow ^*P \mid id$ $P \rightarrow L$ The above grammar is: Ambiguous SLR(1) LALR(1) None of the above
Consider the following grammar:$S \rightarrow L = P \mid P$$L \rightarrow ^*P \mid id$$P \rightarrow L$The above grammar is:AmbiguousSLR(1)LALR(1)None of the above
3 votes
548
Test by Bikram | Computer Networks | Test 1 | Question: 18
Number of subnets can be formed by using the subnet mask $255.255.248.0$ in a class B network _________
Number of subnets can be formed by using the subnet mask $255.255.248.0$ in a class B network _________
2 votes
549
ACE test series
I am getting 676
I am getting 676
Page: