Use the Monte Carlo method to estimate the following. 1 1. lo' exp(exp(x)) dx 2. E(N) where N is defined as follows. Let {U¡} be i.i.d. Unif(0,1). Define N=min{n: U1t..+Un >1} Calculate N 100 times and then compute the mean. (Also draw the histogram of results) Do it again, but not 1000 times. And do it again 10000 times. Comment on your findings. Upload you work (done neatly) here.

Use the Monte Carlo method to estimate the following. 1 1. lo' exp(exp(x)) dx 2. E(N) where N is defined as follows. Let {U¡} be i.i.d. Unif(0,1). Define N=min{n: U1t..+Un >1} Calculate N 100 times and then compute the mean. (Also draw the histogram of results) Do it again, but not 1000 times. And do it again 10000 times. Comment on your findings. Upload you work (done neatly) here.

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Solve the following recurrence equations by expanding the formulas (also called the 'iteration method' on slides). Specifically, you should get T(n) = O(f(n)) for a function f(n). You may assume that T(n) = O(1) for n = O(1). You should not use the Master Theorem. (a) T(n) = 2T (n/3) + 1. (b) T(n) = 7T(n/7) + n. (c) T(n) = T(n − 1) + 2.
Given f(x)=x2+6x and g(x)=1−x2, find f+g, f−g, fg, and fg. Enclose numerators and denominators in parentheses. For example, (a−b)/(1+n).
- Q1: Prove that: + ((X.Y). (X.Z)) = X + Y.Z?
Suppose, T(n) = 12+22+32+…..+n2. Show that, T(n) is in Θ(n3 ).
suppose a computer solves a 100x100 matrix using Gauss elimination with partial pivoting in 1 second, how long will it take to solve a 300x300 matrix using Gauss elimination with partial pivoting on the same computer? and if you have a limit of 100 seconds to solve a matrix of size (N x N) using Gauss elimination with partial pivoting, what is the largest N can you do? show all the steps of the solution
Given F (x, y, z) = y' + xyz': a. Express F as a Sum of Minterms b. Express F as a Product of Maxterms c. Express F' as a Sum of Minterms d. Express F' as a Product of Maxterms
Solve the following recurrence using the iteration technique. () T(1) = 1 T(n) = 4T + n
Given A={1,2,3,4,5,6}, B={4,5,6,7,8,9}. Compute (c)A−B=
7. For n 2 1, in how many out of the n! permutations T = (T(1), 7(2),..., 7 (n)) of the numbers {1, 2, ..., n} the value of 7(i) is either i – 1, or i, or i +1 for all 1 < i < n? Example: The permutation (21354) follows the rules while the permutation (21534) does not because 7(3) = 5. Hint: Find the answer for small n by checking all the permutations and then find the recursive formula depending on the possible values for 1(n).
Analyze the running time (i.e. T(n)) of these functions. You should be able to find some simple function f(n) such that T(n) O(f(n)). You should show your work and rigorously justify your an- 1. swer.
If A = {0, 1), B = {1, 2, 3), then (AUB) x B is equal to:
6. Prove: For all integers n, if n² is odd, then n is odd. Use a proof by contraposition, as in Lemma 1.1.