comp.lang.ada
 help / color / mirror / Atom feed
From: "chris.danx" <chris.danx@ntlworld.com>
Subject: Re: Help: my list adt is broken
Date: Mon, 12 Feb 2001 23:09:44 -0000
Date: 2001-02-12T23:09:44+00:00	[thread overview]
Message-ID: <d3_h6.279$mO6.15977@news6-win.server.ntlworld.com> (raw)
In-Reply-To: mailman.982012511.16870.comp.lang.ada@ada.eu.org

Actually, it isn't a homework assignment!  I'd already done that ages ago, i
wanted a proper linked list for future use.  My last attempt (for the
assignment (well before christmas)), wasn't suitable as i had to modify it
horribly.  First a routine had to be added to split a list in two and then
another to join them.  I was implementing a recursive quicksort on a doubly
linked list.  Somewhere in these two routines the ADT got mangled and the
display routine displayed the list infitely (the tail pointed to the head,
or something) i didn't have time to weed out the bug.

{
they don't really encourage debugging at uni, it never got a mention.  this
was probably because they don't  keep level 1 and level 2 courses in sync.
it so annoying!  they don't know what we've done and what we ain't.  someone
should give them a kick up the pants!  the level 1 IP (introductory
programming) module didn't do debugging as it simplified learning Ada by
wrapping things up in a neat little package -- i've been programming for 8
years so it wasn't really hard especially with my Pascal background, but it
was fun.  FP1 (further programming level 1) was pants to put it mildly.  The
guy more or less stuck slides on the OHP and read from them (word for word,
i might add).  I and many others hated it!  Come back Quintin, that's what i
say!

maybe i should start a new thread:

how not to teach Ada at uni.

any interest?

[i'd never implemented a linked lists until i got to uni.  why?  well i had
one book (a small one) which didn't cover them.  when i got a copy of C and
1000+ page book (before Ada 95 came along) i freaked, and stuck with Pascal.
i wonder why]

just don't get me started on HCI1 and CF1.
}



So, don't go assuming that it's for homework.  I'd say as much if it were
the case.


{If you really must know, i'm using the ADT in an Adjacency List
implementation of a graphs (so i can tinker with program representation and
visualisation ).}




A somewhat tired (and frustrated) but thankful,
Chris Campbell

p.s. i appologise for being short, i'm very tired and frustrated.  It's been
a long day.

p.p.s i know i waffle a lot.


the opinions here in are my own, and not those of my uni.





  reply	other threads:[~2001-02-12 23:09 UTC|newest]

Thread overview: 18+ messages / expand[flat|nested]  mbox.gz  Atom feed  top
2001-02-12 21:14 Help: my list adt is broken schwarza
2001-02-12 23:09 ` chris.danx [this message]
2001-02-13  1:42   ` Jeffrey Carter
  -- strict thread matches above, loose matches on Subject: below --
2001-02-13 15:35 schwarza
2001-02-14 11:47 ` John English
2001-02-11 21:05 chris.danx
2001-02-11 21:08 ` chris.danx
2001-02-12 14:55 ` Ted Dennison
2001-02-11 21:04 chris.danx
2001-02-11 23:01 ` Larry Hazel
2001-02-12  0:29 ` tmoran
2001-02-12  0:29 ` Chad R. Meiners
2001-02-12 12:17 ` chris.danx
2001-02-12 12:50 ` chris.danx
2001-02-12 14:23   ` John English
2001-02-12 15:10     ` chris.danx
2001-02-12 17:33 ` chris.danx
2001-02-12 20:00   ` tmoran
replies disabled

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