4. In the class, you learn a bunch of tools. But, in the homework, I need you to be a little bit creative and use all you have learned to solve a seemingly random problem. Let us consider semi-circular paper of radius 2. The area of the whole paper is 2π ≈ 6.28. We want to cut a chord(red line) from this paper such that the area of the leftover paper(shown in blue) is 4.0. Where should I cut the chord (find the value of a where the red line should be such that the area of the blue region is 4.0? Try to get a decent answer. If you are good with geometry you can actually figure this one out analytically, but I want you to do it numerically using what we have learned so far. return sqrt(r**2 - ***2) ▷ 1 def circ_top(x, r=2.): 2 3 4 5 [3] def circ_bot(x, r=2.): return -sqrt(r**2 6 x=np.linspace(0,2,100) ***2) 7 y_top= [circ_top(xx) for xx in x] 8 y_bot = [circ_bot(xx) for xx in x] 9 ax= plt.figure(figsize=(4,4)) 10 plt.gca().set_aspect('equal') #get current axis and set aspect ratio 11 plt.plot(x, y_top, 'k-') 12 plt.plot(x, y_bot, 'k-') 13 plt.axvline (1.1, color='red') 14 plt.fill_between(x,y_top,y_bot, where=x>1.1, alpha=0.3) 2.0 15 10 0.5 0.0 -0.5 -1.0 -1.5 -2.0 1 00 05 10 15 20 Python Python

4. In the class, you learn a bunch of tools. But, in the homework, I need you to be a little bit creative and use all you have learned to solve a seemingly random problem. Let us consider semi-circular paper of radius 2. The area of the whole paper is 2π ≈ 6.28. We want to cut a chord(red line) from this paper such that the area of the leftover paper(shown in blue) is 4.0. Where should I cut the chord (find the value of a where the red line should be such that the area of the blue region is 4.0? Try to get a decent answer. If you are good with geometry you can actually figure this one out analytically, but I want you to do it numerically using what we have learned so far. return sqrt(r2 - 2) ▷ 1 def circ_top(x, r=2.): 2 3 4 5 [3] def circ_bot(x, r=2.): return -sqrt(r2 6 x=np.linspace(0,2,100) 2) 7 y_top= [circ_top(xx) for xx in x] 8 y_bot = [circ_bot(xx) for xx in x] 9 ax= plt.figure(figsize=(4,4)) 10 plt.gca().set_aspect('equal') #get current axis and set aspect ratio 11 plt.plot(x, y_top, 'k-') 12 plt.plot(x, y_bot, 'k-') 13 plt.axvline (1.1, color='red') 14 plt.fill_between(x,y_top,y_bot, where=x>1.1, alpha=0.3) 2.0 15 10 0.5 0.0 -0.5 -1.0 -1.5 -2.0 1 00 05 10 15 20 Python Python

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

Computer Science JAVA #7 - program that reads the file named randomPeople.txt sort all the names alphabetically by last name write all the unique names to a file named namesList.txt , there should be no repeats
Arrays can be created to store values of multiple data types at one place. True False in java
2- Write a C# program that read a string and split this string according to space char into an array of strings using Substring, IndexOf (or LastIndexOf) The book on the Ex : strl ="The book on the table, the pen" -→ result= table the реп
%matplotlib inlineimport numpy as npfrom matplotlib import pyplot as pltimport math xs = np.array([0. , 0.01010101, 0.02020202, 0.03030303, 0.04040404, 0.05050505, 0.06060606, 0.07070707, 0.08080808, 0.09090909, 0.1010101 , 0.11111111, 0.12121212, 0.13131313, 0.14141414, 0.15151515, 0.16161616, 0.17171717, 0.18181818, 0.19191919, 0.2020202 , 0.21212121, 0.22222222, 0.23232323, 0.24242424, 0.25252525, 0.26262626, 0.27272727, 0.28282828, 0.29292929, 0.3030303 , 0.31313131, 0.32323232, 0.33333333, 0.34343434, 0.35353535, 0.36363636, 0.37373737, 0.38383838, 0.39393939, 0.4040404 , 0.41414141, 0.42424242, 0.43434343, 0.44444444, 0.45454545, 0.46464646, 0.47474747, 0.48484848, 0.49494949, 0.50505051, 0.51515152, 0.52525253, 0.53535354, 0.54545455, 0.55555556, 0.56565657, 0.57575758, 0.58585859, 0.5959596 , 0.60606061, 0.61616162, 0.62626263, 0.63636364, 0.64646465, 0.65656566, 0.66666667,…
In java, the Arrays class contains a static binarySearch() method that returns …… if element is found. false true (-k–1) where k is the position before which the element should be inserted The index of the element
This is needed in Java Given that an ArrayList of Strings named nameList has already been created and names have already been inserted, write the statement necessary to delete the name at index 15.
Please add an gif image/plot an gif to this code. This is a brownian motion python code here it is code import numpy as np import matplotlib.pyplot as plt def brownian_motion(L, N): # initialize position in the center of the grid x = L // 2 y = L // 2 # initialize the grid grid = np.zeros((L, L), dtype=np.int32) # loop over the number of steps for i in range(N): # choose a random direction direction = np.random.choice(['up', 'down', 'left', 'right']) # move one step in that direction if direction == 'up': " y += 1" elif direction == 'down': "y -= 1" elif direction == 'left': "x -= 1" elif direction == 'right': "x += 1" # make sure the particle is still on the grid if x < 0 or x >= L or y < 0 or y >= L: "continue" # update the grid grid[y, x] = 1 return grid if __name__ == '__main__': # set the size of the grid L…
Consider two arrays of Different sizes are given and your task is to multiply corresponding elements and store it into the result array and print the result array. In java programming language
How to use for and foreach loops to display elements of an array in java.
In Java using recursion, create a program with a GUI that will allow a user to enter five numbers. The program will provide the product of all five numbers using recursive methods.
%matplotlib inlineimport mathimport numpy as npfrom matplotlib import pyplot as pltdef bad_poisson(lmd, k): return pow(lmd,k)*math.exp(-lmd)/math.factorial(k)# bad_poisson(1000,1000) # uncomment to see it breaks
Associative Arrays where the index is a value. O a None O b. string O cinteger O d. boolean