This preview shows pages 1–3. Sign up to view the full content.
EEL 4851 Final
Summer 2000
NAME_____________________________
SS#_____________________________
Note: For all questions, an explanation of your answer allows me to give partial credit if the answer is
wrong.
1.
Short questions (24%, 3% each)
.
For each question you
must
explain your answer. Write neatly. I can not give you credit if I can not
read your answer.
a. What does the bigO measure.
b. Why do we insist that a heap be a full tree.
c. When balancing an AVL tree why can we always balance it with at most two rotations as opposed to
three or four?
k. In the network flow problem why does the algorithm insert an edge going in the opposite direction
to the edge removed in the residual graph.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Documentl. Is it worth investing time to try to find a sorting algorithm that runs faster than
)
log
(
n
n
O
?
m. If the algorithm to a particular problem takes
)
(
2
n
O
can I use the divide and conquer approach to
reduce the time to
)
log
(
n
n
O
like we did for the sorting algorithm? Explain.
n. What does the Halting problem prove?
This is the end of the preview. Sign up
to
access the rest of the document.
 Summer '09

Click to edit the document details