Heres a couple of excerices you might try,
- Implement a binary tree using arrays as nodes , then reimplement using hashes. Operations defined should be depth first traversal (inorder, preorder and postorder) along with breadth first traversal, insertion, deletion, and merge operations.
- Convert the previous implementation into a fully object oriented one.
- Change the binary tree to a 2-3 tree.
- Implement a version of Data::Dumper. Try to add a feature that Data::Dumper doesnt have, but dont try to replicate all of the functions it does.
- Implement a huffman encoder. Try not to use any of the methods used on site. :-) Then check against the site.
- Write a game, pick any simple game like hangman or the like
- Take any program you have written in another language, and rewrite it so it runs under perl.
- Take an existing program and try to rewrite it without using block style loops. map{} grep{} and modifiers are ok.
Some or all of these are what I found particularly instructive as i learned perl.
Yves / DeMerphq
---
Software Engineering is Programming when you can't. -- E. W. Dijkstra (RIP)
