MIME-Version: 1.0 Server: CERN/3.0 Date: Monday, 06-Jan-97 19:23:39 GMT Content-Type: text/html Content-Length: 2290 Last-Modified: Tuesday, 17-Dec-96 19:09:43 GMT
Instructor: Vijaya Ramachandran
Unique Number: 47840
.
Here are my responses to all questions I have received so far. (The questions posed are in quotes.)
``Problem 1 a) the last sentence " ... takes more time on sigma' than on sigma." What does the word "time" refer? Amortized time ot Total time or others?''
``Problem 1 ) well-known faces: Any data structure for disjoint sets requires Big-Omega(ma(m,n)) time in the worst case, but in our text book it is Big-O, not Big-Omega, is there any difference?''
``Problem 4) the last sentence: "... no two vertices on the cycle contain distinct labels from the same Li?" , so two vertices on the cycle can contain same labels , right?''
``I think the problem 3 in the final exam is a little unclear. Does f(X) denote the size of the largest true k x k submatrix or the size of the largest true l x m submatrix of X, where l does not have to equal to m?''
.