Posted by Lil' Viv on July 31, 2001 at 07:04:50:
In Reply to: today's class posted by looser on July 30, 2001 at 13:56:55:
Well, I guess I interpreted class a little differently than the others who attended. =P
But, in the beginning, he talked about how the grading script will slow down a lot at nighttime, and he talked about strategies. He said a decent start is to just turn in his trivial solutions, then build up and take it to the next step. But, he mentioned that taking it to the next step might 'cause you to lose some ground while you make progress, etc. Not too useful information, but he did mention that if just a trivial solution (the natural minimalist) was turned in, it would end up normalizing at the end as a failing grade, so we do need to try to jump to the next steps.
But, then, he went over graphs . . . which is another type of data structure. I had no idea what it was, so I asked, and he drew some pictures to illustrate a CS graph . . . like a plane's flight destinations. He went over the three basic ways to implement them, some advantages and disadvantages of each . . . array, list, tree.
Then, he showed us problems that graphs would be useful in solving, and I thought this part was quite interesting (yes, I'm a dork, apparently) . . . he showed us many practical real life problems that graphs can solve, and some that we are still waiting to solve.
And, for our next project, we have to implement this hoss of a data structure, and I think . . . solve one of those problems that is supposedly easily solveable . . . one of the easier ones he showed us.
I might have missed some stuff, but that was generally it . . .