In python Note that testing this function is a little tricky because itrelies on randomness. You will not see the same outputevery time! We can control for this a bit by running thefunction many times, to ensure that on average, theprobabilities roughly match the outcome. For example, ifwe runweighted_choice({'green': 1, 'eggs': 3,'ham': 2})600 times, then we would expect to get 'green' about 100times, 'eggs' about 300 times, and 'ham' about 200 times.>>> results =1, 'eggs': 3, 'ham':2}) for i inrange (600)]>>> results.count('green')99>>> results.count('eggs')296>>> results.count('ham')205[weighted_choice({ 'green':If your results are consistently off by more than 20 or so,you should probably check your algorithm. As part of problem C, we're going to randomly selectwords to create sentences. However, we don't want it tobe uniformly random. We will want to influence therandom selection by having some words be more likely toappear than others. This is called weighted randomselection. In this problem, we will build towards that goalby creating a function that does a weighted randomselection from the keys of a dictionary, using the valuesas the weights.Create a function weighted_choice that takes as aparameter a dictionary of words and their correspondingcounts. The function should randomly choose one of thewords, using the counts as weights in the selection. Forexample, if I pass the dictionary{'green': 1, 'eggs': 1}To this function, it should return “green” half the time and"eggs" half the time. If I pass the dictionary{'green': 1, 'eggs': 3, 'ham': 2}It should return "green" one-sixth of the time, "eggs" half(3/6) of the time, and "ham" one-third (2/6) of the time.There are a number of ways to accomplish this task.Many solutions require you to iterate over the givendictionary to add up the counts to get the total of thecounts before using a function from the random moduleto get a random number in the range from 1 to the total.Then, you can use that number to figure out which wordit corresponds to and return the appropriate word.There's also a simple method that utilizes making a listwith x copies of each key (where x is the value for saidkey), and then using random.choice.Examples (random, so won't necessarily match, butmake sure that both come up about 50% of the time):>>> weighted_choice({'green': 1, 'eggs':1})'green'>>> weighted_choice({'green': 1,1})eggs':'eggs'>>> weighted_choice({'green': 1, 'eggs':1})'eggs'

1) Below is program that creates weighted_choice that takes as a parameter dictionary of words and…

Note that testing this function is a little tricky because it relies on randomness. You will not see the same output every time! We can control for this a bit by running the function many times, to ensure that on average, the probabilities roughly match the outcome. For example, if we run weighted_choice({'green': 1, 'eggs': 3, 'ham': 2}) 600 times, then we would expect to get 'green' about 100 times, 'eggs' about 300 times, and 'ham' about 200 times. >>> results = 1, 'eggs': 3, 'ham':2}) for i in range (600)] >>> results.count('green') 99 >>> results.count('eggs') 296 [weighted_choice({ 'green': >>> results.count('ham') 205 If your results are consistently off by more than 20 or so, you should probably check your algorithm.

Note that testing this function is a little tricky because it relies on randomness. You will not see the same output every time! We can control for this a bit by running the function many times, to ensure that on average, the probabilities roughly match the outcome. For example, if we run weighted_choice({'green': 1, 'eggs': 3, 'ham': 2}) 600 times, then we would expect to get 'green' about 100 times, 'eggs' about 300 times, and 'ham' about 200 times. >>> results = 1, 'eggs': 3, 'ham':2}) for i in range (600)] >>> results.count('green') 99 >>> results.count('eggs') 296 [weighted_choice({ 'green': >>> results.count('ham') 205 If your results are consistently off by more than 20 or so, you should probably check your algorithm.

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

In python
There is a string of characters G = g1,g2,g3,...sn with no non-alphabetic characters (i.e no punctuation or spaces). You are also given a function dict(b,i,j), with an input of string b and two indices (i&j). This function will return true if bi...j is a word in the dictionary, and false if not. Please provide a simple dynamic programming solution that can determine if the string F is a sequence of valid dictionary words. State the size of the table, how the table is filled, which elements are filled in first, and where the solution is found. Please find the running time of the algorithm (assume that all calls to the function are O(1)).
There is an array with n integers, but the values are hidden to us. Our goal is to partition the elements in the same group should have the same value, 4. elements into groups based on their values while elements in different groups have different values. The values are hidden to us so you cannot directly call for a value, like Arr[i]. However, we can probe the array by calling the function query(). The function takes a subset of elements as inputs and returns the number of unique integers in this subset. Design an algorithm to partition these n elements in O(nlog n) queries. (query() is called O(nlog n) times)
Write a function that takes a vector of integers, an integer n representing the number of elements in that vector, and an integer b. Implement the sequential search algorithm to look for the integer b in the vector. The sequential search works as follows: you must look at all the elements of the vector until you find the b, from the first to the last. The function must return an integer representing how many elements the function tested until it found b. If it does not find the function, it must return 0. The name of the function must be called "busca_seq". Program in C.
That's enough for you! def first_preceded_by_smaller(items, k=1): Given a list of items, find and return the value of the first element for which at least k smaller elements precede that element in items. If no such element exists inside the list, this function should return None. The required k smaller items do not need to be consecutive immediate predecessors of the current item, but can be any k items positioned before the current element. items k Expected result [4, 4, 5, 6] 2 5 [42, 99, 16, 55, 7, 32, 17, 18, 73] 3 18 [42, 99, 16, 55, 7, 32, 17, 18, 73] 8 None ['bob', 'carol', 'tina', 'alex', 'jack', 'emmy', 'tammy', 'sam', 'ted'] 4 'tammy' [9, 8, 7, 6, 5, 4, 3, 2, 1, 10] 1 10 [42, 99, 17, 3, 12] 2 None
You are a movie theater manager. You are given a two-dimensional array with 6 rows and 6 columns - 36 elements with O value, that represent empty theater seats. All 36 tickets for session were sold, so you need to identify all of the seats with value 1. Write a program that replaces all O values in the given array, by 1 and outputs the resulting matrix. Use nested for-loops to iterate over two-dimensional matrix.
Suppose Arr is a very large array of integer elements. The size of Arr is unknown. The first k elements are positive integers, greater than 0 and less than 1000, in increasing sorted order. The rest of the elements are greater than 1000.Write a function that determines whether a given positive integer, key, of value less than 1000 is an element in Arr or not. If the key is present in Arr, it returns its index otherwise it returns -1. The Time Complexity of the function shall be O(log(n)).(Note: It is to be remembered that both the size of Arr and k are unknown.)Array index is starting from 1 not 0 [pseudo code needed]Example:Arr: 4 5 7 12 15 24 67 221 233 430 500 1100 1200 1150 1050 1200 …key: 15returned value: 5Arr: 5 9 9 12 19 29 67 67 120 220 330 400 700 1001 1100 1150 1050 11250 1200 …key: 900returned value: -1
We will need to sort this. The following function is called a Bubble Sort (see attached image). Explain what the code in R is doing below (in words). Please be detailed in your response.
create an array of 30 random numbers that range between 1and 100. And yet again, write a function that will receive a number from the userand determine if that number exists in the array or not. But this time, start bySORTING your input list. After a sort, the list in problem 1 is as follows:[2, 2, 3, 5, 12, 14, 14, 15, 23, 36, 39, 41, 44, 44, 45, 48,49, 50, 52, 52, 59, 71, 81, 82, 88, 89, 89, 93, 96, 97] Approach: Implement a method called findC(x, A, i, j), where x is the number we arelooking for in array A, the first index of the array is i and the last index is j. We wantto determine whether x exists in A anywhere between index i and index j. Your firstcall to this method will therefore look like this: findC(x, A, 0, A.length-1). In the body of your function, compare x with the item that is in the middle of thearray, as you did before. As before, call the middle of index of the array mid. But thistime, if x<=a[mid], recursively call your function to search ONLY the first half of…
3. Write a program to create a two dimensional matrix [n x m). n and m will be given by the user. Take the values of the matrix elements from user. Write a program that can find out the biggest number from all the even columns of that matrix. Print that biggest number.
The question is in bold the other parts juts helps explain concepts . Write a function insertionsort(somelist) that applies the insertion sort algorithm. (You should use the pop and insert commands) Insertion sort works as follows remove the first element from the original list (mylist) and add it to a new list sortedlist. Then repeat, at each stage removing the first element (call it x) from mylist and adding it to sortedlist. The challenge is that it needs to be added at the correct position, which means scanning through sortedlist for the first element bigger than x and inserting x just before that point, or if there is no such element then inserting x at the end. We recollect two useful list commands you should use in this code: • x = mylist.pop(0) which lets x be the entry at index 0 of mylist while also removing that entry from mylist. (Generally x = mylist.pop(j) works in the obvious way.) • sortedlist.insert(i,x) which changes sortedlist by inserting x into it at index i (with…
Write a program that inputs a matrix and displays the trans- pose of that matrix. A transpose of a matrix is obtained by converting all the rows of a given matrix into columns and vice versa.