CS
3402: Advanced Structures and Algorithms
Work programming
exercises 35, 37, 38, and
39 from the end of chapter 10, page 579.
What to include:
exercises 35: d_tnodel.h
exercises 37: d_tnode.h
exercises 38: d_stree.h
exercises 39: d_stree.h,
d_random.h, and d_util.h
Write one driver
program for each problem as stated in each exercise. Test your code with
different trees of different sizes, and verify the outputs manually (for small
trees).
A good program is
easy to navigate, and is robust. Save all code for possible future use.
Make
sure to include in each
program you write with the following information: your name, KSU id, course info,
submission date, problem # and page #, and problem description. Also,
include in-line comments in your
code for major section to explain what the code does in the context of the
problem being solved. Indent and space code properly.
1. Submit in class on the due
date a printed copy of the main program and any developed classes/methods
for each programming exercise (Not the STL code).
2. Include assignment cover
page (posted on the course Webpage). No
submission will be accepted without a cover page.
3. Submit printout of sample
inputs and their outputs for each program. For each program,
staple its inputs and outputs at end of printed code.
4. Along with the printouts,
submit complete source code for each exercise to yshi04@gmail.com including header files and
other files your program uses. Please submit just ONE
email with the attachment of all code files.
5. Please place you
complete submission in an envelope or a secure folder with your name on it.
6. Late submissions will be
penalized as per the Assignments Policy (15% per day).
Assignments Policy
All class assignments are part of the course final grade. Missing any assignment
counts as incomplete of the class and may result in a failing grade for the
course. Assignments must be turned in at the beginning of the class on the due
day. Late assignments will be penalized at the rate of 15% per day
including weekends. No late assignments will be accepted after four days of the
due date.
Successfully completed programs must satisfy their requirements outlined
in the programming assignments. The maximum score depends on the quality of the
program. This scale represents a general grading guideline:
(a) Partial code is not acceptable --- receives 0 points.
(b) Complete code that does not compile --- may receive up to 20%
(c) Complete code that compiles but does not run --- may receive up to 30%
(d) Complete code that runs but gives incorrect results --- may receive up
to 50%
(e) Complete code that gives complete and correct results --- receives 100%
Points may vary for each assignment depending on the complexity and
required effort. However, 10% of the grade for programs in categories (d) and
(e) above will be dedicated to proper comments and in-line documentation, and
another 10% of the grade will be dedicated to indentation, code organization,
and readability. The assignments will be graded using the C++ compiler on Cloudland server.
All assignments are individual assignments. You are encouraged to
discuss assignments with other students as long as the following rules are
followed:
(a) You may provide assistance on how to use any of the software used by
this course.
(b) You view another student's code only for the purpose of offering
debugging assistance. Students can only give advice on what to look for, but
they cannot debug your code for you. All changes to your code must be made by
you.
(c) Your discussion is subject to the empty hands policy, which means that
you leave the discussion without any record (electronic or physical) of the
discussion.