Problem 2: Calculating area of a triangle from the given vertices Consider a triangle with the following vertices: A(1, 31). B(x2, y2), and C(x3, Y3). The area of a triangle for the given vertices can be calculated using the following equation: ==—=|T1(Y2 − Y3) + £2(Y3 − Y₁) +£3(Y1 − Y2)| Area = a. Write a void function that accepts the vertices of triangle, calculates the area of that triangle using the above equation and prints the result at the console (without returning anything). b. Write a similar function like (a), but instead of printing the area of a traingle from within the function it returns the value of the calculated area. c. Write a program to calculate the area of a triangle with the following vertices: A(-1,2), B(2, 3), C(4, -3). Use both functions defined in (a) and (b). Make sure, the calculated area from function (b) should be displayed at the console also.

Problem 2: Calculating area of a triangle from the given vertices Consider a triangle with the following vertices: A(1, 31). B(x2, y2), and C(x3, Y3). The area of a triangle for the given vertices can be calculated using the following equation: ==—=|T1(Y2 − Y3) + £2(Y3 − Y₁) +£3(Y1 − Y2)| Area = a. Write a void function that accepts the vertices of triangle, calculates the area of that triangle using the above equation and prints the result at the console (without returning anything). b. Write a similar function like (a), but instead of printing the area of a traingle from within the function it returns the value of the calculated area. c. Write a program to calculate the area of a triangle with the following vertices: A(-1,2), B(2, 3), C(4, -3). Use both functions defined in (a) and (b). Make sure, the calculated area from function (b) should be displayed at the console also.

C++ for Engineers and Scientists

4th Edition

ISBN:9781133187844

Author:Bronson, Gary J.

Publisher:Bronson, Gary J.

Chapter13: Structures

Section: Chapter Questions

Problem 4PP

See similar textbooks

Similar questions

Computer science
max edge distance Simplification key Figure 4-1: A sample process for the Douglas-Peucker algorithm The Douglas-Peucker algorithm is for the selection of representative points to simplify a curve composed of line segments. It uses a point-to-edge distance tolerance. The algorithm starts with a crude simplification that is the single edge joining the first and last vertices of the original polyline. It then computes the perpendicular distance of all intermediate vertices to that edge. The vertex that is furthest away from that edge, and that has a computed distance that is larger than a specified tolerance, will be marked as a key and added to the simplification. This process will recurse for each edge in the current simplification until all vertices of the original polyline are within tolerance of the simplification results. This process is illustrated in Figure 4-1. (1) Given three points (xp, Yp), (Xa, Ya), (Xp,Yb), show a detailed process to compute the perpendicular distance from p…
One of the most important mathematical problems through all times has been to find the area of a polygon. For example, real estate areas often had the shape of polygons, and the tax was proportional to the area. Suppose we have some polygon with vertices ("corners") specified by the coordinates (x1,y1), (x2,y2), …, (xn,yn), numbered either in a clockwise or counter-clockwise fashion around the polygon. The area A of the polygon can amazingly be computed by just knowing the boundary coordinates: A=12|(x1y2+x2y3+⋯+xn−1yn+xny1)−(y1x2+y2x3+⋯+yn−1xn+ynx1)|.(17) Write a function polygon_area(x, y) that takes two coordinate lists with the vertices as arguments and returns the area. Test the function on a triangle, a quadrilateral, and a pentagon where you can calculate the area by alternative methods for comparison. Hint. Since Python lists and arrays has 0 as their first index, it is wise to rewrite the mathematical formula in terms of vertex coordinates numbered as x0,x1,…,xn−1 and…
Draw the following graph as represented in the adjacency matrix below. a b c d A 1 1 1 0 B 0 1 1 0 C 0 0 1 1 d 0 0 0 1
dp Mg %3D dy RT Dependency of pressure with height EQUATION M=29 g=9.82 R=8.31 P=10 Write the python code that solves the differential equation with euler, heun and midpoint method and shows the solution curve of the 3 methods on a single graph Show transcribed image text
Computer Science In C++ no vectors include int main follow all directions
You have to run Prim's algorithm for the problem defined by adjacency matrix: 1 2 3 4 5 6 7 8 9 1 0 10 9 999 999 17 999 999 999 2 3 69 10 0 14 4 2 999 999 13 999 14 0 7 999 999 999 999 999 4 999 4 7 0 999 2 8 999 999 5 999 2 999 999 0 6 999 1 999 6 17 999 999 2 6 0 999 7 999 7 999 999 999 8 999 999 0 11 4 8 999 13 999 999 1 7 11 9 999 999 999 999 999 999 4 80 8 0 1. We started from the vertex vl, so initially we have Y = {v1}: initial 1 2 3 4 5 6 7 8 9 nearest 1 1 1 1 1 1 1 1 1 distance -1 10 9 999 999 17 999 999 999 Print out the values stored in the nearest and distance arrays after first iteration of Prim's algorithm. Specify the value of vnear and the next vertex that has to be added to Y Hint: use (copy) the table above to record your answer.
Given A={1,2,3,4,5,6}, B={4,5,6,7,8,9}. Compute (c)A−B=
Give the Adjacency Matrix and Adjacency List based on the graph below:
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,…
4. Königsberg bridges The Königsberg bridge puzzle is universally accepted as the problem that gave birth to graph theory. It was solved by the great Swiss-born mathematician Leonhard Euler (1707–1783). The problem asked whether one could, in a single stroll, cross all seven bridges of the city of Königsberg exactly once and return to a starting point. Following is a sketch of the river with its two islands and seven bridges: a. State the problem as a graph problem. b. Does this problem have a solution? If you believe it does, draw such a stroll; if you believe it does not, explain why and indicate the smallest number of new bridges that would be required to make such a stroll possible.
Write the following set of equations in matrix form (or array form): 50=5x₂ - 7x₂ 4x₂ + 7x₂ +30=0 x₁ - 7x₂ = 40-3x₂ + 5x₁ Use Python to solve for the unknowns. In addition, compute the transpose and inverse of the coefficient matrix.