Design and Analysis of Algorithms
CS6820 Fall 2015
Homework 1
Due Monday September 14, 2015
1. Let d N be a fixed constant. Let G = (V, E) be a connected undirected graph with
edge weights w : E N such that all simple cycles of G are of length at most d.
Design and Analysis of Algorithms
CS6820 Fall 2015
Homework 3 Hint
Due Wednesday, October 7, 2015
2. Have your adversary keep a partial adjacency matrix A : V 2 cfw_0, 1, , where means
undefined. At any stage of the construction, let I be the set of verti
Design and Analysis of Algorithms
CS6820 Fall 2015
Homework 2
Due Friday, September 25, 2015
1. A basket is an undirected graph G of the following form: There are two special vertices
called the sides and two special vertices that make up the handle. The
Design and Analysis of Algorithms
CS6820 Fall 2015
Homework 5
Due Wednesday, November 11, 2015
1. Consider the following crossword puzzle design problem (CPDP). You are given a directed
graph G, a designated finite set P of paths in G, a finite alphabet ,
Design and Analysis of Algorithms
CS6820 Fall 2015
Homework 6
Due Friday, December 4, 2015
1. Given a set of elements U = cfw_1, . . . , n with nonnegative weights w1 , . . . , wn , a collection
of subsets S1 , . . . , Sm U , and an integer k, we wish to
Design and Analysis of Algorithms
CS6820 Fall 2015
Homework 4
Due Wednesday, October 21, 2015
1. Consider the following fallacious argument. Let S = cfw_1, 2, . . . , n, n odd. Assign the
elements of S random priorities chosen independently with uniform p
Design and Analysis of Algorithms
CS6820 Fall 2015
Homework 3
Due Wednesday, October 7, 2015
1. Show how to decide in time O(n (n) whether two given deterministic finite automata are
equivalent. If you have forgotten the definition of a deterministic fini