A regular polygon has n number of sides with each side of length s. The area of a regular polygon is given by: ns? A = 4tan () The perimeter of a polygon is equal to the length of the boundary of the polygon Write a program called calc_polygon that takes two arguments, n and s. This program should output the area and the perimeter of a given regular polygon rounded-off to four decimal places.

A regular polygon has n number of sides with each side of length s. The area of a regular polygon is given by: ns? A = 4tan () The perimeter of a polygon is equal to the length of the boundary of the polygon Write a program called calc_polygon that takes two arguments, n and s. This program should output the area and the perimeter of a given regular polygon rounded-off to four decimal places.

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter8: Arrays And Strings

Section: Chapter Questions

Problem 20PE

See similar textbooks

Similar questions

Suppose that the first number of a sequence is x, where x is a non-zero positive integer. We define the following sequence: a0 = x, an+1 = an/2 if an is even, and an+1 = 3 ∗ an + 1 if an is odd. In such a sequence, there exists an integer k such that ak = 1. Write a program sequence.cc that prompts the user to enter the value of x, the program outputs the integer k such that ak = 1, the numbers a0, a1, a2, . . . , ak, the largest number of the sequence a0, a1, a2, . . . , ak, and the position of the largest number in the sequence. For example, if x = 75, then k = 14, the numbers a0, a1, a2, . . . , a14, respectively, are 75, 226, 113, 340, 170, 85, 256, 128, 64, 32, 16, 8, 4, 2, 1, the largest is 340, at position 3. Your program should prompt the user to run it repeatedly until she/he wants to quite. Please use break and continue statements. And loop and while statement! make sure k is identified in the output and don't use arrays for the program. thank you very much!!
Given a square matrix with the elements 0 or 1, write a program tofind a maximum square submatrix whose elements are all 1s. Your programshouldprompt the user to enter the number of rows in the matrix. The program then displaysthe location of the first element in the maximum square submatrix and thenumber of rows in the submatrix. Here is a sample run: Enter the number of rows in the matrix: 5 ↵EnterEnter the matrix row by row:1 0 1 0 1 ↵Enter1 1 1 0 1 ↵Enter1 0 1 1 1 ↵Enter1 0 1 1 1 ↵Enter1 0 1 1 1 ↵EnterThe maximum square submatrix is at (2, 2) with size 3 Your program should implement and use the following method to find the maximumsquare submatrix:public static int[] findLargestBlock(int[][] m)The return value is an array that consists of three values. The first two values arethe row and column indices for the first element in the submatrix, and the thirdvalue is the number of the rows in the submatrix.
A Fibonacci sequence is a sequence of numbers where each successivenumber is the sum of the previous two. The classic Fibonacci sequencebegins: 1, 1, 2, 3, 5, 8, 13, .... Write a program that computes the nthFibonacci number where n is a value input by the user. For example, ifn = 6, then the result is 8.
The Research team led by Bernadette Wolowitz at Cal-tech University has discovered a new Amoeba that grows in the order of a Fibonacci series every month. They are exhibiting this amoeba in a national. conference. They want to know the size of the amoeba at a particular time instant. If a particular month's index is given, write a program to display the amoeba's size. For Example, the size of the amoeba on month 1, 2, 3, 4, 5, 6,... will be 0, 1, 1, 2, 3, 5, 8.... respectively.
2. In this problem, you will write different programs to x n , where x ∈ R, n ∈ N. a) Devise an iterative algorithm to compute x n using only multiplications.
The code below is given a sequence of positive integers to find the longest increasing and the longest decreasing subsequence of the sequence. write the algorithm for the python code below. def prints(arr): for x in arr: print(x, end=" ") print() def constructPrintLDS(arr, n): l = [[] for i in range(n)] l[0].append(arr[0]) for i in range(1, n): for j in range(i): if arr[i] < arr[j] and (len(l[i]) < len(l[j]) + 1): l[i] = l[j].copy() l[i].append(arr[i]) maxx = l[0] for x in l: if len(x) > len(maxx): maxx = x prints(maxx) def constructPrintLIS(arr, n): l = [[] for i in range(n)] l[0].append(arr[0]) for i in range(1, n): for j in range(i): if arr[i] > arr[j] and (len(l[i]) < len (l[j]) + 1): l[i] = l[j].copy() l[i].append(arr[i]) maxx = l[0]…
Write a NumPy program to count the number of days of a given month for the given years import numpy as npprint("Number of days, February, 2020: ")print() #TO DO -- Complete the Codeprint("Number of days, February, 2021: ")print() #TO DO -- Complete the Codeprint("Number of days, February, 2022: ")print() #TO DO -- Complete the Code
Write a program that randomly generates an integer between 1and 12 and displays the English month names January, February, . . . , Decemberfor the numbers 1, 2, . . . , 12, accordingly.
Write a program that invites the user to enter two numbers: a dividend (the top number in a division) and a divisor (the bottom number). It then calculates quotient and remainder using / and % operator and displays the result. After one iteration it asks user whether he/she wants to do more (Y/N). (C++ show input and output as well)
A right triangle can have sides that are all integers. The set of three integer values for the sides of a right triangle is called a Pythagorean triple. These three sides must satisfy the relationship that the sum of the squares of two of the sides is equal to the square of the hypotenuse. Write a program to find all Pythagorean triples for side1, side2, and the hypotenuse all no larger than 30. Use a triple-nested for loop that simply tries all possibilities. Using Files in c programming language and comment all your steps please
] In a triangle, the sum of the lengths of any two sides is greater than the lengthof the other third side. Write a program triangle.cc that prompts a user to enterthe lengths of three sides, checks if they form a triangle, and outputs if it is an isosceles,equilateral, scalene, or right triangle. Also, your program should output the perimeter andthe area of the triangle. In a right triangle, the square of the length of one side is equalto the sum of the squares of the lengths of the other two sides. An isosceles triangle hastwo sides of equal length. An equilateral triangle has all three sides with the same length.A scalene triangle has no equal sides. Your program should define and use the followingfunctions:(a) isTriangle - takes the 3 sides of a triangle and returns true if they form a triangle,false otherwise.(b) isIsosceles - takes the 3 sides of a triangle and returns true if they form anisosceles triangle, false otherwise.(c) isEquilateral - takes the 3 sides of a triangle and…
(This is a version of Programming Project 2.1 from Chapter 2.) The Babylonianalgorithm to compute the square root of a positive number n is as follows:1. Make a guess at the answer (you can pick n/2 as your initial guess).2. Compute r = n / guess.3. Set guess = (guess +r) / 2.4. Go back to step 2 until the last two guess values are within 1% of each other. Write a program that inputs a double for n, iterates through the Babylonian algo-rithm until the guess is within 1% of the previous guess and outputs the answer as a double to two decimal places. Your answer should be accurate even for largevalues of n.