This preview shows pages 1–3. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: 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] 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 point for an incorrect answer, . 5 point for not circling anything, and 1 point for having the correct answer without an explanation. (a) TRUE or FALSE: 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 ....
View
Full
Document
This note was uploaded on 10/30/2009 for the course CSCI 323 taught by Professor Wee during the Fall '09 term at CUNY Queens.
 Fall '09
 Wee
 Algorithms

Click to edit the document details