From: gyukl@melpar.esys.com (Greg Yukl)
Subject: TCL study group, program ideas
To: leary@netmentor.com
Date: Mon, 26 Aug 1996 14:01:02 -0400 (EDT)
X-Mailer: ELM [version 2.4 PL23]
Mime-Version: 1.0
Content-Type: text/plain; charset=US-ASCII
Content-Transfer-Encoding: 7bit
Status: RO
X-Status:

I've come up with some ideas for programs that you could use TCL to implement.

I make no claim that TCL is the best way to do these sorts of things,
but it should be educational to see what problems you encounter.

Don't consider implementing one of these programs any kind of requirement --
you can come up with your own ideas for programs or simply
not do one at all.

If you would like hints, just ask.

Greg Y

------------------------------------------------------------------------------------------------
1. Given a baseline tree and a CM4SQA/SCCS baseline tree, write a program that finds checked out
files in a development tree.

If you wish to make this more interesting, also find files that are in the baseline
and/or development trees but do not belong there.

You may also wish to provide a capability to display the baseline directory corresponding
to a given development directory.

------------------------------------------------------------------------------------------------
2. Write a program to do a recursive grep, displaying matching files under their directory
headings. Decide on what sort of information you wish to display. Compare
the speed of your program to the standard "find . -exec grep string {} \; -print"
construct.

------------------------------------------------------------------------------------------------
3. Write a program to allow the user to seperate standard input into fields and
process using TCL scripts (much like simple awk commands do).

------------------------------------------------------------------------------------------------
4. Use TCL lists to implement a tree data structure. Any variant of tree
is acceptable (e.g. binary search tree, B tree, B+ tree, AVL tree,
splay tree).

(Algorithms for doing this sort of thing can be found in many data structures books.
If you feel like going ahead in the book, implement a graphical interface to
view the tree.)

------------------------------------------------------------------------------------------------
5. Write a TCL program to implement a graph data structure.