Dark Mode

Answers by Prashant.

3 votes

601

counting semaphore related question
A binary semaphore ensures mutual exclusion. Does a counting semaphore ensure mutual exclusion too? Please justify your answers.

answered in Operating System Nov 13, 2015

1.6k views

2 votes

602

answered in Databases Nov 13, 2015

281 views

2 votes

603

db

answered in Databases Nov 13, 2015

443 views

11 votes

604

GATE CSE 2006 | Question: 78
Barrier is a synchronization construct where a set of processes synchronizes globally i.e., each process in the set arrives at the barrier and waits for all others to arrive and then all processes leave the barrier. Let the number of ... need not be inside a critical section The barrier implementation is correct if there are only two processes instead of three.

answered in Operating System Aug 9, 2015

18.2k views

7 votes

605

GATE IT 2006 | Question: 55
Consider the solution to the bounded buffer producer/consumer problem by using general semaphores $S, F,$ and $E$. The semaphore $S$ is the mutual exclusion semaphore initialized to $1$. The semaphore $F$ corresponds to the number of free slots in the buffer and is ... Signal $(F)$ in the Consumer process (I) only (II) only Neither (I) nor (II) Both (I) and (II)

answered in Operating System Aug 9, 2015

13.3k views

2 votes

606

b+ tree order
Assume block size 4096 bytes,size of key is 4 bytes,size of pointer is 8 bytes.How many keys are possible per blocks for b+ tree organisation? (a) 155 (b) 154 (c) 341 (d) 340

answered in Databases May 23, 2015

2.6k views

Page:

« prev
1
...
16
17
18
19
20
21