CSC C78 Homework assignments Homework assignments You can either drop the assignment off in a wednesday tutorial, or in the drop box which has been set up in front of room S625. You may find it beneficial to work on these questions, but they are not to be handed in, and they will usually not be discussed in our tutorials. Failure to acknowledge using the work of somebody else is plagiarism and will be dealt with harshly.
Every node contains one separate bit of information for every path.
If v has two children, both of them leaves, then 2 bits are needed and so on. For this question finding the exact answer is no harder than finding an approximate one. The main difference between the partition of our algorithm in class and the algorithm in the book is that in the book the set is split into 2 parts, whereas in class we split the set into 3 sets. I just found out that there seems to be no predefined 3-way comparison in some of the permitted languages. Those of you who have implemented this already will receive some amount of extra-credit for it.