Answered: Write a program (using for-loop) that…

Write a program (using for-loop) that calculates dot-product ((V-W).(V+W)) of these vectors 5) What is the value of the dot-product?

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

NUMERICAL ANALYSIS::::::: Write a MATLAB program for the Newton-Raphson method. Write your name, ID, and number of the Section inside the code. Test your algorithm to find the root of the function: f(x) = cos(x) + 1/(1+x^2) defined on the interval [0.4, 4.5]. The angles are in radian. Start with the initial value for x to be 1.2. Stop the running until 10 iterations or relative approximated error is less than 0.05. Display the output for each iteration.
Exp2: A vectory is given by X = [−3.5 −5 6.2 11 0 8.1 −9 0 3 −1 3 2.5] Using conditional statement and loops, develop a program that creates two vectors from X: Vector P contains all positive elements of X Vector N contains the negative elements of X. The elements in new vectors are in the same order as in X. Please show me how to code this on matlab. I have tried watching tutorials on youtube and can not figure out how to code this for the life of me. Thank you.
IN PYTHON A tridiagonal matrix is one where the only nonzero elements are the ones on the main diagonal and the ones immediately above and below it.Write a function that solves a linear system whose coefficient matrix is tridiag- onal. In this case, Gauss elimination can be made much more efficient because most elements are already zero and don't need to be modified or added. As an example, consider a linear system Ax = b with 100,000 unknowns and the same number of equations. The coefficient matrix A is tridiagonal, with all elements on the main diagonal equal to 3 and all elements on the diagonals above and below it equal to 1. The vector of constant terms b contains all ones, except that the first and last elements are zero. You can use td to find that x1= −0.10557. The following code format should help: def td(l, m, u, b): '''Solve a linear system Ax = b where A is tridiagonal Inputs: l, lower diagonal of A, n-1 vector m, main diagonal of A, n vector u,…
Write a code for MatLab that is capable of solving 3x3 magic squares. Magic squares are those in which the sum of all the numbers in a row, column or diagonal is a specific number. - For example, the following is a magic square to solve, where the sum is required to be equal to 111 (See image)
Given a vector of real numbers r = (r1, r2, ..., rm). We can standardize the vector using the formulation: vi = "im, where m ri-m is the mean of the vector r, and s is the standard deviation of r. The vector v = (v1, v2, ..., Un) will be the scaled vector. Write a Python function scale_vec (r) that takes the vector r as input and returns the scaled vector v. Sample inputs and outputs: ● Input: np.array([1, 3, 5]), output: [-1.22474487 0. 1.22474487] • Input: np. array([3.3, 1.2, -2.7, -0.6]), output: [1.35457092 0.40637128 -1.35457092 -0.40637128] Hint: Use numpy.mean and numpy.std with default parameters. # Write your function here. Let's test your function. [ ] import numpy as np print (scale_vec (np.array([1, 3, 5]))) print (scale_vec (np.array([3.3, 1.2, -2.7, -0.6])))
IN PYTHON I want a code in python and no need to post work on paper Iwant a screenshot of the code A tridiagonal matrix is one where the only nonzero elements are the ones on the main diagonal and the ones immediately above and below it.Write a function that solves a linear system whose coefficient matrix is tridiag- onal. In this case, Gauss elimination can be made much more efficient because most elements are already zero and don't need to be modified or added. As an example, consider a linear system Ax = b with 100,000 unknowns and the same number of equations. The coefficient matrix A is tridiagonal, with all elements on the main diagonal equal to 3 and all elements on the diagonals above and below it equal to 1. The vector of constant terms b contains all ones, except that the first and last elements are zero. You can use td to find that x1= −0.10557. The following code format should help: def td(l, m, u, b): '''Solve a linear system Ax = b where A is tridiagonal Inputs: l,…
A matrix's trace is equal to its trace transposed. The diag method of Numpy may be used to extract the elements along the diagonal of a square matrix. Retrieving data from diagonals above or below the primary diagonal is possible using the optional parameter k. The call trace, just like in Python programming, may be used to get a matrix's trace.
Your main task is to write a recursive function sierpinski() that plots a Sierpinski triangle of order n to standard drawing. Think recursively: sierpinski() should draw one filled equilateral triangle (pointed downwards) and then call itself recursively three times (with an appropriate stopping condition). It should draw 1 filled triangle for n = 1; 4 filled triangles for n = 2; and 13 filled triangles for n = 3; and so forth. Sierpinski.java When writing your program, exercise modular design by organizing it into four functions, as specified in the following API: public class Sierpinski { // Height of an equilateral triangle with the specified side length. public static double height(double length) // Draws a filled equilateral triangle with the specified side length // whose bottom vertex is (x, y). public static void filledTriangle(double x, double y, double length) // Draws a Sierpinski triangle of order n, such that the largest filled //…
Initialize a vector v1 with the following values: 0 23 -7 8 -22 3 14 Write a MATLAB program from the values in v1. The vector v2 should contain the values in v1 transformed as follows: that uses a for-loop and if-statements to make a new vector v2 multiply each positive even element in v1 by 3, multiply each positive odd element of v1 by -2, and change the sign of the negative elements in v1. Then, output the new vector to the command window as follows: The new vector is: -46 7 24 22 -6 42 Also, compute and output the mean of the values in the new vector: The mean of the new vector is: xxxx Above, xxxx is the mean of the values in the new vector with 1 decimal place.
4x1+4x2+6x3+9x4=03x1+3x5=26x2+5x4+7x5=-46x1+8x4+2x5=54x5+7x2+6x3+8x1=-10Represent the set of equations in a matrix equation, Ax=b, where A is a square matrix and x and b are column vectors. Write the line of code to define matrix A for this problem matlab/octave language
Write a recursive function that takes as a parameter a nonnegative integer and generates the following pattern of stars. If the nonnegative integer is 4, then the pattern generated is: **** *** ** * ** *** ****
A robot moves in a 2D lattice. The robot can only move north (N), south (S), east (E), and west (W) by a certain number of steps. Assume that the robot always starts at (0,0), and that the x axis is oriented east, while the y axis is oriented north. Write a Python function that, given a set of moves, calculates the final position of the robot. For example, if the set of moves provided as input is: N 2 E 4 S 1 W 3 then the final position of the robot is (1,1). The integer that follows a move is always positive. Follow this code skeleton: def robot_move (moves): X = 0 y = 0 # your code here return (x,y) The moves are provided as an array of tuples. The array can have any number of moves in any order. The example above is passed as input as follows: [('N',2), ('E',4), ('S',1), ('W',3)]