q13 : Using python programming a screenshot is helpful test (hypotenuse (9, 12) 1 )13. Write a function slope (x1, yl, x2, y2) that returns the slope of the line throughthe points (x1, yl) and (x2, y2). Be sure your implementation of slope can pass thefollowing teststest (slope (5, 3, 4, 2 1,0)test (slope (1, 2, 3, 2)Lest (slope (1, 2, 3, 3)*-test (slope (2, 4, 1, 2)0,0)10.5)2.0)Then use a call to s lope in a new Tunctlon named intercept (x1, yL, x2, y2)that returns the y-intercept of the line through the points (x1, yl) and (x2, y2).test (Intercept (1, 6, 3,12)- .0)test (1ntercept (4, 1,12)8)14 Write a function çalled 15 even (n) that takes an înteger as an argument and returnsre if the areument is an even nunmbe

Algorithm: Start Define 2 methods, slope() and intercept which takes x1,y1,x2,y2 as arguments…

13. Write a function slope (xl, yl, x2, y2) that returns the slope of the line through the points (x1,yl) and (x2, y2). Be sure your implementation of slope can pass the following tests test (slope (5, 3, 4, 2) test (slope (1, 2, 3, 2)- 0,0). Lest (slope(1, 2, 3, 3)= 0.5) test (slope (2, 4, 1, 2) 2.0) 1,01 Then use a call to slope in a new functlon named intercept (x1, yl, x2, y2) that returns the y-intercept of the line through the points (x1, yl) and (x2, y2). Test (intereept (1, 6, 2, 12) 30 test (1ntercept (4, 1, 12,8) 5.0) 14 Write a function çalled is even (n) that takes an integer as an argument and returns True if the arpument is an even numbe

13. Write a function slope (xl, yl, x2, y2) that returns the slope of the line through the points (x1,yl) and (x2, y2). Be sure your implementation of slope can pass the following tests test (slope (5, 3, 4, 2) test (slope (1, 2, 3, 2)- 0,0). Lest (slope(1, 2, 3, 3)= 0.5) test (slope (2, 4, 1, 2) 2.0) 1,01 Then use a call to slope in a new functlon named intercept (x1, yl, x2, y2) that returns the y-intercept of the line through the points (x1, yl) and (x2, y2). Test (intereept (1, 6, 2, 12) 30 test (1ntercept (4, 1, 12,8) 5.0) 14 Write a function çalled is even (n) that takes an integer as an argument and returns True if the arpument is an even numbe

C++ for Engineers and Scientists

4th Edition

ISBN:9781133187844

Author:Bronson, Gary J.

Publisher:Bronson, Gary J.

Chapter5: Repetition Statements

Section5.5: A Closer Look: Loop Programming Techniques

Problem 12E: (Program) Write a program that tests the effectiveness of the rand() library function. Start by...

See similar textbooks

Similar questions

In Python, write a function that produces plots of statistical power versus sample size for simple linear regression. The function should be of the form LinRegPower(N,B,A,sd,nrep), where N is a vector/list of sample sizes, B is the true slope, A is the true intercept, sd is the true standard deviation of the residuals, and nrep is the number of simulation replicates. The function should conduct simulations and then produce a plot of statistical power versus the sample sizes in N for the hypothesis test of whether the slope is different than zero. B and A can be vectors/lists of equal length. In this case, the plot should have separate lines for each pair of A and B values (A[1] with B[1], A[2] with B[2], etc). The function should produce an informative error message if A and B are not the same length. It should also give an informative error message if N only has a single value. Demonstrate your function with some sample plots. Find some cases where power varies from close to zero to…
You are to create a well-formed Python recursive function (i.e, there must be a stopping/base case and the recursive case must present a smaller problem), along with a call to that function. You will then trace that function, showing how memory is used and provide any and all output. You then need to present a relationship, whose domain is some subset of the integers. Finally, you need to provide a prove that the relationship holds over the entire domain by using detailed Mathematical Induction prove. 1. You are to create a well-formed Python recursive function (i.e, there must be a stopping/base case and the recursive case must present a smaller problem), along with a call to that function. 2. Trace your function and call. Remember that you must keep track of memory for each function call and provide output. 3. Present a relationship with the domain some subset of the integers that is to be proven via Mathematical Induction. 4. Prove your relationship with the domain some subset…
Create a curve that uses a quadratic parametric approach with three interpolated control points. The equations which describe the curve are: $$f_x(u) = c_0 u^2 + c_1 u + c_2 $$ and $$f_y(u) = c_3 u^2 + c_4 u + c_5 $$ where $u$ ranges from 0.0 to 1.0. The first control point $$p_0$$ is for $u=0$, the second $p_1$ for $u=0.5$, and the third for $p_2$ and at $u=1.0$. Modify the code to implement your solution. It is sufficient for this task to get the program working with three control points, but you are most welcome to attempt a solution that works on four or more. Code: import java.awt.Graphics2D; import java.awt.geom.Ellipse2D; import java.awt.geom.Path2D; import java.awt.geom.Point2D; import javax.swing.JFrame; import javax.swing.JTabbedPane; import javax.swing.SwingUtilities; public class DotToDotDemo implements Runnable { /** * DotToDotDemo - A demo which draws dots between points to form a curve. * Eric McCreath 2015, 2019 - GPL * Modified by Matthew Aitchison 2022. */ JFrame…
In Kotlin A. Write a function lengthGreaterThan() with an expression body that takes a String s and an Int n and returns true if the String is at least n characters long. Then revise the function so that it can accept null values. If it receives null as the parameter, it should return false. B. Write a recursive function with an expression body that takes a list of nullable Strings and and Int an returns a list of just the Strings from the original list for which the function you wrote in the first part returns true C. Get the same result as in part B by using filter()
(Program) Write a program that tests the effectiveness of the rand() library function. Start by initializing 10 counters, such as zerocount, onecount, twocount, and so forth, to 0. Then generate a large number of pseudorandom integers between 0 and 9. Each time 0 occurs, increment zerocount; when 1 occurs, increment onecount; and so on. Finally, display the number of 0s, 1s, 2s, and so on that occurred and the percentage of time they occurred.
Write a Matlab function that will: read in the spreadsheet file, accept two textual/string arguments: first metric abbreviation/acronym (for example GP) from the list above, Second metric abbreviation/acronym (for example 3P%) from the list above, finds the player (A) who has the highest/maximum value of the FIRST METRIC (if there is more than one with that value, pick the first one - lowest row number) and stores his name and corresponding FIRST METRIC value, finds the player (B) who has the lowest/minimum value of the FIRST METRIC (if there is more than one with that value, pick the first one - lowest row number) and stores his name and corresponding FIRST METRIC value, computes FIRST METRIC average for all players, finds SECOND METRIC value for both players found above, computes SECOND METRIC average for all players,
SUCCESSIVE-OVER-RELAXATION Method TROUBLESHOOTING: Fix the errors in the code below and run the script with your modified code and screenshot your output and codes with answer function [x,numIter,omega] = gaussSeidel(func,x,maxIter,epsilon) % Solves Ax = b by Gauss-Seidel method with relaxation. % USAGE: [x,numIter,omega] = gaussSeidel(func,x,maxIter,epsilon) % INPUT: % func = handle of function that returns improved x using % x = starting solution vector % maxIter = allowable number of iterations (default is 500) % epsilon = error tolerance (default is 1.0e-9) % OUTPUT: % x = solution vector % numIter = number of iterations carried out % omega = computed relaxation factor if nargin < 4; epsilon = 1.0e-9; end if nargin < 3; maxIter = 500; end k = 10; p = 1; omega = 1; for numIter = 1:maxIter xOld = x; x = feval(func,x,omega); dx = sqrt(dot(x - xOld,x - xOld)); if dx < epsilon; return; end if numIter == k; dx1 = dx; end if numIter == k + p omega = 2/(1 + sqrt(1 -…
In kotlin, write an isPyth(a,b,c) function with an expression body that takes three Doubles as arguments and returns true if they are a Pythagorean triple, otherwise returns false. use Math.pow(base, exponent), where both base and exponent are Doubles. Double has an .equals() method; use that, not ==
An object leaves point P1 with coordinates (−1,0) and travels with velocity v1=1 in a straight line to point P2 with coordinates (0,h) . It then travels with velocity v2=2 in a straight line from P2 to point P3 with coordinates (x , y ). Given x and y values there will be some optimal h value that minimizes the total travel time. Write a program in Scilab containing a function in the form function u = h(x,y) [your code goes here] endfunction u = h(1,2); disp(u); that calculates this optimal h value (to an accuracy of about 10^−6 ) given x and y values as arguments. Your function must work for any positive values of x and y.
I need a Clark and Wright Savings Algorithm in Python. Are there any templates already? I have the following distance matrix given: [0, 10, 5, 9999, 9999, 9999, 9999], [10, 0, 5, 15, 20, 9999, 9999], [5, 5, 0, 10, 9999, 9999, 9999], [9999, 15, 10, 0, 15, 20, 15], [9999, 20, 9999, 15, 0, 5, 9999], [9999, 9999, 9999, 20, 5, 0, 20], [9999, 9999, 9999, 15, 9999, 20, 0]
Consider the function, f(n), defined by the following code int f(int n) { int r = 0; if ( n % 2 == 0 ) return 1; // when n is even while ( n > 1 ) { n = n – 3; r++; } return r; } From the definitions of big-Theta and little-oh: Prove or disprove that f(n) is Θ ( n ) 2. Prove or disprove that f(n) is o ( n^2 ) ( note: function f(n) as defined by the code, that is, the return value, and is not asking about the runtime of the code.)
A triple (x, y, z) of positive integers is pythagorean if x2 + y2 = z2. Using the functions studied in class, define a function pyth which returns the list of all pythagorean triples whose components are at most a given limit. For example, function call pyth(10) should return [(3, 4, 5), (4, 3, 5), (6, 8, 10), (8, 6, 10)]. [Hint: One way to do this is to construct a list of all triples (use unfold to create a list of integers, and then a for-comprehension to create a list of all triples), and then select the pythagorean ones. def unfold[A, S](z: S)(f: S => Option[(A, S)]): LazyList[A] = f(z) match { case Some((h, s)) => h #:: unfold(s)(f) case None => LazyList() } code in scala