Talk:CSC 216/s08/no comparison

- I think this exercise could be misleading. It has the next field of a node contain the data value from the next node on the list. This isn't the way it's done. A student who thought the next field had to contain a data value would be seriously confused. I think that the nodes ought to be numbered, probably starting at, say, 20000, with an increment of, say, 4, between successive nodes. This would correspond to the situation where the first node was at address 20000, the second at 20004, etc.

- Students will have difficulty writing on their cards while up in the front of the classroom. They'll have to put a card down on a desk, etc., to write on it.

- I would suggest that besides the students in the linked list, one or more other students play the part of the processor, executing the algorithm and testing for whether a key value equals a data value in a node, whether a link is null, etc.

- Insertion & deletion algs. should be described in more detail.