comp.lang.ada
 help / color / mirror / Atom feed
From: "Marin David Condic" <dont.bother.mcondic.auntie.spam@[acm.org>
Subject: Re: newbe ask....
Date: Mon, 26 Nov 2001 17:31:30 -0500
Date: 2001-11-26T22:31:30+00:00	[thread overview]
Message-ID: <9tufs2$p3t$1@nh.pace.co.uk> (raw)
In-Reply-To: 9tucfv$arm$1@sunflower.man.poznan.pl

Sounds a lot like a homework problem. We don't generally do homework for
students here - unless the pay is really great :-)

If you're studying dynamic data structures, you'll have to think of your
address book problem as some form of dynamic list or map or tree. Take a
look at what you've studied so far - that ought to give you a hint about
what your prof wants you to build. Take a stab at some kind of design and
implementation. If you get stuck with specific features, you're apt to find
help here if you ask specific enough questions and show examples of the code
you have attempted.

MDC
--
Marin David Condic
Senior Software Engineer
Pace Micro Technology Americas    www.pacemicro.com
Enabling the digital revolution
e-Mail:    marin.condic@pacemicro.com
Web:      http://www.mcondic.com/


"mefiu" <jaglu@poczta.onet.pl> wrote in message
news:9tucfv$arm$1@sunflower.man.poznan.pl...
> Hi,
>
> I'm for the first time here.
> I'm just starting programming with ADA and I have a problem
> with dynamic structures in ADA.
> How to write a simple address book using ADA?
> Does anyone has any example source code?
>
> I will be greateful for any help :))
>
> diego
>
>





  reply	other threads:[~2001-11-26 22:31 UTC|newest]

Thread overview: 5+ messages / expand[flat|nested]  mbox.gz  Atom feed  top
2001-11-26 21:34 newbe ask mefiu
2001-11-26 22:31 ` Marin David Condic [this message]
2001-11-26 22:50 ` chris.danx
2001-11-27 16:59 ` Michal Nowak
2001-11-27 18:07 ` Nick Roberts
replies disabled

This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox