(Geometry: polygon subareas) A convex 4-vertex polygon is divided into fourtriangles, as shown in Figure 8.8.V2 (x2, y2)V1 (x1, y1)V3 (x3, y3)V4 (x4, y4)A 4-vertex polygon is defined by four vertices.Write a program that prompts the user to enter the coordinates of the four ver-tices and displays the areas of the four triangles in increasing order. Here is asample run:

Here is the java program: import java.util.Scanner; public class PolygonSubareas { staticfinalint…

Answered: (Geometry: polygon subareas) A convex…

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

(ABET 2) Construct a regular expression corresponding to the following set: {binary strings such that every odd position is a 1}. You may assume that the even positions can be a 0 or 1.
Program to sort the array in descending order. (JAVA) + Enter size of array and then enter all the elements of that array. + Now use for loop and variable we sort the array in descending order.
7. a) Write down the 5 by 5 adjacency matrix for the undirected graph below (Figure 1). A B C D Figure 1: Undirected Graph for Question 7. (a) b) Write a program that asks user to enter number of vertices in an undirected graph and then the adjacency matrix representing the undirected graph. The program, then, must display whether the given graph is connected or not. You will find two sample runs of the program below. Sample 1 Sample 2 Enter number of vertices: 3 Enter number of vertices: 3 Enter adjacency matrix: 0 1 1 10 0 1 0 0 Enter adjacency matrix: 0 1 0 1 0 0 0 0 0 The graph is connected. The graph is not connected.
(python) Study the following code, specifically the loop. _sum = 10 for k in range (2, 20, 3): _sum = _sum + (2*k) if _sum > 100: print("exceeded 100") Now, rewrite the for loop (for k in range(2, 20, 3):)to be a while loop that accomplishes the same objective. You don't need to show/use the other lines.
(True/False): A segment descriptor contains the base location of a segment.
Problem #3: Write code that divides a positive number n in half until the resulting number is less than 1. For this exercise, use a method that doesn't require you to convert the integer n to a different data type. For example, if n = 5, the first time through the loop should result in 2.5, the second time through should result in 1.25, and the third time through should result in 0.625. The loop should not be executed a forth time since 0.625 =10: 5 4 3 print (n) HN W 2 (missing line) n=n//10 1 print (r)
(Plot the cube function) Write a program that draws a diagram for the functionf(x) = x3 (see Figure ).Hint: Add points to a polyline using the following code:Polyline polyline = new Polyline();ObservableList<Double> list = polyline.getPoints();double scaleFactor = 0.0125;for (int x = –100; x <= 100; x++) {list.add(x + 200.0);list.add(scaleFactor * x * x * x);}
(Java) The greatest common divisor of two positive whole numbers and n1 and n2 is the largest number g such that g evenly divided into both n1 and n2. Write a complete program that takes two positive whole numbers from the user and displays the common divisor.
(Java) Q1 explain the answers to the below questions using step-by-step explanation.

Recommended textbooks for you

Database System Concepts

Computer Science

ISBN:

9780078022159

Author:

Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:

McGraw-Hill Education

Starting Out with Python (4th Edition)

Computer Science

ISBN:

9780134444321

Author:

Tony Gaddis

Publisher:

PEARSON

Digital Fundamentals (11th Edition)

Computer Science

ISBN:

9780132737968

Author:

Thomas L. Floyd

Publisher:

PEARSON

Database System Concepts

Computer Science

ISBN:

9780078022159

Author:

Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:

McGraw-Hill Education

Starting Out with Python (4th Edition)

Computer Science

ISBN:

9780134444321

Author:

Tony Gaddis

Publisher:

PEARSON

Digital Fundamentals (11th Edition)

Computer Science

ISBN:

9780132737968

Author:

Thomas L. Floyd

Publisher:

PEARSON

C How to Program (8th Edition)

Computer Science

ISBN:

9780133976892

Author:

Paul J. Deitel, Harvey Deitel

Publisher:

PEARSON

Database Systems: Design, Implementation, & Manag…

Computer Science

ISBN:

9781337627900

Author:

Carlos Coronel, Steven Morris

Publisher:

Cengage Learning

Programmable Logic Controllers

Computer Science

ISBN:

9780073373843

Author:

Frank D. Petruzella

Publisher:

McGraw-Hill Education

SEE MORE TEXTBOOKS