In a regular pentagon, the ratio of the length of a diagonal to the length of a side is equal to the Golden Ratio (defined as N 1.618 ) consider the following class Pentagon, which represents a regular pentagon.public class Pentagonpublic static final double goldenRatio =(1+ Math.sqrt (5.0))2;private double side:public Pentagon (double x){side =x;}public double getDiagonalLength)return side * goldenRatio;}Which of the following code segments will compile with no errors and display the correct length of a diagonal in a regular pentagon with side 3.0?I Pentagon p = new Pentagon (3);System.out.printin(p.getDiagonalLength0);II. System.out.printin(3.0* Pentagon.goldenRatio);III. System.out.println(3/2 * (1+Math sqrt (5.0);III onlyI onlyII onlyII and III onlyI and II only

public is a Java keyword which declares a member's access as public.

Which of the following code segments will compile with no errors and display the correct length of a diagonal in a regular pentagon with side 3.0? I Pentagon p = new Pentagon (3); System.out printin(p.-getDiagonalLength(); II. System.out.printin(3.0* Pentagon.goldenRatio); III. System.out.println(3/2 * (1 + Math sqrt (5.0));

Which of the following code segments will compile with no errors and display the correct length of a diagonal in a regular pentagon with side 3.0? I Pentagon p = new Pentagon (3); System.out printin(p.-getDiagonalLength(); II. System.out.printin(3.0* Pentagon.goldenRatio); III. System.out.println(3/2 * (1 + Math sqrt (5.0));

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

Analyze errorIf (x < 100) && (x> 10)System.out.println(“x” is between 10 and 100”);
There are 4 mistakes in the code. Can you please show me the mistakes?
a. Create a 1D array of integers to store 50 integers. b. Store values from 0 to 49 into the array you just created. c. Create a new String Object using no-arg constructor. d. Using for loop append the array elements one by one to the String (one per loop iteration) e. Record and display a run-time it took to append all integers to the String (record run-time of 1.d.)). E.g. "It took nanoseconds to append 50 integers to the String
I need the code from start to end with no errors and the explanation for the code ObjectivesJava refresher (including file I/O)Use recursionDescriptionFor this project, you get to write a maze solver. A maze is a two dimensional array of chars. Walls are represented as '#'s and ' ' are empty squares. The maze entrance is always in the first row, second column (and will always be an empty square). There will be zero or more exits along the outside perimeter. To be considered an exit, it must be reachable from the entrance. The entrance is not an exit.Here are some example mazes:mazeA7 9# # ###### # # ## # # #### # ## ##### ## ########## RequirementsWrite a MazeSolver class in Java. This program needs to prompt the user for a maze filename and then explore the maze. Display how many exits were found and the positions (not indices) of the valid exits. Your program can display the valid exits found in any order. See the examples below for exact output requirements. Also, record…
How do you access elements of an array? Can you copy an array a to b using b = a?
Advanced computer. Home work about curves
Analyze the following code:int matrix[5][5];for (int column = 0; column < 5; column++);matrix[4][column] = 10; Select the correct option: After the loop, the last row of matrix 10, 10, 10, 10, 10. After the loop, the last row of matrix 0, 0, 0, 0, 0. A syntax error, because column is not defined. After the loop, the last column of matrix 10, 10, 10, 10, 10. After the loop, the last row of matrix 0, 0, 0, 0, 10.
Try using the ref or out keyword to pass in an array argument and see what happens.
create a flowchart from the user-defined array for any size n determined/chosen by the user to the function that determines the perfect squares in an array. Display theresult as an ordered pair (u, v) where u is a perfect square and v is its corresponding squareroot. Call this function to find all perfect squares of the array.
The Lo Shu Magic Square is a grid with 3 rows and 3 columns shown below. The Lo Shu Magic Square has the following properties: The grid contains the numbers 1 – 9 exactly The sum of each row, each column and each diagonal all add up to the same number. This is shown below: Write a program that simulates a magic square using 3 one dimensional parallel arrays of integer type. Do not use two-dimensional array. Each one the arrays corresponds to a row of the magic square. The program asks the user to enter the values of the magic square row by row and informs the user if the grid is a magic square or not. Processing Requirements - c++ Use the following template to start your project: #include<iostream> using namespace std; // Global constants const int ROWS = 3; // The number of rows in the array const int COLS = 3; // The number of columns in the array const int MIN = 1; // The value of the smallest number const int MAX = 9; // The value of the largest number //…
Quick solution please