see, ideally for Q1, the answer the NO.
But paging has some advantage, therefore its better to have it neverthless
Q2, ??
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To view this discussion on the web visit
@Sanket: You are wrong. Check the loops again!
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To view this discussion on the web visit
https://groups.google.com/d/msg/algogeeks/-/ifxkh_x5o0EJ.
To post to this group, send email to
@Mihir - Yea, I missed the semi-colon, got it now :-)
On Jun 27, 2:00 am, Mihir mihirmpa...@gmail.com wrote:
@Sanket: You are wrong. Check the loops again!
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to
I don't think this ensures mutual exclusion. Consider this sequence of
execution:
1. P1 - while (true)
2. P2 - while (true)
3. P1 - wants1 = true
4. P2 - wants2 = true
5. P1 - while (wants2 == true) //This will evaluate to true because of
step 4
6. P2 - while (wants1 == true) //This will
got it! thanks :)
On Mon, Jun 20, 2011 at 6:07 PM, MONSIEUR monsieur@gmail.com wrote:
why it will be truehow does it guarantee that strict
alterationif p1 comes and finishes and again comes,it will be
served no matter whether p2 is executed or not
On Jun 19, 6:31 pm, Akshata
Which book are you studying for OS ?
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algoge...@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For
On Jun 12, 1:22 pm, amit amitjaspal...@gmail.com wrote:
OS doubt:
I have read many times that say a 24 KB process enters the Main Memory
selected by the Long Term Scheduler.
But I don't understand what it exactly means.
As far as I know Process consists of ( Code + Data(Static) +
So can we say that a mutex is a binary semaphore.
On Thu, Jun 10, 2010 at 11:26 PM, souravsain souravs...@gmail.com wrote:
Originally semaphore is a concept given by Dijkstra who says it is
something that can have two operations P and V both atomic. In an OS
(for example Unix) we have kernal
Originally semaphore is a concept given by Dijkstra who says it is
something that can have two operations P and V both atomic. In an OS
(for example Unix) we have kernal objects called semaphore which
have the same two atomic oprerations. It is used to control
communication between 2 things (it
