{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

# cs1501-fall-08-test-3-answers - Problem 6 Parsing 3-7 10...

This preview shows pages 1–2. Sign up to view the full content.

====================================================================== CS1501 Test 3 ====================================================================== Problem 1, Optimal BST 1-7, 10 points D / \ B E / \ A C ====================================================================== Problem 2, Digital Search Tree 1-8, 10 points A / \ B R / S ====================================================================== Problem 3, Radix Search Trie 1-9, 10 points * / \ * * / / * * / / * * / \ \ A B * / \ R S ====================================================================== Problem 4, Key Comparisons, 10 points A) b or n*b B) 1 or 2 or n+1 or n+2 ====================================================================== Problem 5, Rabin-Karp, 10 points A) O(MN) or O(N^2) B) O(N) or O(N+M) ======================================================================

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.

Unformatted text preview: Problem 6, Parsing 3-7, 10 points A. 2 B. 32 ====================================================================== Problem 7, Ford-Fulkerson 2-8, 10 points A. source-a-d-sink B. source-b-c-e-a-d-sink ====================================================================== Problem 8, Nearest-Neighbor, 15 points Accept any (reasonable) example for full credit. ====================================================================== Problem 9, Prim's Lemma, 15 points Accept any (reasonable) proof for full credit. Give full credit to informal proofs if they have the main ideas and are clear. ======================================================================...
View Full Document

{[ snackBarMessage ]}

### Page1 / 2

cs1501-fall-08-test-3-answers - Problem 6 Parsing 3-7 10...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online