This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: The program would create AVL trees with 1000 nodes, 2000 nodes, 3000 nodes and print above men-tioned two measurements for each. 1 2 Associated Documentation Two kinds of documentation are expected with your programs. 1. The ﬁrst one is documentation with the code in code comments describing the code itself. You are expected to follow good programming practices. See Dietel and Dietel for good programming practices. 2. Along with your code you must also submit to the evaluators a rich text document in which you describe the algorithms, and their running time analysis. 3 Group Work Policy You may discuss algorithms and implementations among your peers. However, each submission must be done completely by one student. Each instance of cheating will counted as missing two lab hours . 2...
View Full Document
This note was uploaded on 09/08/2010 for the course COMPUTERSC cs5800 taught by Professor Narayanaswamy during the Spring '10 term at Indian Institute of Technology, Chennai.
- Spring '10