

1. Treat the case N = 61 by the cakravāla without using short cuts, proceeding as...
Without using the master theorem, show that the solution of T(1) = 10, T(n) = T(n / 2) + 1 is in O(log n).
4. (a) Solve the differential equation (1-12)y"-2cy' + λ(A + 1)y 0 using power series centered at 0 , in which λ is a constant. Write your solution as a linear combination of two independent solutions whose coefficients are expressed in terms of λ . Compute the coefficients of each solution up to and including the 5 term. Without computing them, what is the smallest possible value of the radius of convergence of each solution and why? (b) When λ...
4. (a) Solve the differential equation (1 − x 2 )y ′′ − 2xy′ + λ(λ + 1)y = 0 using power series centered at 0 , in which λ is a constant. Write your solution as a linear combination of two independent solutions whose coefficients are expressed in terms of λ . Compute the coefficients of each solution up to and including the x 5 term. Without computing them, what is the smallest possible value of the radius of...
4. (a) Solve the differential equation (1 − x 2 )y ′′ − 2xy′ + λ(λ + 1)y = 0 using power series centered at 0 , in which λ is a constant. Write your solution as a linear combination of two independent solutions whose coefficients are expressed in terms of λ . Compute the coefficients of each solution up to and including the x 5 term. Without computing them, what is the smallest possible value of the radius of...
3. a) Short questions (Please briefly justify your answers in each case to receive full credits) 1) If we wish to minimize a function, fx.y) = 2x2+ 5x22+10, using Univariate Search method, how many searches will it take to reach the minimum and why? -L1 ii) Starting from an initial guess, Xo the minimization of the following function using Newton-Raphson method fails to work. Please explain why. fX) 0.5x2+2x1x- (1/3)x3+ 50 Note: N-R method: X- X1 - [H(X-1)] 'af(X1), where...
5. (a). Find a counterexample to show that 'n € 7,92 +9n+61 is prime" is false. (b). Determine the truth value of "Vee R+ In € Z and justify your answer 6. Write the negation of the following statements (without using in the final answer) (a). Vn € Z, p € P. ** <p<(n+1) (b). Vce R+ 3K € Zt. Vn € Z,n > K-1 Sc.
2. Let YBinomial (n, p) where p docs not depend on . Without using the WLLN (but you can use e.g. Chebychev's inequality) show that (a) Y/n-, p as n → oo (b) (1-Y/n)-> (1-p) as n → oo
avr
assembly please
3) Write an assembly program that is algorithmically equivalent to the following C++ code. Treat the variable y as a short int (16 bits) 1 int y; 2 for (int x = 2; x <= 20; x = x + 2) { 3 ¡f (x < 18) { 4 5 у 24 6 else f 7 8 9
3) Write an assembly program that is algorithmically equivalent to the following C++ code. Treat the variable y as...
Using Python: Compute the Mean Square Error (MSE): ???=1?∑??=0(??−??)2 M S E = 1 n ∑ i = 0 n ( X i − Y i ) 2 . Where ?? X i and ?? Y i imply the ? i -th elements in ? X and ? Y , and ? n is the number of elements in ? X and ? Y (for example, create one-dimensional arrays ? X and ? Y with 5 elements).
Consider the system:y[n]-0.5y[n-1]-0.25y[n-2]=x[n]+2x[n-1]+x[n-2] • Plot, using MATLAB, the impulse and step responses of the system. Highlight the response characteristics in your plots • Assume initial conditions y(-1) = 1, y(-2) = 0 and that the input signal to the system is a discrete-time unit step. Determine the formula for the Z-transform of the solution, Y(z). Subsequently, determine the formula for the solution, y[n], itself.