CSCI 323, Fall 2009
Instructor: Hoeteck Wee
Sample Midterm 2
5.056.15 pm, Nov 4
Read these instructions carefully
1. This is a
closed book
exam, apart from
one doublesided
cheat sheet. Calculators
are
permitted.
2. This exam consists of
four
questions, several of which have multiple parts.
3. Approximate point totals for each question part are indicated. The maximum total number of points
is
40
.
4. The questions vary in difficulty: if you get stuck on some part of a question, leave it and go on to the
next one.
Your Name:
Q
1
Q
2
Q
3
Q
4
Total
[continued overleaf]
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
1. True/False Questions.
For each of the following questions, circle True or False, and provide either a brief explanation or a counter
example. For each part, you will get
0
point for an incorrect answer,
0
.
5
point for not circling anything, and
1
point for having the correct answer without an explanation.
(a)
T
RUE
or F
ALSE
:
Let
G
be a weighted, directed graph with no negative cycles such that all the edge weights are distinct.
Then, for any pair of vertices
s, t
in
G
, there exists a unique shortest path from
s
to
t
.
This is the end of the preview.
Sign up
to
access the rest of the document.
 Fall '09
 Wee
 Algorithms, Dynamic Programming, Graph Theory, Shortest path problem, following table, shortest path

Click to edit the document details