CSE 3500 Algorithms and Complexity Yufeng Wu Spring 2011
Homework 8 - Due: 04/28/11 in class.
1
Hamilton cycle
Do Exercise 34.2-3 (p.1065). Note the definition on p.1062 does not reveal the cycle itse
CSE 3500 Algorithms and Complexity Yufeng Wu Spring 2011
Homework 7 - Due: 04/21/11 in class.
1
Shortest path
Do Exercise 24.1-1 (on p. 654). I did not explain the values, but they are just like the t
CSE 3500 Algorithms and Complexity Yufeng Wu Spring 2011
Homework 6 - Due: 04/14/11 in class.
1
Excercise 22.2-7
Do Exercise 22.2-7 on p. 602. You do not have to give a rigorous proof of the correctne
CSE 3500 Algorithms and Complexity Yufeng Wu Spring 2011
Homework 5 - Due: 03/24/11 in class.
1
Excercises for DP Algorithms on Sequences
1. Given A = cfw_1, 4, 2, 9, 7, 5, 8, 2, find the longest incr
CSE 3500 Algorithms and Complexity Yufeng Wu Spring 2011
Homework 3 - Due: 03/1/11 in class.
1
Probabilistic analysis
1. You toss a coin, which gives head with probability p and tail with probability
CSE 3500 Algorithms and Complexity Yufeng Wu Spring 2011
Homework 4 - Due: 03/17/11 in class.
1
Heap
Do parts (a), (b) and (c) of Problem 6.2 (p.167) in textbook. For part (a), tell me where the d chi
CSE 3500 Algorithms and Complexity Yufeng Wu Spring 2011
Homework 2 - Due: 02/17/11 in class.
1
Search in O(logn) time
Given a sorted array of distinct integers A[1, n], you want to find out whether t
CSE 3500 Algorithms and Complexity Yufeng Wu Spring 2011
Homework 1 - Due: 02/01/10 in class.
1. Matrix Multiplication
Given two n by n matrices A and B, write an algorithm to compute the product of A