The use of functions is very useful to carry out tasks. For instance, we might want to define a function which, for any input x, is equal to sin(x)/x. First we need to pick a name for this function – let’s try calling it sinex. Now we need to create a procedure called sinex within Python, and here is what goes inside it (in pseudocode format): (a) Set up the sinex function. Evaluate it at x = 0, and at x = π. What values do you expect there? Make a table of its values from -2 to 2 in increments of 0.25. (b) Plot the sinex function over the domain of -10 to 10

The use of functions is very useful to carry out tasks. For instance, we might want to define a function which, for any input x, is equal to sin(x)/x. First we need to pick a name for this function – let’s try calling it sinex. Now we need to create a procedure called sinex within Python, and here is what goes inside it (in pseudocode format): (a) Set up the sinex function. Evaluate it at x = 0, and at x = π. What values do you expect there? Make a table of its values from -2 to 2 in increments of 0.25. (b) Plot the sinex function over the domain of -10 to 10

C++ for Engineers and Scientists

4th Edition

ISBN:9781133187844

Author:Bronson, Gary J.

Publisher:Bronson, Gary J.

Chapter2: Problem Solving Using C++using

Section2.1: Introduction To C++

Problem 1E: (Practice) State whether the following are valid function names and if so, whether they’re mnemonic...

See similar textbooks

Similar questions

The binomial coefficient C(N,k) can be defined recursively as follows: C(N,0) = 1, C(N,N) = 1, and for 0 < k < N, C(N,k) = C(N-1,k) + C(N - 1,k - 1). Write a function and give an analysis of the running time to compute the binomial coefficients as follows: A. The function is written using dynamic programming.
Write a recursive algorithm with the following prototype: int divide(int x, int y); that returns x/y (integer division). You need not test for divide by 0. THE FUNCTION MUST BE RECURSIVE. (hint: base case should be when x<y)
(Practice) State whether the following are valid function names and if so, whether they’re mnemonic names that convey some idea of the function’s purpose. If they are invalid names, state why. powerdensity m1234 newamp 1234 abcd total tangent absval computed b34a 34ab volts$ a2B3 while minVal sine $sine cosine speed netdistance sum return stack
A quadratic function is a function of the form f(x) = ax**2 +bx + c Define a function quad_coefficients which accepts a quadratic function f as input, and returns a tuple containing the value a at index 0, b at index 1, and c at index 2. do this in python
NEWTON-RAPHSON METHOD EXAMPLE 1: Find the root of the function ?(?) = cos (?) using NRM having initial approximation of 1 Input the following codes to your MATLAB edit window and name as “newton.m” % Newton-Raphson Algorithm syms x %Input section y = input('Enter the given function: '); yd = input('Enter the derivative of the given function: '); p0 = input('Enter initial approximation: '); n = input('Enter no. of iterations, n: '); tol = input('Enter tolerance, tol: '); i = 1; while i <= n d=(eval(subs(y,x,p0)))/eval(subs(yd,x,p0)); p0 = p0 - d; if abs(d) < tol if i == 3 fprintf('\nApproximate solution of %s is xn= %11.9f on %drd iterations \n\n',y, p0, i); elseif i == 1 fprintf('\nApproximate solution of %s is xn= %11.9f on %dst iterations \n\n',y, p0, i); elseif i == 2 fprintf('\nApproximate solution of %s is xn= %11.9f on %dnd iterations \n\n',y, p0, i); else…
Find the maximum value of the following function F(x)=2x3 , using the genetic algorithm, performing two iterations.
Exercise 2. Give a recursive definition for the factorial operation k! n! for n ≥ 1. (remember that 1! = 0! = 1) Provide an algorithm in pseudo code to evaluate k! n! as one function Provide an algorithm in pseudo code to evaluate k! n! as three functions Evaluate the complexity of the algorithm at point 2 Evaluate the complexity of the algorithm at point 3
Let recursive algorithm F be defined as follows: F(int n):if n=1 then return 1else return F(n-1)*n (a) i. Assuming x is a positive integer, what mathematical expression is returned by F(x)?ii. Repeat (i) but assume the line “return 1” is replaced by “return 0”? (b) Which of the following replacements for the last line will yield a function guaranteed to terminate for all valid inputs? i. return F(n-2)+2ii. return F( )*2iii. return F( )*2
Compute time complexity of the given program. The complexity computation should be for the complete program. Map it on its relevant standard function. Computation should be clear. For(i=1; i<=n; i++) For(j=i; j<=n;j++) For(k=1; k<=j; k++) Print Mark;
Higher-order functions are the functions that run with higher than O(n) time complexity.Answer: true, false
# Exercise 1. Implement the algorithm covered in lectures that determines if an integer n is prime. Your function should return True, if n is prime, and False otherwise. Your algorithm has to be effective for n ~ 1,000,000,000,000.def isPrime(n):
ANALYSIS & DESIGN OF ALGORITHMS subject Three points P, Q, and R are said to be collinear if they are on a single line. To check whether the 3 points lie on the same line, we use the distance formula. If P, Q and R are three collinear points, then: Distance from P to Q + Distance from Q to R = Distance from P to R PQ + QR = PR The distance between two points (x1, y1) and (x2, y2) is given by Hence, we can easily find the distance between the points P, Q and R, with the help of this formula. Design an algorithm (pseudocode) to check whether three points are collinear. In your solution include the input and the output.