| Line 1: | Line 1: | ||
| + | [[Category:PeerLegacy]] | ||
| + | [[Category:ECE368]] | ||
| + | = [[Peer_legacy |Peer Legacy]] for [[ECE368]]: Data Structures = | ||
| − | + | * This class is called Data Structures, but the basis is Algorithms. In fact, there is a CS course called Algorithms that is almost identical to this course. When I took this course, our final project was to use Huffman Compression to compress text/image files using trees. This was a fairly exciting project because it was the first project we did in ECE that actually had real world uses. When you take this course, I would advise that you keep some kind of a genealogy tree relating all the different types of data structures, as many of them are very similar and it's a good idea to develop a method of keeping them all straight. --- [[User: lrprice|Larry Price]] | |
| + | *Write a comment. -sign your name/nickname. | ||
| − | + | ---- | |
| − | + | [[Peer_legacy|Back to Peer Legacy page]] | |
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | [[ | + | |
Latest revision as of 06:09, 24 April 2012
Peer Legacy for ECE368: Data Structures
- This class is called Data Structures, but the basis is Algorithms. In fact, there is a CS course called Algorithms that is almost identical to this course. When I took this course, our final project was to use Huffman Compression to compress text/image files using trees. This was a fairly exciting project because it was the first project we did in ECE that actually had real world uses. When you take this course, I would advise that you keep some kind of a genealogy tree relating all the different types of data structures, as many of them are very similar and it's a good idea to develop a method of keeping them all straight. --- Larry Price
- Write a comment. -sign your name/nickname.
