CS/SE 2C03. Sample solutions to the assignment 2.
Total of this assignment is 198pts, but 100% = 181pts. There are bonus 17 points. Each
assignment is worth 7%. Some solutions below are just sketches.
If you think your solution has been marked wrongly, wr
CS/SE 2C03. Sample solutions to the assignment 4.
Total of this assignment is 203 pts. Each assignment is worth 7%.
If you think your solution has been marked wrongly, write a short memo stating
where marking in wrong and what you think is right, and resu
CS/SE 2C03. Sample solutions to the assignment 3.
Total of this assignment is 220pts, but 100% = 195 pts. There are 25 bonus points. Each
assignment is worth 7%. Some solutions below are just sketches.
If you think your solution has been marked wrongly, w
SE/CS 2c03. Sample solutions to the assignment 3.
Total 235 pts. Each assignment is worth 7%.
If you think your solution has been marked wrongly, write a short memo stating
where marking in wrong and what you think is right, and resubmit to me during
clas
Solutions to Midterm
1.[10] a.[5] Using only definition of O(f(n) prove that the following statement is true:
2n2/(log n + 1) = O(n2)
b.[5] Using only definition of O(f(n) prove that the following statement is false:
2n2 +1 = O(n)
a) We claim that 2n2/(lo
SOLUTIONS TO THE MIDTERM TEST
1.[10] a.[5]
b.[5]
6n3/(log n + 1) = O(n3)
Let c=7, n0=2. For all n 2, log n 1, and log n +1 2
Then, 6n3/(log n +1) 6n3/2 = 3n3 7n3 hold.
10n3 +9 = O(n).
We have to find such n (not necessarily the smallest one) that for ever
SE2C03. Sample solutions to the assignment 2.
Total of this assignment is 205 pts. Each assignment is worth 7%.
If you think your solution has been marked wrongly, write a short memo stating
where marking in wrong and what you think is right, and resubmit
CS/SE2C03
Assignment #4. Due April 4 (Wednesday), 2012, during a tutorial. Please put your
assignment in an envelope with your name and student number.
1.
For the graph below apply Ford-Fulkerson algorithm. Show all steps.
2.
For the graph above apply Edm
CS/SE2C03
Assignment #3. Due March 22 (Thursday), 2012, in class. Please put you assignment in an
envelope with your name and student number. Please put you assignment in an envelope
with your name and student number.
1.
Consider the following graph
4
3
h
CS/SE 2C03. Sample solutions to the assignment 1.
Total of this assignment is 131pts, but 100% = 111pts. There are 21 bonus points. Each
assignment is worth 7%.
If you think your solution has been marked wrongly, write a short memo stating
where marking i
CS/SE2C03.
Assignment #2. New version slightly different Question 9. Due February 28 (Tuesday),
2012, in class. Please put you assignment in an envelope with your name and student
number.
1.
Suppose you have the double-link list L = 9,16, 4, 1 and its arr
CS/SE 2C03. Sample solutions to the assignment 1.
Total of this assignment is 131pts, but 100% = 111pts. There are 21 bonus points. Each
assignment is worth 7%.
If you think your solution has been marked wrongly, write a short memo stating
where marking i