The coordinates of a polygon can be represented as a list of tuples: [(x1, y1), (x2, y2), ..., (xn, yn)], where (x1, y1), ..., (xn, yn) are points of the polygon in a counterclockwise order. Find the area of such a polygon using using shoelace formula. It is no longer required to take absolute value. n-1 n-1 1 A = 2 (Σ (Σ XiYi+1 ) Xi+1Yi) - x1Yn i=1 i=1 142 +x2Y3 +...+ xn-1Yn + xny1 - x2Y1 - 23Y2 - .. Xn Yn-1 – x1Yn >>> area([(0,0),(1,0),(0,1)]) 0.5 >> area([(0,0),(1,0),(1,1),(0,1)]) 1.0 >> area([(0,0),(2,0),(2,2),(1,2), (0,1)]) 3.5 Write the function area(C) to find the area of a triangle with vertices at C [(x1, y1), (x2, y2),..., (xn, yn)]. 1/2

The coordinates of a polygon can be represented as a list of tuples: [(x1, y1), (x2, y2), ..., (xn, yn)], where (x1, y1), ..., (xn, yn) are points of the polygon in a counterclockwise order. Find the area of such a polygon using using shoelace formula. It is no longer required to take absolute value. n-1 n-1 1 A = 2 (Σ (Σ XiYi+1 ) Xi+1Yi) - x1Yn i=1 i=1 142 +x2Y3 +...+ xn-1Yn + xny1 - x2Y1 - 23Y2 - .. Xn Yn-1 – x1Yn >>> area([(0,0),(1,0),(0,1)]) 0.5 >> area([(0,0),(1,0),(1,1),(0,1)]) 1.0 >> area([(0,0),(2,0),(2,2),(1,2), (0,1)]) 3.5 Write the function area(C) to find the area of a triangle with vertices at C [(x1, y1), (x2, y2),..., (xn, yn)]. 1/2

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

True or False 1. Matrices are often represented by single small letters a, b, c... etc.2. Two m x n matrices A and B are equal if aij=bij for each i & j. (i.e., the two matrices havesame size, and all the corresponding elements are equal).3. Matrices A & B are said to be conformable in the order AB if, and only if, the number ofrows in A is equal to the number of columns in B.4. Suppose Matrix A is having 4 rows and 3 columns, and Matrix B is having 3 rows and 2columns. The product size of AB is a 4 x 2 matrix.5. Suppose B is the matrix obtained from an n x n matrix A by multiplying the entries in arow/column by a non-zero constant and adding the result to the corresponding entries inanother row/column. Then, det(B) = det(A).
The compass gradient operators of size 3x3 are designed to measure gradients of edges oriented in eight directions: E, NE, N, NW, W, SW, S, and SE. i) Give the form of these eight operators using coefficients valued 0, 1 or – 1. ii) Specify the gradient vector direction of each mask, keeping in mind that the gradient direction is orthogonal to the edge direction.
Find S ◦R for the following R and S.a) R= {( (1, 3), (2, 4), (3, 1),(3,2)}, and S = {(2, 1), (3, 1), (4, 1)}
The zero vector 0 = (0, 0, 0) can be written as a linear combination of the vectors v,, v,, and v, because 0 = Ov, + Ov, + 0va. This is called the trivial solution. Can you find a nontrivial way of writing 0 as a linear combination of the three vectors? (Enter your answer in terms of v,, v,, and v. If not possible, enter IMPOSSIBLE.) v, = (1, 0, 1), v, = (-1, 1, 2), v3 = (0, 1, 2) 0 =
) Let O be the set of odd numbers and O’ = {1, 5, 9, 13, 17, ...} be its subset. Definethe bijections, f and g as:f : O 6 O’, f(d) = 2d - 1, d 0 O.g : ø 6 O, g(n) = 2n + 1, n 0 ø.Using only the concept of function composition, can there be a bijective map from øto O’? If so, compute it. If not, explain in details why not...................................................................................................................................... [2+8]b) A Sesotho word cannot begin with of the following letters of alphabet: D, G, V, W,X, Y and Z.We define the relation: A Sesotho word x is related to another Sesotho word y if xbegins with the same letter as y.Determine whether or not this is an equivalence relation.If it is an equivalence relation then1. Compute C(sekatana)2. How many equivalence classes are there in all, and why?3. What is the partition of the English words under this relation?If it is NOT an equivalence relation then explain in details why it is not
3) Show that the set of three-dimensional coordinates {(x, y, z)|x, y, z E Z} has size equal to N.
Given A = {1,2,3} and B={u,v}, determine. a. A X B b. B X B
Write a program that generates a 6-by-6 two-dimensionalmatrix filled with 0s and 1s, displays the matrix, and checks if every row andevery column have an even number of 1s.
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,…
1. A set of integers are relatively prime to each other if there is no integer greater than 1 that divides all the elements. Furthermore, in Number Theory, it is known that the Euler function,ϕ (n), expresses the number of positive integers less than n that are relatively prime with n. Choose the alternative that has the correct value of ϕ(n) for every n below. A) ϕ(5) = 4 B) ϕ(6) = 2 C) ϕ(10) = 3 D) ϕ(14) = 6 E) ϕ(17) = 16
In Python, generate a random matrix A with 100 entries each of which is an independent numberpseudo-randomly drawn (uniformly) from the interval (0, 1). Let B = A + AT . Use Python to calculatethe diagonal matrix D with the same eigenvalues as B. Then use the QR method to block-diagonalize Bover R. Do at least 100 steps of the QR switching. You should end up with a matrix E which is differentthan D. Answer the question of why.
You are a computer research scientist at Tesla, and your task is to create a computer vision application for self-driving cars to detect object and avoid collision. You know that Graham's scan is a method of computing the convex hull of a finite set of points in the plane. You decide to apply this algorithm to achieve the goal of your task. a) Suppose Graham's scan executes n points, where n >= 3. Prove that, at the end of the program, the stack S consists of, from bottom to top, exactly the vertices of convex hull in counter-clockwise order.