AMTH 377/COEN 279 S11 TRAN
Homework 6 (due 6/1)
1. (10 pts.) Consider the following problem P1:
input: an undirected graph G = (V , E) and a set of vertices L V .
output: yes if and only if there is a spanning tree T such that L leaves(T ).
Either give a

AMTH 377/COEN 279 TRAN
Name:
MIDTERM EXAM SOLUTIONS
AMTH 377/COEN 279
DESIGN AND ANALYSIS OF ALGORITHMS
WINTER 2011
1. (10 points) True or false:
Let f (n) and g(n) be running-time functions. If f o(g), then f 2 o(g 2 ).
If the above statement is always t

Homework #3
Ilyong Cho
March 31, 2010
8.1-4
You are given a sequence of n elements to sort. The input sequence consists of n/k
subsequences, each containing k elements. The elements in a given subsequence are all
samller than the elements in the succeedin

, , , and Exponents
1. If () = (), then lg() = (lg(). Is this true? The answer is: Yes.
Pf. For simplicity and easier reading, I will only prove the main part of inequality. The nonnegativity part is easy to be satisfied. You can modify the proof yourself

Sample Midterm
Design and Analysis of Algorithms
COEN 279/AMTH 377
Instructor: Dr. Kan Liu
Name: (First)_(Last)_ ID:_
Show your work when needed. Use extra sheets as necessary.
1.
a)
b)
c)
d)
For Insertion Sort,
write pseudo code for its algorithm;
What l