*4.5 (Geometry: area of a regular polygon) A regular polygon is an n- sided polygon in which all sides are of the same length and all angles have the same degree (i.e., the polygon is both equilateral and equiangular). The formula for computing the area of a regular polygon is Area = nxs² 4×tan (¹) Here, s is the length of a side. Write a program that prompts the user to enter the number of sides and their length of a regular polygon and displays its area. ||

*4.5 (Geometry: area of a regular polygon) A regular polygon is an n- sided polygon in which all sides are of the same length and all angles have the same degree (i.e., the polygon is both equilateral and equiangular). The formula for computing the area of a regular polygon is Area = nxs² 4×tan (¹) Here, s is the length of a side. Write a program that prompts the user to enter the number of sides and their length of a regular polygon and displays its area. ||

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

11.25 (Python please) (Markov matrix) An n * n matrix is called a positive Markov matrix if each element is positive and the sum of the elements in each column is 1. Write the following function to check whether a matrix is a Markov matrix: def isMarkovMatrix(m): Write a test program that prompts the user to enter a 3 * 3 matrix of numbers and tests whether it is a Markov matrix. Here are sample runs:
6.23 LAB: Leap year - functions A year in the modern Gregorian Calendar consists of 365 days. In reality, the earth takes longer to rotate around the sun. To account for the difference in time, every 4 years, a leap year takes place. A leap year is when a year has 366 days: An extra day, February 29th. The requirements for a given year to be a leap year are: 1) The year must be divisible by 4 2) If the year is a century year (1700, 1800, etc.), the year must be evenly divisible by 400 Some example leap years are 1600, 1712, and 2016. Write a program that takes in a year and determines whether that year is a leap year. Ex: If the input is: 1712 the output is: 1712 is a leap year. Ex: If the input is: 1913 the output is: 1913 is not a leap year. Your program must define and call the following function. The function should return True if the input year is a leap year or False otherwise.def is_leap_year(user_year) Use Python, please.
issignment Portion - hand in your wo nce completed "4.2 (Geometry: gneat circle distance) The great circle distance is the distance between two points on the surface of a sphere. Let(x1,y1)and(x2,y2)be the geographical latitude and longitude of two points. The great circle distance between the two points can be computed using the following formula: \[ d=\operatorname{radius} \times \arccos \left(\sin \left(x_{1}\right) \times \sin \left(x_{2}\right)+\cos \left(x_{1}\right) \times \cos \left(x_{2}\right) \times \cos \left(y_{1}-y_{2}\right)\right) \] Write a program that prompts the user to enter the latitude and longitode of two points on the earth in degrees and displays its great circle distance. The average radius of the earth is6,371.01 km. Note you need to convert the degrees into radians using the Math, toRadi ans method since the Java trigonometric methods use radians. The latitude and longitude degrees in the formula are for north and west. Use negative to indicate south and…
6.19 LAB: Leap year - functions A common year in the modern Gregorian Calendar consists of 365 days. In reality, Earth takes longer to rotate around the sun. To account for the difference in time, every 4 years, a leap year takes place. A leap year is when a year has 366 days. An extra day, February 29th. The requirements for a given year to be a leap year are 1) The year must be divisible by 4 2) If the year is a century year (1700, 1800, etc.), the year must be evenly divisible by 400, therefore, both 1700 and 1800 are not leap years Some example leap years are 1600, 1712, and 2016. Write a program that takes in a year and determines the number of days in February for that year Ex. If the input is 1712 the output is 1712 has 29 days in February. Ex If the input is 1913 the output is 1913 has 28 days in February. Your program must define and call the following function. The function should return the number of days in February for the input year. def days in feb(user_year)
5.28 LAB: Matrix multiplication (JAVA) A matrix is a rectangle of numbers in rows and columns. A 1xN matrix has one row and N columns. An NxN matrix has N rows and N columns. Multiplying a 1xN matrix A and an NxN matrix B produces a 1xN matrix C. To determine the Nth element of C multiply each element of A by each element of the Nth column of B and sum the results. Helpful information can be found at matrix multiplication. Write a program in java that reads a 1xN matrix A and an NxN matrix B from input and outputs the 1xN matrix product, C. The first integer input is N, followed by one row of N integers for matrix A and then N rows of N integers for matrix B. N can be of any size >= 2. For coding simplicity, follow each output integer by a space, even the last one. The output ends with a newline. Ex: If the input is: 2 2 3 1 2 3 4 A contains 2 and 3, the first row of B contains 1 and 2, and the second row of B contains 3 and 4. The first element of C is (2 * 1) + (3 * 3), and…
5.15 LAB: Hacking Ciphers The Caesar Cipher Algorithm was introduced in Week #1. Encryption is the act of encoding a message with the intent of allowing only authorized people the knowledge of how to read that message. An encrypted message can be decoded, allowing the secured content to be read after decryption. Recall that the Caesar Cipher uses alphabets as the primary source of information but shifted a certain number of letters to the left or right as a key to create the encrypted data. The Caesar Cipher is easily hacked because of the simple technique used to build the key that encrypts and decrypts the data. In this lab, the key is the number of alphabets shifted, and the direction is always toward the increasing alphabetical order. This provides 26 ways of encrypting a message and therefore makes it easier to be hacked by guessing the key within the range of 0 - 25. Write the function caesar_hack( ) that takes three parameters: a Caesar Cipher encrypted message, an alphabet…
17.37 PRACTICE: Vectors**: Longest sequence C++ A common statistic of interest is the longest sequence of some pattern in a list of items. For example, in football, one may be interested in the longest sequence of consecutive complete passes. Given a list in which each item is either the letter "I" (for an incomplete pass) or a number (for a completed pass), output the length of the longest sequence of complete passes. The list is preceded by the number of items. Given 8 4 15 9 I 30 2 I 20, the output is 3 (because the longest sequence of complete passes is 4 15 9). Hints: Use two variables, one that keeps track of the current sequence length, and another for the longest sequence length. In a for loop that iterates through the vector, if you see an "I", set the current sequence length to 0. Otherwise, you are in sequence (either at the beginning or later in the sequence), so increment the current sequence length. A simple way to compute the longest sequence is to…
17.37 PRACTICE: Vectors**: Longest sequence C++ A common statistic of interest is the longest sequence of some pattern in a list of items. For example, in football, one may be interested in the longest sequence of consecutive complete passes. Given a list in which each item is either the letter "I" (for an incomplete pass) or a number (for a completed pass), output the length of the longest sequence of complete passes. The list is preceded by the number of items. Given 8 4 15 9 I 30 2 I 20, the output is 3 (because the longest sequence of complete passes is 4 15 9). Hints: Use two variables, one that keeps track of the current sequence length, and another for the longest sequence length. In a for loop that iterates through the vector, if you see an "I", set the current sequence length to 0. Otherwise, you are in sequence (either at the beginning or later in the sequence), so increment the current sequence length. A simple way to compute the longest sequence is to…
1.13 LAB: Introduction to Cyptography (classes/constructors) Cryptography is the practice of encryption. Information Security uses cryptography techniques to encrypt and decrypt data. A simple encryption method might take plaintext and mix up the letters using some predetermined pattern and then use that pattern to decrypt the data for reading. Ciphers are the algorithms used to put the data into its secret pattern and then systematically decrypt it for reading. This script is going to use a famous simple cipher called the Caesar Cipher. It is a substitution cipher where each letter in the text is 'shifted' in a certain number of places. It uses the alphabet as the primary pattern and then based on the shift number, it would shift all the letters and replace the alphabet with our pattern. For example, if our shift number was 3, then A would be replaced with D, if we performed a right shift. As an example: Text = "THE CAT IS VISIBLE AT MIDNIGHT" Ciphertext = "WKH FDW LV YLVLEOH DW…
5.16 LAB: Cryptographic Hashing Algorithms Encryption methods, such as the Caesar Cipher encryption, allow us to encrypt and decrypt text using a special key. Another method of encrypting text / passwords is called hashing. Hashing uses special algorithms to 'scramble' the text, which is tougher to be hacked. The hash function can take numbers, letters, and symbols as input, then the function applies one of the special algorithms to output the scrambled text. The longer the output string is, the harder to hack the hashed data. The difference between hashing and the Caesar Cipher encryption is that one cannot 'decrypt' a hashed data to its original text. Since a hashed data cannot be decrypted, a user must enter the original text, which will be hashed by the program. Then the program compares the hashed value with the hashed data stored previously for the original text. A salt is used, at times, to create a random sequence that is added to the original text before using the hashing…
19.16 LAB: Area of a triangle Using Heron's formula, you can calculate the area of a triangle if you know the lengths of all three sides. Given the length of each side of a triangle as input, calculate the area of the triangle using Heron's formula as follows: s = half of the triangle's perimeter area = the square root of s*(s-a)*(s-b)*(s-c), where a, b, and c are each sides of the triangle. Hint: Use the math function sqrt() for calculating the square root. Output the floating-point value of the area with two digits after the decimal point using the following statement once before all other cout statements:cout << fixed << setprecision(2); Ex: If the input for a, b, and c is: 3.0 4.0 5.0 the output is: Triangle area = 6.00 #include <iostream>#include <iomanip>#include <cmath>using namespace std; int main() { /* Type your code here. */ return 0;}
6.28 LAB: Check if array is sorted Use java Programming Write the inOrder() method, which has an array of integers as a parameter, and returns true if the numbers are sorted (in order from low to high) or false otherwise. The program outputs "In order" if the array is sorted, or "Not in order" if the array is not sorted. Ex: If the array passed to the inOrder() method is [5, 6, 7, 8, 3], then the method returns false and the program outputs: Not in order Ex: If the array passed to the inOrder() method is [5, 6, 7, 8 , 10], then the method returns true and the program outputs: In order public class LabProgram {public static boolean inOrder(int [] nums) {/* Type your code here. */ }public static void main(String[] args) {// Test out-of-order example.int [] nums1 = {5, 6, 7, 8, 3};if(inOrder(nums1)){System.out.println("In order");}else{System.out.println("Not in order");}// Test in-order example.int [] nums2 = {5, 6, 7, 8, 10};if(inOrder(nums2)){System.out.println("In…