CSc 445: Homework Assignment 1
Assigned: Wednesday Jan 23 2008, Due: 10:30 AM, Monday Feb 4th 2008
Clear, neat and concise solutions are required in order to receive full credit so revise your work ca
CSc 445: Homework Assignment 5
Assigned: Wednesday March 31 2008, Due: 10:30 AM, Monday April 14 2008
Clear, neat and concise solutions are required in order to receive full credit. Revise your work
CSc445 Homework #4 Due: 6/23/2016
Instructions.
1. You could submit a pdf of the homework, either printed or hand-written and scanned,
as long as it is easily readable.
2. If your solution is not clea
Yawen Chen
CSc445-HW5
06/28/2016
0. Did on the whiteboard.
1. For the question, because u just joined set S, we have the three types of vertices in the priority
queue Q, we define that vertex Vi is o
Yawen Chen
CSc445-HW4
06/22/2016
is universal, then if
|cfw_h H :h ( x )=h ( y ) |= mB
, for this question
1. According to the definition of the universal of a hash function, if
x , y U , where
x y ,
CSC 445 - HW 2
Yawen Chen
06/01/2016
1. Algorithm: Because the roads are either horizontal or vertical, thus, the person can start at
any random point P, then the person should go to the North for len
Yawen Chen
CSc445-HW5
06/28/2016
0. Did on the whiteboard. J
1. For the question, because u just joined set S, we have the three types of vertices in the priority
queue Q, we define that vertex Vi is
Cs445 Homework #2. Due: Midnight, June 3, 2016.
Instructions.
1. You could submit a pdf of the homework, either printed or hand-written and scanned, as long as it
is easily readable.
2. If your soluti
CSC 445 - HW 2
Yawen Chen
06/01/2016
1. Algorithm: Because the roads are either horizontal or vertical, thus, the person can start at
any random point P, then the person should go to the North for len
Yawen Chen
CSc445-HW4
06/22/2016
1. According to the definition of the universal of a hash function, if is universal, then if
, , where , we have : =
, therefore,
.
/
.
= , for this question = =
/
CSc445 Homework #5. Due: June 30 2016 at midnight.
Instructions.
1. You could submit a pdf of the homework, either printed or hand-written and scanned, as long as it
is easily readable.
2. If your sol
CSc 445: Homework Assignment 1 Solutions
February 5, 2008
1. Consider the problem of determining whether an arbitrary sequence x1 , x2 , . . . , xn of n numbers contains repeated occurences of some
CSc 445: Homework Assignment 2
Assigned: Monday Feb 4 2008, Due: 10:30 AM, Monday February 18 2008
Clear, neat and concise solutions are required in order to receive full credit. Revise your work car
CSc 445: Homework 2 Solutions
February 20, 2008
1. Finding k [1.n] efficiently s.t A[1.k] is increasing and A[k + 1.n] is decreasing. Solution We use a fairly straightforward variant of the binary
CSc 445: Homework Assignment 3
Assigned: Monday Feb 18 2008, Due: 10:30 AM, Monday March 3 2008
Clear, neat and concise solutions are required in order to receive full credit. Revise your work carefu
CSc 445: Homework 3 Solutions
March 3, 2008
1. Negabinary arithmetic. Solution a We can use the division method for converting decimal to binary. Here are the steps: Step 1 Step 2 Step 3 Step 4 the
CSc 445: Homework Assignment 4
Assigned: Wednesday March 12 2008, Due: 10:30 AM, Monday March 31 2008
Clear, neat and concise solutions are required in order to receive full credit. Revise your work
CSc 445: Homework 4 Solutions (rev 2)
April 1, 2008
1. Monthly Software Purchases Given n distinct growth rates c1 , . . . , cn , we sort the growth rates into descending order. This can be achieved