If n points are connected to form a closed polygon as shown below, the area of the polygon can be compuled as n-2 Area = (%) E (** x ) (y» - y ) Notice that although the ilustrated polygon has only 6 distinct comers, n for his polygon is 7 because the algorithmexpects that the last point (x.y.) wil be repeat of the initial point, (Ko.yo). Define a structure for a point. Each point contains x coordinate and y co0ordinate. The representation of a Polygon must be an array of structures in your program. Write a C program that takes the number of actual points (n-1) from the user. After that, user enters x and y coordinates of each point. (The last point will be repeat of the initial point). Write a compute Area function which returns the area of the Polygon. Print the area of the Polygon in main. Display the area with two digts after the decimal point. Note: The absolute value can be computed with fabs function. Example: double x-50: fabs(x) is 5.0 double x 0.0; double x5.0; fabs(x) is 0.0 fabs(x) is 5.0 Sample Input Sample Output T6.00

If n points are connected to form a closed polygon as shown below, the area of the polygon can be compuled as n-2 Area = (%) E (** x ) (y» - y ) Notice that although the ilustrated polygon has only 6 distinct comers, n for his polygon is 7 because the algorithmexpects that the last point (x.y.) wil be repeat of the initial point, (Ko.yo). Define a structure for a point. Each point contains x coordinate and y co0ordinate. The representation of a Polygon must be an array of structures in your program. Write a C program that takes the number of actual points (n-1) from the user. After that, user enters x and y coordinates of each point. (The last point will be repeat of the initial point). Write a compute Area function which returns the area of the Polygon. Print the area of the Polygon in main. Display the area with two digts after the decimal point. Note: The absolute value can be computed with fabs function. Example: double x-50: fabs(x) is 5.0 double x 0.0; double x5.0; fabs(x) is 0.0 fabs(x) is 5.0 Sample Input Sample Output T6.00

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

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. п-1 п—1 A = > xi+1Yi ) – x1Yn i=1 i=1 1 x142 + x2Y3 + + xn-1Yn + xnY1 - x2y1 – X3Y2 – ··- 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)].
describe the 2-approximation algorithm's Python source code. The majority of the code is concerned with removing the randomly chosen edge and its surrounding edges from the graph. The incidence matrix B(G) from the graph G is the input to the procedure VC Approx. Every iteration, the endpoints of a chosen edge are added to the list V C and the unmarked edges are kept in the list edges. We input the graph's incidence matrix B and then iterate through the rows of B to find edges that are near the matched edge. The main while loop iterates until this list is empty after each found edge is removed from the list edges.
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)}
w describe the Python code for the 2-approximation algorithm. The main part of the code deals with deleting the randomly selected edge from the graph along with its neighboring edges. Input to the procedure VC_Approx is the incidence matrix B(G) of the graph G. The unmarked edges are held in the list edges and the endpoints of a selected edge are included in the list V C at each iteration. The incidence matrix B of the graph is input and we find adjacent edges to the matched edge by iterating through rows of B. Each found edge is deleted from the list edges and main while loop iterates until this list becomes empty. We check adjacent edges to the matched edge from this matrix by deleting adjacent edges at each endpoint.
Q5: For the foliowsg ication of Boolean function, implement and desigr the function. F(A,B,C,D,E) = Em (0.4,6,7,9,10,12,15,17,19,29,23,25.26,27,28,30).
{[::]-« a 0 0 (b): Let U = : a, b ER and W c, d ER be 0 0 two subspaces of M2 (R). Show that U e W = M2 (R).
Given A = {1,2,3} and B={u,v}, determine. a. A X B b. B X B
is this functions from R to R is a bijection or not f(x)=(x2+2)/(x2+3)
Show that the following argument is valid for any natural number n ∈N. p1 →p2 p2 →p3 ... pn−1 →pn ¬pn ∴¬(p1 ∨···∨pn−1................
Suppose that the equation ax b .mod n/ is solvable (that is, d j b, whered D gcd.a; n/) and that x0 is any solution to this equation. Then, this equation has exactly d distinct solutions, modulo n, given by xi D x0 C i.n=d / fori D 0; 1; : : : ; d 1
Let A={+,x,a,b}. Show that (a*V ba)+ b is regular over A.
10 Is A-(BU C) = (A-B) (A-C)? Prove it or disprove it.