Question 4 Suppose we are given an array A[0...n – 1] of size n, where each array entry has a value that is chosen uniformly at random in {1,...,95}. Consider an algorithm that takes as input a value r € {1,..., 95}, and searches for a in the array by querying array entries A[i] for ie {0,...,n- 1} in increasing order of i. Whenever the algorithm queries an array entry A[i] that has value r, it immediately outputs the index i. (a) What is the expected number of indices that the algorithm outputs? (b) For any k E {0,..., n – 1}, what is the probability that the smallest index the algorithm outputs is k? (c) How does the answer to (b) change, if we know that at least one array entry has value æ? Explain and show all your calculations.

Question 4 Suppose we are given an array A[0...n – 1] of size n, where each array entry has a value that is chosen uniformly at random in {1,...,95}. Consider an algorithm that takes as input a value r € {1,..., 95}, and searches for a in the array by querying array entries A[i] for ie {0,...,n- 1} in increasing order of i. Whenever the algorithm queries an array entry A[i] that has value r, it immediately outputs the index i. (a) What is the expected number of indices that the algorithm outputs? (b) For any k E {0,..., n – 1}, what is the probability that the smallest index the algorithm outputs is k? (c) How does the answer to (b) change, if we know that at least one array entry has value æ? Explain and show all your calculations.

Advanced Engineering Mathematics

10th Edition

ISBN:9780470458365

Author:Erwin Kreyszig

Publisher:Erwin Kreyszig

Chapter2: Second-order Linear Odes

Section: Chapter Questions

Problem 1RQ

See similar textbooks

Similar questions

LetF(n) be the number of set partitions of [n] with no singleton blocks.
For the list [44, 18, 74, 61, 42, 31], how will the array elements look like after second pass (after i-2 but before i=3) of the Insertion sort algorithm? def insertionSort(a): for i in range(1,len(a)): currentvalue = a[i] position = i while position>0 and a[position-1]>currentvalue: a[position]=a[position-1] position = position-1 a[position]=currentvalue return a [18, 44, 74, 61, 42, 31] [18, 44, 61, 74, 42, 31] [18, 42, 44, 61, 74, 31] [18, 31, 42, 44, 61, 74]
Give the exact number of additions performed in the following segment of certain algorithm assuming a₁, a₂,..., am are positive real numbers and n = 11 for i=1 to n for j=1 to n Sij = aj + aj + 2;
1. a. Find ged(31415, 14142) by applying Euclid's algorithm. b. Estimate how many times faster it will be to find ged(31415, 14142) by Euclid's algorithm compared with the algorithm based on checking con- secutive integers from min{m, n} down to gcd(m, n).
Let a € Zo. Prove that 5a + 2 and 13a +5 are comprime, That is, (5a + 2, 13+5) = 1. (Hint: Use the Euclidean algorithm)
13. 14 Which of the following are true statements given that a, b and d are whole numbers and d# 0? (a) If dla and dib, then dia - b. (b) If dla and djb, then dlab, (d) All are true. (c) If alb and bla, then a = b. (e) None are true In the addition algorithm wo
i need d,e Part solution
Discrete math:
Please answer part 2 using the recurrence in the hint
truo or false
(a) For integers a, b, q, r, prove that if a = bq + r then (a, b) = (b, r). (b) Determine (1000, 2025) by using the Euclidean algorithm. Then express the answer as a linear combination of 1000 and 2025. Show all your working. (c) Suppose that G = (a), a ‡e, and a5 : = e. Construct a Cayley table for the group (G,.). (d) Determine the right cosets of ((1 2), [1]) € S3 × Zi₂. (e) Find the subgroups of Z24.
A. Find (a, b) and find x and y if ax + by = (a, b) 1. a = 35, 733, 2. a = 7,969, 3. a = 11, 178, B. Prove Lemma 1. Activity 7 (Euclidean Algorithm) b=2, 623 b = 1235 b = 234 LEMMA 1. Let a, b E 3. If a = bq + r, then (a, b) = (b, r).