Recent questions tagged tbb-os-2

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...

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 ...

Consider a program to be run on a computer system in round-robin CPU scheduling. The size of the program is $100K$. It is given that the hard disk has a transfer rate of ...

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...

Consider a paging system with the page table in memory. Each memory reference takes $200$ ns. The TLB has hit ratio of $75 \%$ and the time to look for pages in TLB is al...

What will be the output of the following piece of code?Void foo() { int i=1; fork(); i++; printf(“%d”,i); fork(); i++; printf(“%d”,i); fork(); i++; printf(“%d”,i); }$2 \ ...

Suppose the page table for the process currently executing looks like the following.All numbers are decimal, everything is numbered starting from zero, and all addresses ...

A moving arm disk-storage device has the following specifications. Number of tracks per recording surface – $200$ Disk – rotation speed – $2400$ rpm Track storage capacit...

A uniprocessor system has two resources of type A and B shared by four processes. There are $4$ units of each resource type available after allocation. Let “current” indi...

Suppose the disk drive has $200$ cylinders ( numbered $0$ to $199$). The drive is currently serving the request at cylinder $53$. The previous request was at cylinder $2...

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...

Assume we have a demand-paged memory. The page table is held in registers. It takes $8$ milliseconds to service a page fault if an empty page is available or the replaced...

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...

The address sequence generated by tracing a particular program, executing in a pure demand paging system with $100$ records per page, with $1$ free main memory frame is r...

Which of the following statements are not true?All unsafe states are deadlocksA deadlock state is unsafe stateA system is in safe state only if there exists a safe sequen...

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...

Consider the $2$ – process solution to the Critical Section problem (here i refers to the current process and j is the other process )Process Pirepeat flag[i] = true; whi...

The virtual memory system uses the demand paging for its implementation. The probability of getting page faults is $0.25$, the normal memory access time is $200$ nanoseco...

A certain computer provides its users with a virtual-memory space of $2^{32}$ bytes. The computer has $2^{18}$ bytes of physical memory. The virtual memory is implemented...

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...

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 ...

Assume that pages are $128$ words in size. Consider below code snippet whose function is to initialize to $0$ each element of a $128$ – by – $128$ array. Then number of p...

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...

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...

A system that uses a two-level page table has $2^{12}$ – byte pages and $32$ – bit virtual addresses. The first $8$ – bits of the address serve as the index into the firs...

Let us initialize counting semaphore $X$ to $5$. Assume that processes $P_i$ where $i= 1$ to $15$ are coded as follows.while (1) { P (x); { critical section } V (x); }an...

Consider a situation, in which several people are executing copies of a mail program. Which of the following statements is/are not correct:All the users share one program...

Given memory partition of $100K, \ 500K, \ 200K, \ 300K$ and $600K$ in order, if we have processes needing memory of $212K, \ 417K, \ 112K$ and $405K$ respectively, whic...

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...