CSSE 221: Fundamentals of Software Development Honors
Key
Programming assignment (due by Saturday Oct 20, 11:59 pm)
You should have checked in the version of your Simulation project corresponding to
where you are on your schedule.
Written homework due before beginning of class on Thursday, Oct 18).
1. Complete all the reading.
2. (12 pts) Weiss 6.4
SOLUTION:
TreeSet, PriorityQueue
3. (8 pts) Weiss 6.6
SOLUTION:
Run time = O(1)
4. (10 pts) Weiss 6.12 (a,b only); assume that the elements are sorted in increasing
order.
a. SOLUTION:
findMin โ returns a reference to the first item in the array
deleteMin โ returns a reference to the first item in the array, shift
all items forward
insert โ iterate to the location in the array where the element
belongs, shift all other elements toward the back and then store the
value into the array
b. SOLUTION:
findMin โ O(1)
deleteMin โ O(N)
insert โ O(N)
5. (10 pts) Weiss 6.13 (a,b only)
a. SOLUTION:
findMin โ loops through the entire list, storing a reference to the
smallest value until it reaches the end, then returns a reference to
the smallest
deleteMin โ loops through to find the min, then removes the
element and shifts all forward, then returns the reference to the
minimum
insert โ add to the end of the array
b. SOLUTION:
findMin โ O(N)
deleteMin โ O(N)
insert โ O(1)
