got it! thanks :)
On Mon, Jun 20, 2011 at 6:07 PM, MONSIEUR <monsieur....@gmail.com> wrote:
> why it will be true....how does it guarantee that strict
> alteration....if 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 Sharma <akshatasharm...@gmail.com> wrote:
> > Why is C not true?
> >
> > On Sun, Jun 19, 2011 at 6:31 PM, sanjay ahuja <
> sanjayahuja.i...@gmail.com>wrote:
> >
> > > B and D are true
> >
> > > On Sun, Jun 19, 2011 at 5:43 PM, Nishant Mittal
> > > <mittal.nishan...@gmail.com> wrote:
> > > > It does not prevent deadlock so i think (D) is definitely true.
> >
> > > > On Sun, Jun 19, 2011 at 5:15 PM, Akshata Sharma <
> > > akshatasharm...@gmail.com>
> > > > wrote:
> >
> > > >> Two processes, P1 and P2, need to access a critical section of code.
> > > >> Consider the following synchronization construct used by the
> processes:
> >
> > > >> /* P1 */
> > > >> while (true) {
> > > >> wants1 = true;
> > > >> while (wants2==true);
> > > >> /* Critical Section */
> > > >> wants1=false;
> > > >> }
> > > >> /* Remainder section */
> >
> > > >> /* P2 */
> > > >> while (true) {
> > > >> wants2 = true;
> > > >> while (wants1==true);
> > > >> /* Critical Section */
> > > >> Wants2=false;
> > > >> }
> > > >> /* Remainder section */
> >
> > > >> Here, wants1 and wants2 are shared variables, which are initialized
> to
> > > >> false. Which one of the following statements is TRUE about the above
> > > >> construct?
> > > >> (A) It does not ensure mutual exclusion.
> > > >> (B) It does not ensure bounded waiting.
> > > >> (C) It requires that processes enter the critical section in strict
> > > >> alternation.
> > > >> (D) It does not prevent deadlocks, but ensures mutual exclusion.
> >
> > > >> I think B,C are true. It also prevents deadlock so D is also true,
> not
> > > >> sure though. Am I right?
> >
> > > >> --
> > > >> You received this message because you are subscribed to the Google
> > > Groups
> > > >> "Algorithm Geeks" group.
> > > >> To post to this group, send email to algogeeks@googlegroups.com.
> > > >> To unsubscribe from this group, send email to
> > > >> algogeeks+unsubscr...@googlegroups.com.
> > > >> For more options, visit this group at
> > > >>http://groups.google.com/group/algogeeks?hl=en.
> >
> > > > --
> > > > You received this message because you are subscribed to the Google
> Groups
> > > > "Algorithm Geeks" group.
> > > > To post to this group, send email to algogeeks@googlegroups.com.
> > > > To unsubscribe from this group, send email to
> > > > algogeeks+unsubscr...@googlegroups.com.
> > > > For more options, visit this group at
> > > >http://groups.google.com/group/algogeeks?hl=en.
> >
> > > --
> > > Sanjay Ahuja,
> > > Analyst, Financing Prime Brokerage
> > > Nomura Securities India Pvt. Ltd
> >
> > > --
> > > You received this message because you are subscribed to the Google
> Groups
> > > "Algorithm Geeks" group.
> > > To post to this group, send email to algogeeks@googlegroups.com.
> > > To unsubscribe from this group, send email to
> > > algogeeks+unsubscr...@googlegroups.com.
> > > For more options, visit this group at
> > >http://groups.google.com/group/algogeeks?hl=en.
> >
> >
>
> --
> You received this message because you are subscribed to the Google Groups
> "Algorithm Geeks" group.
> To post to this group, send email to algogeeks@googlegroups.com.
> To unsubscribe from this group, send email to
> algogeeks+unsubscr...@googlegroups.com.
> For more options, visit this group at
> http://groups.google.com/group/algogeeks?hl=en.
>
>
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
