A. PROJECT REPORT and PRESENTATION for CS 230B:
----------------------------------------------

1. Functionality:  (3-4 minutes)
	What all does your implementation do?
	Describe all the high level functions.
	[A brief user's manual, so to speak.]

2. Algorithmic Ideas:  (6-8 minutes)
	Briefly discuss the "major" algorithms involved.
	If the algorithm is one discussed in the class, then just mention it.
	Otherwise, describe in enough details for anyone in the class 
		to follow.
	For any new algorithm, if you are able to analyze it
	(time complexity, running time, etc), include that.

3. Experimentation:  (6-8 minutes)
	What experiments did you do to evaluate the performance of your
	algorithms?  Explain how you generated the data, what problem 
	sizes you tested, and what you measured.

	Different network topologies? 
	Some sample examples: grid, series-parallel graphs, random.
	
	Summarize your findings. Examples: 
		effect of topology on performance; 
		scaling with #nodes, #edges, etc.
	
4. Conclusions: (1-2 minutes)
	What conclusions do you draw from this experience?
	Were there any surprises?
	What would you recommend to a user who wants to use your code
	in an industrial setting?
	
------------------------------------------------------------------
	

B. PRESENTATION ADVICE.

1. You can decide if one, or more members should present.
	Presenter does not get extra credit for it. 
	Better to do the best possible presentation...

2. The GUI of the implementation can be a good way to "animate" or 
	illustrate how the program works.

3.  But DO NOT improvise the animation or example. Figure it out beforehand, 
	and practice it, so that it goes smoothly and quickly.

4. Thing hard about what "performance tables/charts" to show.
	Ask yourself what each experiment is trying to achieve, and is 
	it something worthwhile. An ideal experiment should be preceded by 
	an interesting HYPOTHESIS that is either validated or contradicted 
	by the experiment.

--------------------------------------------------------------------