HW 1 - ComS 511 - Fall 2013
A.
B.
C.
D.
Due Date - Tuesday, September 3
Review material in Appendices A-D in CLRS; these are math prerequisites for CS 511.
Review Chapters 1-4 of CLRS. I assume that these topics have been covered in an
undergraduate class
HW 2 - ComS 511 - Fall 2013
A.
B.
C.
D.
Due Date - Tuesday, September 10
Review material in Appendices A-D in CLRS; these are math prerequisites for CS 511.
Review Chapters 1-4 of CLRS. I assume that these topics have been covered in an
undergraduate clas
HW 3 - ComS 511 - Fall 2013
A.
B.
C.
D.
Due Date - Tuesday, September 17
Review material in Appendices A-D in CLRS; these are math prerequisites for CS 511.
Review Chapters 1-4 of CLRS. I assume that these topics have been covered in an
undergraduate clas
HW1 Solution
C OM S 511, Spring 2016
1: Basic graph manipulations (10 pt)
(a) Adjacency-list
Algorithm:
Input: a directed graph G(V,E)
Output:a directed graph G| (V,E| )
1: procedure TRANSPOSE(G)
. Initialization of the adjacency list for G|
2:
3:
for eac
He Jin (168653509)
HW5
C OM S 511, November 7, 2016
1: Exercise 8.2 Search versus decision
Algorithm:
General idea:
Because weve already gotten the decision version poly-time algorithm of Hamilton path problem, we can
repeatly use it to test the graph whe
HW2 Solution
C OM S 511, Spring 2016
1: Edge connectivity (This question is not graded)
The edge connectivity of a graph can be found be reducing the problem to one of finding the maximum
flow or the minimum cut. Therefore
Edge connectivity p Maximum flow
He Jin (168653509)
HW4
C OM S 511, October 17, 2016
1: Find conditions
(1)infeasible
There is no condition that linear program is infeasible.
Because combined with the results from questions below, the only left condition is a = 0, b = 0 and it still
has
Farley Lai,00764474
TheoryofComputation,Homework5
7.6
i.)union
Withoutlos s ofgenerality ,let M 1 and M 2 betheTMs thatdec idetwolanguages L1 and L2 in
P.Thenwec ons truc taTM M thatdec ides theunionof L1 and L2 inpoly nomialtime.
M = oninput w
1. Run M 1
HW 7 - ComS 511 - Fall 2013
A.
B.
Due Date - Tuesday, October 22
Review material in Appendices A-D in CLRS; these are math prerequisites for CS 511.
Current reading assignment: all of Chapter 29 and 34 of CLRS.
C. Do the following problems:
[33] Transform
HW9 - ComS 511 - Fall 2013
A.
B.
Due Date - Tuesday, November 5
Review material in Appendices A-D in CLRS; these are math prerequisites for CS 511.
Current reading assignment: all of Chapter 29 and 34 of CLRS.
C. Do the following problems:
(42) [Horn Logi
HW 5 - ComS 511 - Fall 2013
A.
B.
Due Date - Tuesday, October 1
Review material in Appendices A-D in CLRS; these are math prerequisites for CS 511.
Current reading assignment: Chapter 26, Sections 1, 2 and 3 of CLRS.
C. Do the following problems:
[22] Con
HW 4 - ComS 511 - Fall 2013
A.
B.
C.
D.
Due Date - Tuesday, September 24
Review material in Appendices A-D in CLRS; these are math prerequisites for CS 511.
Review Chapters 1-4 of CLRS. I assume that these topics have been covered in an
undergraduate clas
HW 8 - ComS 511 - Fall 2013
A.
B.
Due Date - Tuesday, October 29
Review material in Appendices A-D in CLRS; these are math prerequisites for CS 511.
Current reading assignment: all of Chapter 29 and 34 of CLRS.
C. Do the following problems:
[37] CLRS Exer
HW 6 - ComS 511 - Fall 2013
A.
B.
Due Date - Tuesday, October 15
Review material in Appendices A-D in CLRS; these are math prerequisites for CS 511.
Current reading assignment: Chapter 29, Sections 1, 2 and 3 of CLRS.
C. Do the following problems:
[27] Fa
C OM S 511, October 8, 2016
1: Exercise 29, Chapter 7, of K&T.
The problem can be formulated into a graph which can use Min-Cut algorithm for finding a subset
SN ew cfw_1, 2, ., n of applications that undergo improvement with maximised value of benefits a