Related Questions

Consider the following solution to the producer-consumer synchronization problem. The shared buffer size is ?. Three semaphores empty, full and mutex are defined with respective initial values of 0, ? and 1. Semaphore empty denotes the number of available slots in the buffer, for the consumer to read from. Semaphore denotes the number of available slots in the buffer, for the producer to write to. The placeholder variables, denoted by P, Q, R, and S, in the code below can be assigned either empty or full. The valid semaphore operations are: wait ( ) and signal ( ). Producer: Consumer: do {         wait (P) ;         wait (mutex) ;         //Add item to buffer         signal (mutex) ;         signal (Q) ; } while (1) ; do {          wait (R) ;          wait (mutex) ;          //Consume item from buffer          signal (mutex) ;          signal (S) ; } while (1) ;   Which one of the following assignments to P, Q, R and S will yield the correct solution?
Which of the following assertions are CORRECT? P: Adding 7 to each entry in a list adds 7 to the mean of the list Q: Adding 7 to each entry in a list adds 7 to the standard deviation of the list R: Doubling each entry in a list doubles the mean of the list S: Doubling each entry in a list leaves the standard deviation of the list unchanged
The Instruction Translation Lookaside Buffer(ITLB) is present in
In a computer system, memory mapped access takes 100 nanoseconds when a page is found in TLB. In case the page is not TLB, it takes 400 nanoseconds to access. Assuming a hit ratio of 80%, the effective access time is:
Consider a single-level page table system. with the page table stored in the memory. If the hit rate to TLB is 80%, and it takes 15 nanoseconds to search the TLB. and 150 nanoseconds to access the main memory, then what is the effective memory access time, in nanoseconds ?
If main memory access time is 400 μs, TLB access time is 50 μs, considering TLB hit as 90%, what will be the overall access time?  
Which List and Entry of Seventh Schedule of Indian Constitution are related to the election of the legislature of the State? 1. List - I, Entry 72  2. List - II, Entry 27 3. List - II, Entry 37 4. List - III, Entry 32 Select the correct answer using the codes given below.
Processes P1 and P2 have a producer-consumer relationship, communicating by the use of a set of shared buffers. P1: repeat                 Obtain a full buffer                 Empty it                 Return an empty buffer forever P2 P2P2: repeat             Obtain a full buffer             Empty it             Return an empty buffer          forever Increasing the number of buffers is likely to do which of the following? I. Increase the rate at which requests are satisfied (throughput) II. Decrease the likelihood of deadlock III. Increase the ease of achieving a correct implementation 
Which among the following attempts to read up to count bytes into buffer starting at buffer, returning the number of bytes successfully read? buffer, int offset, int count) c) Void WriteByte(byte value) d) None of the mentioned
In an adjacency list representation of an undirected simple graph G = (V, E), each edge (u, v) has two adjacency list entries: [v] in the adjacency list of u, and [u] in the adjacency list of v. These are called twins of each other. A twin pointer is a pointer from an adjacency list entry to its twin. If |E| = m and |V| = n, and the memory size is not a constraint, what is the time complexity of the most efficient algorithm to set the twin pointer in each entry in each adjacency list?