Here is a Snap script. for i 1 to 4 pen down N -gon size (L pen up change x by 200 The user-defined block (N)-gon size (L) draws a polygon with N sides, whose side length is L. You want this script to draw a row of five shapes: 1. a triangle (3 sides) of side length 150, 2. a pentagon (5 sides) of side length 135, 3. a septagon (7 sides) of side length 120, 4. a nonagon (9 sides) of side length 105. In terms of i, what expressions should be put in place of N and L?

Here is a Snap script. for i 1 to 4 pen down N -gon size (L pen up change x by 200 The user-defined block (N)-gon size (L) draws a polygon with N sides, whose side length is L. You want this script to draw a row of five shapes: 1. a triangle (3 sides) of side length 150, 2. a pentagon (5 sides) of side length 135, 3. a septagon (7 sides) of side length 120, 4. a nonagon (9 sides) of side length 105. In terms of i, what expressions should be put in place of N and L?

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 24PE

See similar textbooks

Similar questions

Write a program to Validate an IPv4 Address. According to Wikipedia, IPv4 addresses are canonically represented in dot-decimal notation, which consists of four decimal numbers, each ranging from 0 to 255, separated by dots, e.g., 172.16.254.1 . The generalized form of an IPv4 address is (0-255).(0-255).(0-255).(0-255). Here we are considering numbers only from 0 to 255 and any additional leading zeroes will be considered invalid. Your task is to complete the function isValid which returns 1, if the ip address is valid else returns 0. The function takes a string s as its only argument . **************************************************************************/ // SOLUTION (in C++): #include <bits/stdc++.h> using namespace std; int isValid(string s) { s += '.'; int countDots = 0; string str = ""; for (int i = 0; i < s.length(); i++) {…
Write a shell script program that uses * to print the entire pyramid (shown below). Toprint the left and right parts of the pattern, use nested loops. * * * * * * * * * * * * * * * * * * * * * * * * *
Create a program that plots N evenly spread dots of size using an integer N and a double value p (between 0 and 1) as command-line arguments.05 on the circumference of a circle, and then creates a gray line that connects each set of points with a probability of p.
Write a script that will accept the sides of a triangle, let them be “a”, “b”, “c”. Based on these variable values determine if the triangle is right angled or not, by using Pythagoras theorem.Hint: if c2 = a2 + b2 then the given sides are right angled triangle else not a right-angled triangle.
Write a program that, given an integer N and a double value p (between 0 and 1) as command-line arguments, plots N evenly spread dots of size.05 on the circumference of a circle, and then draws a gray line connecting each set of spots with probability p.
Unix Write down the extended regular expression for following questions.E.g. Social security number in the format of 999-99-9999.Answer: [0-9]{3}-[0-9]{2}-[0-9]{4} 1) Valid URL beginning with “http://” and ending with ".edu" (e.g.http://cs.gsu.edu , http://gsu.edu ) 2) Non-negative integers. (e.g. 0, +1, 3320) 3) A valid absolute pathname in Unix (e.g. /home/ylong4, /test/try.c) 4) Identifiers which can be between 1 and 10 character long, muststarting with a letter or an underscore. The following characters can beletters or underscores or digits. (e.g. number, _name1, isOK). 5) Phone number in any of the following format: 9999999999,999-9999999, (999)-999-9999. (Note: all of these formats should bematched by a single regular expression)
Write a program in python Suppose that the following 40-letter alphabet is used for all plaintexts and ciphertexts: A--Z with numerical equivalents 0--25, blank=26, .=27, ?=28, $=29, the numerals 0--9 with numerical equivalents 30--39. Suppose that plaintext message units are digraphs and ciphertext message units are trigraphs (i.e., k=2, l (ell)=3, 40^2 < n_{A} < 40^3 for all n_{A}). (a) Send the message "SEND $7500" to a user whose enciphering key is (n,b)=(2047,179). (b) Break the code by factoring n and then computing the deciphering key (n,a)
You are given a grid of size n ×m and within that grid there is a horizontal rod (arbitrary widthbut height of 1). You aim is to locate it. The only thing you can use to find the location of the rod is makequeries of the form IsPresent (x1, y1, x2, y2) where x1 ≤x2, y1 ≤y2. This returns True if part of the rod ispresent in the grid from (x1, y1) to (x2, y2) and False if not. See figures below. Design an algorithm whichuses queries O(log(n +m)) times to find the location of the rod, i.e., the leftmost coordinates and rightmostcoordinates. Hint: consider using binary search in your algorithm.
Another question, I suppose to draw a snowflake using this function, but everytime I get to the "whole" part when I put part 1,2,3 together, python tells me that I'm getting Syntax errors. def snowflake(): part1 = kochize(5) part2 = rotate(2*(pi/3))(kochize(5)) part3 = rotate((-2*(pi/3))(kochize(5)) whole = connect_ends((part1, part2), part3) return whole I don't understand why am I getting syntax errors with line5 of this function.
Write a program Minesweeper.java that takes three integer command-line arguments m, n, and k and prints an m-by-n grid of cells with k mines, using asterisks for mines and integers for the neighboring mine counts (with two space characters between each cell). To do so, Generate an m-by-n grid of cells, with exactly k of the mn cells containing mines, uniformly at random. For each cell not containing a mine, count the number of neighboring mines (above, below, left, right, or diagonal)
Suppose you’re consulting for a bank that’s concerned about fraud detection, and they come to youwith the following problem. They have a collection of n bank cards that they’ve confiscated, suspectingthem of being used in fraud. Each bank card is a small plastic object, containing a magnetic stripe withsome encrypted data, and it corresponds to a unique account in the bank. Each account can have manybank cards corresponding to it, and we’ll say that two bank cards are equivalent if they correspond to thesame account.It’s very difficult to read the account number off a bank card directly, but the bank has a high-tech “equivalence tester” that takes two bank cards and, after performing some computations, determines whether theyare equivalent.Their question is the following: among the collection of n cards, is there a set of more than n/2 of themthat are all equivalent to one another? Assume that the only feasible operations you can do with the cardsare to pick two of them and plug them…
Question in the picture def fonction(): ht2 = int(mc1) for i in range(ht2): z = 2 * gk1 +i mc1=5.4ht2=0for u in range(10): ht2 +=1fonction()