Anne
Dawson: CSCI201A_LAB5_FA04.htm
Last
updated: Friday 1st October 2004, 12:12 PT
This
document is subject to change without notice.
Please
report any errors or omissions in this document:
adawson@coquitlamcollege.com
Special instructions:
For this assignment you may work in teams of 2, or alone.
This lab is due at the end of the lab session.
CSCI201A
Data and Program Organization (Data Structures)
Fall 2004
Lab
Assignment 5
Creating a linked list implementation of a complete binary tree.
Step 1
Study the following:
Note: you do not type in the code of your program until Step 4.
Using a linked list of node structures (or objects) write a
program to generate a complete binary tree containing 8 nodes, where each node
contains a unique integer value. You should implement an insertNode(int) method
for node insertions, and a findElement(int) method to search for the existence
of a node containing a search integer entered by the user.
Step 2
Design an algorithm (the steps to solve the problem). You should
have the algorithm approved by your instructor before going on to the next
step.
The following web page will help you design your algorithm and
pseudocode:
http://www.coquitlamcollege.com/adawson/Pseudocode.htm
Step 3
Development the pseudocode from your algorithm.
The following web page will help you design your algorithm and
pseudocode:
http://www.coquitlamcollege.com/adawson/Pseudocode.htm
Step 4
Using your pseudocode as a guide, implement your program in the
C++ or Java language.
Your program should start with a comment block that contains the
following information:
#
File: lab5.cpp or lab5.java
#
Purpose: Creating
a complete binary tree of integer elements
#
using a linked list
#
Programmer: [your name]
#
Partner: [your
partner's name]
#
Course:
CSCI201A
#
Date: Thursday 7th October 2004
# Test
data:
Step 5
Test your program by running supplying
your own test data. You should test your program with at least 3 sets of test
data. Show your test data and results in comments at the top of your program.
Step 6
At the end of the class, save your
program file (lab5.cpp or lab5.java) to your folder on the network in:
CSCI201A\Week05\Lab05
Program
points will be based on the following marking scheme:
Marking
Scheme:
CSCI201A
- Lab 5 -
Creating a linked list implementation of a complete binary tree.
Student
name(s):
|
Category |
Points |
Description |
|
Algorithm |
15 |
An informal description of the
steps that must be taken to solve the problem. |
|
Pseudocode |
15 |
A formal description of the
steps that must be taken to solve the problem. |
|
Comments |
10 |
The program is commented appropriately. |
|
Style |
15 |
The source code should be indented properly,
use meaningful variable names and identifiers, use good programming practices,
etc. See the book, website and lectures for examples. |
|
Output |
10 |
Screen prompts and results should be
user-friendly. |
|
Correctness |
15 |
The program should output correct results. |
|
Completeness |
10 |
The program should be complete. |
|
Test |
10 |
Comments in the code explain how the code was
tested. |
Assignment Presentations : In the next class, a random selection
of lab assignment programs will be presented to the CSCI201A group.
