Assignments should be submitted both in hard and soft copy.
Soft copies will be collected using the CSE department Course Assignment Submission System (CASS) system.
A hard copy should be deposited in the COMP3711H (not COMP3711) assignment collection box.
The box is located outside of room 4210. This
photo shows what the box looks like.
- Before using the system you MUST have an activated CSE department computer account.
- This is different than your ITSC computer account.
CSE department has created departmental accounts for all students
registered in CSE courses but they must be activated.
- If you have never used yours, please go to https://password.cse.ust.hk:8443/pass.html to activate your account BEFORE trying to submit your assignment.
you are registered in multiple courses that use CASS, you will
need to select comp3711h from the pulldown menu (do NOT select
comp3711). The assignment name in CASS will be ASSIGNMNETX where
- Revisions to Homework Assignment will also be flagged on the Revisions Log page
- Assignment 1 Assignment 1 Solutions
Assignment 2 Assignment 2 Solutions
- Due: Both hard and soft copies by October 5, 2016 at 11:59PM
Assignment 3 Assignment 3 Solutions
- Due: Both hard and soft copies by October 25, 2016 at 11:59PM
was a typo in Problem 5 (the "2" was left out of the definition
of the Fibonacci numbers. That has been corrected in the corrunt
was an error in Problem 1 that arose from two different versions being
mixed up. Paragraph 3 stated that the solution to to 4th part
could be randomized while paragraph 5 implied that it could not be.
This has been corrected to state consistently that it can NOT be
- 24/10/16 After discussions with students two more changes were made to the assignment
4 of problem 1 was REMOVED because it was ill-stated. If you
already wrote a solution to Part 4 it will not be counted
Problem 5, The requirement to write the cost in the form O(n^2) + f(n)
was relaxed. You now only have to write it in the form \Theta(f(n)).
If you write it in the original form O(n^2) + f(n) you will get extra credit.
Assignment 4 Assignment 4 Solutions
- Due: Both hard and soft copies by November 15, 2016 at 11:59PM
- Due: Both hard and soft copies by December 2, 2016 at 11:59PM
A student working on Problem 2 (2) asked whether the
Ford-Fulkerson algorithm permits edges that go in two directions in the
original input graph. The answer is YES, it does.
Please see here for more details.
Return to COMP3711H Fall 2016 Home Page