This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: CS 473G Final Exam Questions (December 13, 2005) Fall 2005 You have 90 minutes to answer four of these questions. Write your answers in the separate answer booklet. You may take the question sheet with you when you leave. Chernoff Bounds: If X is the sum of independent indicator variables and μ = E[ X ], then the following inequalities hold for any δ > 0: Pr[ X < (1 δ ) μ ] < e δ (1 δ ) 1 δ μ Pr[ X > (1 + δ ) μ ] < e δ (1 + δ ) 1+ δ μ 1. Describe and analyze an algorithm that randomly shuffles an array X [1 .. n ], so that each of the n ! possible permutations is equally likely, in O ( n ) time. (Assume that the subroutine Random ( m ) returns an integer chosen uniformly at random from the set { 1 , 2 , , . . . , m } in O (1) time.) 2. Let G be an undirected graph with weighted edges. A heavy Hamiltonian cycle is a cycle C that passes through each vertex of G exactly once, such that the total weight of the edges in C is at least half of the total weight of all edges in...
View
Full Document
 Fall '08
 Chekuri,C
 Graph Theory, Glossary of graph theory, Graph theory objects, G. Describe, heavy Hamiltonian cycle

Click to edit the document details