/*
* Name:
* Date:
* course:
* Instructor:
* Description:
*
* Bugs:
*/
package ladder;
Nevarez-Lira, Antero
May 19, 2014
CS 340
Sarto
Given a set of words, finds shortest path from
origin word to ending word.
none;
import java.io.BufferedReader;
import ja
/*
* Name:
Nevarez-Lira, Antero (nevarez)
* Date:
May 3, 2014
* Course:
CSCI 340
* Instructor:
Sarto
* Description:
Purpose is to analyze 2 solutions for finding the median value in
*
a large array and finding the fastest algorithmn.
* Bugs:
none.
*/
pack
Data Structures and Algorithm Design
CSCI 340
Spring 2001
Exam 1
Name:_
1. (10 points) Order the following complexity classes from relatively fastest on the left to relatively slowest on the right. If
two complexity classes are the same, right them above/
Data Structures and Algorithm Design
CSCI 340
Spring 2008
Exam 2
Name:_
1. (27 points total)
a. (12 points) Complete the table below
Sort
Best
Case
Average
Case
Worst
Case
Insertion Sort
Merge Sort
Quick Sort
Radix Sort
b. (5 points) Which of the sorts in
Data Structures and Algorithm Design
CSCI 340
Spring 2011
Exam 2 - Key
Name:_Key_
Note that the Math cheat sheet is attached to the back of the exam.
1. (5 points each part, 15 points total) Mergesort works by repeatedly splitting the array into
two (almo
Solutions to CSCI 340 Practice Final
1.
2.
3. We would use an additional 2D array, just as we did with optimal matrix multiplication. We then
write a recursive method to pull out the optimal solution to the subproblems.
4. a. Have a 2D array with at least
Data Structures and Algorithm Design
CSCI 340
Spring 2008
Exam 3
Name:_
There are 104 points possible on this exam, so there is a built in 4 points extra credit.
1. (5 points) When we talked about doubling the size of an ArrayList, we used amortized
compl