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

Write a program that does the following: 1- Ask the user to enter the number of variables on a Linear- System 2- Ask the user to enter matrix elements 3- Ask the user enter vector elements 4- Ask the user to enter initial approximation for the solution 5- Solve the linear-system using Jacobi iteration and show the results and number of iterations needed 6- Solve the linear-system using Gauss-Seidel iteration and show the results and number of iterations needed 7- Show which of the two methods is better
In python code Fast answer please .
PLEASE USE PYTHON
Write a program to find the solution to Maxone problem (You want to maximize the number of ones) using agenetic algorithm where the population size is 2000 and each chromosome is 20 genes long. Use a mutationprobability of 0.02 and a cross-over probability of 0.5. Make separate functions for different components of thegenetic algorithm.
Please answer completely will give rating surely Both questions answers needed
Find the error in the following argument: Theorem. All computer programs contain the same number of bugs. Proof. If we show that any set of n programs contains the same number of bugs, then we have proved the theorem. We argue by induction on n. If n=1 then in any set of 1 program, all the programs contain the same number of bugs, so the statement is true, in this case. Now suppose that for every set of programs containing less then n programs, all the programs have the same number of bugs. Let DD be a set of n programs p1,p2,…,pn. Now the set D1={p2,…,pn} contains n−1 programs and hence they all contain the same number of bugs, by the induction hypothesis. Similarly the set D2={p1,…,pn−1} contains n−1 programs and hence they all contain the same number of bugs. In particular p1 and pn contains the same number of bugs as the other programs in the set. Hence all the programs contain the same number of bugs.
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)
Prove that code is correct.
Please use best fit on python and show codes
Your goal is to guess a secret integer between 1 and N. You repeatedly guess integers between 1 and N. After each guess you learn if your guess equals thesecret integer (and the game stops). Otherwise, you learn if the guess is hotter (closer to)or colder (farther from) the secret number than your previous guess. Design an algorithm that finds the secret number in at most ~2 lg N guesses. Then design an algorithmthat finds the secret number in at most ~ 1 lg N guesses.