CSE 331 Section 1 Spring 2008
Final Exam Analysis
3 May 2008 DRAFT IN PROGRESS
Final Exam Grades
2 high grades of 95; average of 71.
This average was affected by a few students who
had stopped working on the course. And, for a few students, this was their highest exam
grade, including one of the 95 grades.
Final exam grade distribution
< 50
5059
6069
7079
8089
9099
4
4
12
12
10
3
total
45
Order analysis: average for possible 24 points was about 16. One person got all 24!
1) O(n)
a tree with N nodes has N1 edges (common mistake was 2^N)
2) O(n)
3) O(log n)
with 2 units of effort, the problem is reduced to half its size; thus the runtime
is O(log n) x 2
4) O(E + V) = O(n^2)
for a dense graph
5) O(1) since it’s known to be a heap already
(1 pt for O(n))
6) O(n^2)
fill in the nxn matrix with constant time ops for each element
7) O(n^2)
worse case of insertion sort
(1 pt for O(n), assuming student thought about
just reversing the array, although no one wrote that.)
8) O(2^n)
recall the Catalan numbers
9) O(n)
10) NP
recall CNFsat
as in problem 26, problemsolvers need to recognize these
11) NP
knapsack problem
12) O(n log n)
tree sort
Short answer: average for 18 points possible was about 15 pts. Several earned 18 points
13)
(0.001)^2
some students thought that 0.
.999 is a range of 999 numbers
14)
10 take 2 x (0.001)^2 x (0.999)^8
there are 45 ways that 2 of the 10 can hash to
chain #1.
15)
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
This is the end of the preview.
Sign up
to
access the rest of the document.
 Spring '08
 M.McCullen
 Algorithms, Data Structures, Travelling salesman problem, Seek time, ht, NPcomplete, Prim

Click to edit the document details