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.3 required=5.0 tests=BAYES_00,INVALID_MSGID autolearn=no autolearn_force=no version=3.4.4 X-Google-Language: ENGLISH,ASCII-7-bit X-Google-Thread: 103376,6c13cc000274246b X-Google-Attributes: gid103376,public From: Dale Stanbrough Subject: Re: Please Help. Date: 1997/09/13 Message-ID: <5ve45l$dcr$1@goanna.cs.rmit.edu.au>#1/1 X-Deja-AN: 272142895 Distribution: world References: <01bcbcde$f8a425c0$ca70fe8c@default> <34197042.7CFC@gsfc.nasa.gov> X-XXMessage-ID: Organization: Royal Melbourne Institute of Technology Newsgroups: comp.lang.ada Date: 1997-09-13T00:00:00+00:00 List-Id: "Fine, this is perfectly reasonable, but it is about specific Ada features, and is thus on the general scale of what one tries to teach, not particularly important. I cannot over-emphasize the importance of teaching early on the principles of abstraction, separation of spec and implementation, and incremental design. These are not easy subjects to teach (whereas teaching technical gizmos in any language is by comparison a relatively easy task). You can turn this around by the way, it is easy to learn technical gizmos, it is MUCH harder to learn what abstraction is about." Ah, i guess that ~3 weeks on different list representations with an examination of linked lists implemented in arrays (2 weeks), only then followed by the dynamic memory gizmo, is the right way to go :-). Dale