===============================
CS3233:  (Fall 2005)
===============================
  (Due: 24-October, 8am) into the UniqueTree Workbin

Marking Assignment:
    In this assignment, you will play "instructor" and will grade
    solutions turned in by your classmates. Each student grade two
    homework and each homework is graded by me and two students.

       Grader:    Graded
       ---------------------------------
       Trung:     Zheng Jia,  Yue Chao
       YueChao:   Anders,     Ye Nan
       Anders:    Trung,      Zheng Jia
       Ye Nan:    YueChao,    Anders
       ZhengJia:  Ye Nan,     Trung
       ---------------------------------

    When grading, make sure you pay attention to correctness,
    completeness (eg: did it fulfill all the requirements required
    by the question), and conciseness/ease of understanding.
    Please also give your comments where you think things are 
    incorrect or can be made better.

For your convenience, the question is repeated here.

Written Problem:
----------------
(a) Give a small example to show that the minimum spanning tree T is not unique.
(b) What condition is necessary and sufficient for a minimum spanning tree T
    to be unique?
(c) Prove your claim in (b) above.

===============================================================================

Grader: _______________________________   Graded: ____________________________

Date:   ________________

 _______ Correctness: (out of  20)
           Does it CORRECTLY solve the problem? 

 _______ Completeness: (out of 10)
           Does it fulfill all the requirements of the question?

 _______ Conciseness:  (out of 10)
           Is the solution writeup concise, easy to read?

 _______ TOTAL (out of 40)


Your Comments: