In each of the problems below compute the average case time complexity (or expected time) of the given code. State your answer using asymptotic notation. Show your work for this problem by stating what the different cases are, the probability of each case, and how long each case takes. Also show the calculation of the expected time. a) def foo (n): #randomly choose a number between 0 and n-1 in constant time k np.random.randint (n) if k np. sqrt (n): for i in range(n): print (i) print('Never mind...') else: b) def bogosearch (numbers, target): """search by randomly guessing. numbers is an array of n numbers""" n len (numbers) while True: #randomly choose a number between 0 and n-1 in constant time guess = np.random.randint (n) if numbers [guess] == target: return guess In this part, you may assume that the numbers are distinct and that the target is in the array. Hint: if 0 < b < 1, then Σ1p.bp-1 = (1-b)².

In each of the problems below compute the average case time complexity (or expected time) of the given code. State your answer using asymptotic notation. Show your work for this problem by stating what the different cases are, the probability of each case, and how long each case takes. Also show the calculation of the expected time. a) def foo (n): #randomly choose a number between 0 and n-1 in constant time k np.random.randint (n) if k np. sqrt (n): for i in range(n): print (i) print('Never mind...') else: b) def bogosearch (numbers, target): """search by randomly guessing. numbers is an array of n numbers""" n len (numbers) while True: #randomly choose a number between 0 and n-1 in constant time guess = np.random.randint (n) if numbers [guess] == target: return guess In this part, you may assume that the numbers are distinct and that the target is in the array. Hint: if 0 < b < 1, then Σ1p.bp-1 = (1-b)².

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

7. Prove or disprove: f(n) + g(n) = 0 (min(f(n), g(n)))
You solve a non-singular system of 10,000 linear equations with 10,000 unknowns using the Gauss-Jordan algorithm without pivoting with single precision numbers and arithmetics on a computer that natively can do single precision operations very fast, but can operate in double and half precision as well. Your solution has a residual infinity-norm that is unacceptably large. In which order should you apply the following strategies to lower the residual norm? If a strategy is not / no longer helpful, do not list it as an option. a) use half precision numbers and arithmetics instead of single precision; b) use double precision numbers and arithmetics instead of single precision; c) use partial pivoting; d) use pivoting when encountering a zero in the pivot position.
Minimize the function f (x) = x² using hill climbing and gradient descent. Stop when the difference between two subsequent solutions is 0. Plot the visuals in python. Obtain the number of steps Ito converge Maximize the function f (x) = x² using hill climbing and gradient descent. - What is different in the maximization problem • Visualize the function and the solution steps in the function for both hill climbing and gradient descent. How is this different from the earlier problem.
DO NOT COPY FROM OTHER WEBSITES Upvote guarenteed for a correct and detailed answer. Thank you!!!
do it
Please your last Answer was wrong please help me and give me correct answer and write answers in blanks so that i understand easily don't take answer of any other expert plz because his/her answer was wrong please help me and give correct answer please
Please show work to the answer.
What do I do for (K + 1)? Please explain as best as possible
Consider the following version of Horner's method which computes a polynomial with coefficients a1, a2, ..., an and variable k. Example: acc = 1 for i = 1 to n acc *= k acc += a[ i ] return acc Determine precisely what polynomial is being computed and answer the following questions about it. What is the coefficient of the highest-degree term? A.A[0] B. 0 C. A[1] D. 1
SHOW YOUR SOLUTION Find the exact running time T(n) then explain of how you solve or get the answer. (SEE ATTACHED PHOTO)
Below is pseudocode representing the Compute-Opt algorithm: Compute-Opt(j): If j = 0 then Return 0 Else Return max(vj+Compute-Opt(p(j)), Compute-Opt(j − 1)) Endif Memoization of this algorithm does what to its running time? Group of answer choices It reduces the running time from exponential to linear. It reduces the running time from O(n2) to O(n). It reduces the running time from exponential to O(n log n). It doesn't significantly reduce the running time, but it enables the algorithm to utilize less space.
Conserving water saves energy. In many regions water gets collected between the valleys which is used for various purposes by the villagers. Help villagers to estimate how much water can be possibly collected. Given N non-negative integers representing an elevation of valleys where the width of each valley is 1, compute total units of water it can hold after raining. 3 2 • Height = [0,1,0,2,1,0,1,3,2,1,2,1] • Output: 6 • Explanation: The above elevation map (black section) is represented by array [0,1,0,2,1,0,1,3,2,1,2,1]. In this case, 6 units of rain water (blue section) are being trapped. Input Format First line of input contains N, the number of valleys. Second line of input contains N integers denoting heights of the valley. Constraints • n == = height.length • 1 <= n <= 2 * 104 • 0 <= height[i] <= 105 Output Format Print a single line containing one positive integer, denoting the maximum amount of water that can be stored. Sample Input 0 12 0 1 0 2 1 0 1 3 2 1 2 1