From mboxrd@z Thu Jan  1 00:00:00 1970
X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me
X-Spam-Level: 
X-Spam-Status: No, score=-1.9 required=5.0 tests=BAYES_00,FREEMAIL_FROM
	autolearn=unavailable autolearn_force=no version=3.4.4
X-Received: by 10.107.17.25 with SMTP id z25mr17908798ioi.34.1462647056967;
        Sat, 07 May 2016 11:50:56 -0700 (PDT)
X-Received: by 10.182.117.135 with SMTP id ke7mr275607obb.13.1462647056905;
 Sat, 07 May 2016 11:50:56 -0700 (PDT)
Path: 
 eternal-september.org!reader01.eternal-september.org!reader02.eternal-september.org!news.eternal-september.org!mx02.eternal-september.org!feeder.eternal-september.org!news.glorb.com!i5no5093233ige.0!news-out.google.com!k10ni96igv.0!nntp.google.com!i5no5093224ige.0!postnews.google.com!glegroupsg2000goo.googlegroups.com!not-for-mail
Newsgroups: comp.lang.ada
Date: Sat, 7 May 2016 11:50:56 -0700 (PDT)
In-Reply-To: <410b222c-9443-46b7-8a18-2fc3d05772a9@googlegroups.com>
Complaints-To: groups-abuse@google.com
Injection-Info: glegroupsg2000goo.googlegroups.com; posting-host=24.6.21.101;
 posting-account=Qh2kiQoAAADpCLlhT_KTYoGO8dU3n4I6
NNTP-Posting-Host: 24.6.21.101
References: <410b222c-9443-46b7-8a18-2fc3d05772a9@googlegroups.com>
User-Agent: G2/1.0
MIME-Version: 1.0
Message-ID: <952fe73b-6e0e-4101-a61a-dc6359442d1d@googlegroups.com>
Subject: Re: Help with tasks
From: Anh Vo <anhvofrcaus@gmail.com>
Injection-Date: Sat, 07 May 2016 18:50:56 +0000
Content-Type: text/plain; charset=ISO-8859-1
Content-Transfer-Encoding: quoted-printable
Xref: news.eternal-september.org comp.lang.ada:30351
Date: 2016-05-07T11:50:56-07:00
List-Id: <comp.lang.ada>

On Saturday, May 7, 2016 at 7:53:29 AM UTC-7, danif...@gmail.com wrote:
> Hi! i'm a student, and got stucked with an ada home project, and i need a=
 lot of help sadly, i can't even ask a specific question, because i have a =
lot, but it's about tasks and protected objects.
>=20
> The project: There's a garden with 10 plots, and a locust gets in 1 of th=
e plots, so the gardener wants to kill it with poison. The locust randomly =
changes plots in a time, and the gardener can spray 1 plot/day (either rand=
omly), which gets clean from poison after that day has passed. The locust d=
ies if it jumps into the sprayed plot, or is in it already. The simulation =
goes until the locust dies. For the random number generation and the consol=
e output use a common protected object. (Monitor)
>=20
> I've tried all day to implement it with no luck, and feel that i need a c=
omplete solution to analyze and learn from its code lines, but any help is =
appreciated.
> Thanks!

I am glad with your honesty.

I suggest to create three tasks, gardener task, locust task and monitor tas=
k. In addition, these tasks will operate on an array of data structure (you=
 should design it) through protected object. Task monitor will monitor to s=
ee if the gardener task and locust task operate at the same plot at the sam=
e time. If it does, mark the plot as completed and check for the remaining =
plots. When all 10 plots are reached, the work is done.=20

Anh Vo