A Circle and Two Squares Imagine a circle and two squares: a smaller and a bigger one. For the smaller one, the circle is a circumcircle and for the bigger one an incircle. Create a function, that takes an integer (radius of the circle) and returns the difference of the areas of the two squares. Examples square areas difference (5) 50

A Circle and Two Squares Imagine a circle and two squares: a smaller and a bigger one. For the smaller one, the circle is a circumcircle and for the bigger one an incircle. Create a function, that takes an integer (radius of the circle) and returns the difference of the areas of the two squares. Examples square areas difference (5) 50

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

A Circle and Two Squares Imagine a circle and two squares: a smaller and a bigger one. For the smaller one, the circle is a circumcircle and for the bigger one, an incircle. Create a function, that takes an integer (radius of the circle) and returns the difference of the areas of the two squares. Examples square_areas_difference (5) → 50
function [P, A] = rect(L, W) P= 2 (L+ W); A =L*W; end Above function is defined to find perimeter and area of a rectangle. If a rectangle has length 10 mm and width 7 mm then the correct way to get perimeter and area of a given rectangle by executing this function is Select one: a. [A, B] = rect(10, 7) b. rect(7, 10) c. [A, B] = rect(7, 10) d. rect(10, 7)
Create a function using Java: Number of Rows = 3-6 Number of Columns = 3-6 Function Name: ColumnWinParameters: board: 2D integer array, column: integer, piece: integerReturn: booleanAssume board is valid 2D int array, column is valid index in the board, piece is X==1/O==2Look at indicated column at given index in board. If that column has at least 3 consecutiveentries with given type of piece (X/O) (3 in a row XXX, OOO), then return true, otherwise false.
A prime number is an integer value that is only divisible by 1 and itself. 2, 3, 5, 7, and 11 are examples of prime numbers. You have been provided with two function definitions: The is_prime () function takes an integer parameter number, and returns True if number is prime and False otherwise. The get_next_prime () function also takes a single integer parameter number, and returns the first prime number larger than it. You must not change the implementation of these 2 functions. Complete the get_primes_list() function that takes a single list of integers called numbers as parameter. You can assume that the integer items in this list will be non-negative. The function must update this list so that items that are not prime numbers are updated to the first prime number larger than them. To implement this function you must call both the is_prime () and get_next_prime () functions. Some examples of the function being called are shown below. Note: the get_primes_list() function does not…
Python only* Use recursive function*. Define concentricCircles with 4 parameters Use def to define concentricCircles with 4 parameters here is the specification for concentricCircles function: It draws a series of concentric circles, where the first parameter specifies the radius of the outermost circle, and the second parameter specifies the number of circles to draw. When viewed as nested rings, all rings should have the same thickness. The third and fourth parameters specify an outer color and an other color, respectively. The outer color is used for the outermost circle, and then every other circle in to the center alternates between that color and the other color. We will test both how many circles are drawn as well as whether the correct circles are drawn in the correct order. Hint: Each function call frame only needs to draw a single circle. Note that you must use the turtleBeads drawDot function to draw each circle Do not use any kind of loop Within the definition of…
Python only* Use recursive function*. Define concentricCircles with 4 parameters Use def to define concentricCircles with 4 parameters here is the specification for concentricCircles function: It draws a series of concentric circles, where the first parameter specifies the radius of the outermost circle, and the second parameter specifies the number of circles to draw. When viewed as nested rings, all rings should have the same thickness. The third and fourth parameters specify an outer color and an other color, respectively. The outer color is used for the outermost circle, and then every other circle in to the center alternates between that color and the other color. We will test both how many circles are drawn as well as whether the correct circles are drawn in the correct order. Hint: Each function call frame only needs to draw a single circle. Note that you must use the turtleBeads drawDot function to draw each circle Do not use any kind of loop Within the definition of…
good stat ofl them ii days. You need to upload your solutions in a single python file (assl.py) to the link on MS Teams. Part 1 Add this comment: # Ass 1: Part 1 Write a program that declares a function called draw Star which receives an integer value as a parameter, and draws a number of stars equal to the received integer. Samplel: Please enter the number of stars: 5 The shape is: **** Sample2: Please enter the number of stars: 3 The shape 15 *** Part 2 Add this comment: Ass 1: Part 2 Write a program that summation of even ni "nd M then prints the 3.9 nclud d if were even of 3
REVERSED SUM OF ODD POSITIONS Write a function that takes an integer(n) as input and returns True if the sum of its digits at odd positions is even, and returns False of otherwise. Positions are counted from the least significant digit. stion For example: n = 2345 →> True Explanation: The digits at odd positions are 5 and 3, and their sum i.e. 8 is even. Examples: rev_sum of odd_pos(2345) - True - False rev_sum_of_odd_pos(5728) *Note: Please return your output. Don't print your answer inside the function. Your code will not get evaluated, if you are using 'print statement inside the function." Answer: (penalty regime: 0 %) Reset answer 1-def rev_sun of odd pos (n: int)-> bool: 2 merite your code from here e
Part (a) Write a python function that computes the binomial coefficient ("). The function should return the correct answer for any positive integer n and k where k=m pass Part (c) Suppose that the number of people in the trial is 100. Then: • Plot a curve that shows how the probability of type 1 error changes with the choice of m, for m = 1,...n assuming that the null hypothesis holds (in red), • On the same picture, plot the probability of type 2 error vs the value of m in the case in which the new drug is effective with proability 0.68 (in blue). You can plot the two curves using matplotlib.pyplot. You can select the color by passing color='r' or color='b' to the plt.plot() function. [4]: n - 100 # your code here def plot_curve (): pass [5]: plot_curve() Part (d) Based on the picture above, what value of m do you think would be suitable to keep both type 1 and type 2 error small at the same time? (You may assume that the company claims the new drug has 68% accuracy) [6]: # your…
Create a function which counts how many lone 1's appear in a given number. Lone means the number doesn't appear twice or more in a row. Examples count LoneOnes (101) ➡2 count LoneOnes (1191) → 1 count LoneOnes (1111) count LoneOnes (462) 0
Complete the code that returns the value of f(x), which has the value 1 inside the range -1 < x < 1 otherwise it is the value 0. { 1, х€[-1, 1] 0, otherwise f(x) = In [ ]: # complete the function to return the value of f(x) given x. # return as the value called variable "fval" def function_f(x): # your code here return fval
Create a function that takes a string of words and returns the word with the highest score. Each letter of the word gets points according to its position in the alphabet: a = 1, b = 2, C = 3, etc. Examples wordRank ("A quick brown fox.") → "brown" wordRank ("Nancy is very pretty.") "pretty" wordRank ("Come back tomorrow, man!") → "tomorrow" wordRank ("Wednesday is hump day.") "Wednesday" Solution in JS 10