CMSC 132 Homework #2, Due Date Wed Jun 18 in Lecture (not Lab)
Complete each of the problems below and hand in your answers on Wed Jun 18 in lecture.
You must consider this homework a closed assignment as described in
http://www.cs.umd.edu/class/summer2008/cmsc132/openClosedPolicy.shtml
There is no late deadline for this homework.
1. List the following big-O expressions in order of asymptotic complexity (with the lowest
complexity first).
O(nlog(n)) O(n!) O(log(n)) O(2n) O(n2)
2. For each of the following code snippets, identify the critical section(s), compute the time
(T(n)) each one takes, and specify the asymptotic complexity using Big-O. Circle the
area(s) you consider critical section(s).
----------------- Example -----------------------------
for(int k=0; k < n; k += 3) {
for (int p=n; p > 6; p--) {
System.out.println(p % 2); // critical section
}
}
T(n) = (n/3) * (n-6) = n2/3 – 2n
Big-O = O ( n2)
a. ---------------------------------------------------------
for(int k=0; k <=n/8; k++) {
System.out.println(k);
}
System.out.println("Next");
for (int p=n; p>= 1; p--) {
System.out.println(p % 2);
}
T(n) =
Big-O = O ( )
b. ---------------------------------------------------------
for(int k=0; k < n-1; k++) {
for (int m=k+1; m < n; m++) {
System.out.println(k*m);
}
}
T(n) =
Big-O = O ( )
c. ---------------------------------------------------------
