« Project #Syllabus for all sect | Main | Project #Syllabus for all sect »

March 27, 2006

Homework Syllabus for all sect

1. Give two ways in which a probabilistic algorithm differs from a deterministic algorithm.

2. State the definitions of the following:
a. A Monte Carlo algorithm
b. A Numerical probabilistic algorithm
c. A Las Vegas algorithm

3. A uniform(0,1) pseudo random number generator generates a real number (within machine precision) in the interval [0,1] drawn from the uniform distribution. Such a generator is commonly made available in the standard libraries of most programming languages. If you instead need to generate a random integer between i and j, how would you employ your random(0,1) generator to meet your need?

Posted by ringger at March 27, 2006 09:48 AM

Comments

Post a comment

Thanks for signing in, . Now you can comment. (sign out)

(If you haven't left a comment here before, you may need to be approved by the site owner before your comment will appear. Until then, it won't appear on the entry. Thanks for waiting.)


Remember me?