Vrite a program named stars.py that has two functions for generating star polygons. One function should be implemented using an iteration (a for loop), and nother function should be a recursion. It is optional to fill in your shapes. he functions for generating stars should be named star (size, n, d=2) and star_recursive (size, n, level, d=2), where size is the size of the polygon side edge), n is the number of sides (or angles), d is a density or winding number that should be set to default value 2, and level is the level of recursion initially qual to n

Vrite a program named stars.py that has two functions for generating star polygons. One function should be implemented using an iteration (a for loop), and nother function should be a recursion. It is optional to fill in your shapes. he functions for generating stars should be named star (size, n, d=2) and star_recursive (size, n, level, d=2), where size is the size of the polygon side edge), n is the number of sides (or angles), d is a density or winding number that should be set to default value 2, and level is the level of recursion initially qual to n

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter15: Recursion

Section: Chapter Questions

Problem 6PE

See similar textbooks

Similar questions

Write a program that allows a user to enter non-negative int number. The recursive function is to be named sumSquares that returns the sum of the squares of the numbers from 0 to number.Do not use any global variables.
Write a program called Recursive_fibonacci.java that implements a recursive function for computing the nth term of a Fibonacci Sequence. In the main method of your program accept the value of n from the user as a command-line argument and then call your function named Fibonacci with this value. The output should look exactly like what is pictured below.
please code in python Write a recursive function to add a positive integer b to another number a, add(a, b), where only the unit 1 can be added, For example add(5, 9) will return 14. The pseudocode is: # Base case: if b is 1, you can just return a + 1 # General case: otherwise, return the sum of 1 and what is returned by adding a and b - 1.
This is for Java Write a recursive function that takes as a parameter a nonnegative integerand generates the following pattern of stars. If the nonnegative integer is 4,then the pattern generated is:**********Also, write a program that prompts the user to enter the number of lines inthe pattern and uses the recursive function to generate the pattern. Forexample, specifying 4 as the number of lines generates the above pattern. Java please
Write a program called Super_Digit.java with a recursive function called superDigit. The function must return the calculated super digit as an integer. If 'x' has only 1 digit, then its super digit is 'x' Otherwise, the super digit of 'x' is equal to the super digit of the sum of the digits of 'x' Hint: use a combination of n%10 and n/10 The output should look like what is given below. Please give an editable code.
Write a Recursive Python program named getValue, which will be given (as argument) a student name and a list of student names and their marks (as shown in format given below). The function should return marks of the given student. If the student name does not exist in the list then the function should return None. Sample calls have been given below. >>> getValue('Asif',[('Kashif', 10),('Asif',20),('Fahad',30),('Tariq',15)])20>>> getValue('Fahad',[('Kashif', 10),('Asif',20),('Fahad',30),('Tariq',15)])30>>> getValue('Noman',[('Kashif', 10),('Asif',20),('Fahad',30),('Tariq',15)])None
A recursive function is a function defined in terms of itself via self-referential expressions. This means that the function will continue to call itself and repeat its behavior until some condition is met to return a result. Write a complete python program that includes a recursive python method, sumThem which accepts an argument, n, sums all the odd, or all the even, positive integers up to n*3, depending on whether n*3 is odd or even. The number should be entered by the user You should include in your answer a screenshot that shows the program and the output for the value n*3 where n must be equal your last ID digit. For example, if your ID is 201314151617, then 7 will be entered, and the calculations should be applied to 21. Expected Output Sample: Enter the number: 0 The sum of even numbers up to 0 will be: 0
Write a program that draws a square fractal. Fractals are images that keep repeating their own image in ever-smaller versions. There exists numerous fractals and some fractals rely on computation of advanced mathematics. All fractals have a recursive quality and provide an ideal platform for practicing recursive concepts. You will note that from the four corners of the center rectangle, smaller rectangles are drawn and each rectangle in turn continues to draw three smaller rectangles until the rectangle is the size of one pixel. A CODE TEMPLATE & PICTURE OF OUTPUT IS ALREADY PROVIDED IN THE ATTACHED PICTURES Method drawSquare1 gets the ball rolling and draws a solid rectangle in the center of the screen. The initial rectangle needs to be 1/4 the size of the monitor. This explains why it is important to know the screen resolution and why this information is passed by parameter. Method drawSquare1 needs to make four method calls to draw each one of the four rectangles attached to…
Write a program that draws a square fractal. Fractals are images that keep repeating their own image in ever-smaller versions. There exists numerous fractals and some fractals rely on computation of advanced mathematics. All fractals have a recursive quality and provide an ideal platform for practicing recursive concepts. You will note that from the four corners of the center rectangle, smaller rectangles are drawn and each rectangle in turn continues to draw three smaller rectangles until the rectangle is the size of one pixel.
An arithmetic sequence is a sequence of values where successive values have a common difference. For example, 2,5,8,11,... is an arithmetic sequence starting at 2 with a common difference of 3. We call the starting point s and the difference d. Fill in the missing lines below to write a recursive Python function called arithmetic that takes values for s, d, and n, and returns the nth term of the arithmetic sequence. For example, given the main function: def main(): for i in range(1,6): print(arithmetic(2,3,i)) the output will be: 2 5 8 11 14 Note: No marks will be given for a non-recursive solution. Code with missing lines: # Line 1 # Line 2 # Line 3 # Line 4 # Line 5 Matching each line of code below to its proper line number (Line 1 to Line 5), indicated in the partial code above, to solve the problem. Some lines of code will not be used at all; for these you would select option 6 (i.e., Not Used) from the list of options - do not leave these blank. Question 8 options:…
The Polish mathematician Wacław Sierpiński described the pattern in 1915, but it has appeared in Italian art since the 13th century. Though the Sierpinski triangle looks complex, it can be generated with a short recursive function. Your main task is to write a recursive function sierpinski() that plots a Sierpinski triangle of order n to standard drawing. Think recursively: sierpinski() should draw one filled equilateral triangle (pointed downwards) and then call itself recursively three times (with an appropriate stopping condition). It should draw 1 filled triangle for n = 1; 4 filled triangles for n = 2; and 13 filled triangles for n = 3; and so forth. API specification. When writing your program, exercise modular design by organizing it into four functions, as specified in the following API: public class Sierpinski { // Height of an equilateral triangle whose sides are of the specified length. public static double height(double length) // Draws a filled equilateral…
Consider a network of streets laid out in a rectangular grid, In a northeast path from one point in the grid to another, one may walk only to the north (up) and to the east (right). Write a program that must use a recursive function to count the number of northeast paths from one point to another in a rectangular grid. Your program should prompt the user to input the numbers of points to the north and to east respectively, and then output the total number of paths. Notes: 1. Here is a file (timer.h download and timer.cpp download) which should be included in your program to measure time in Window or Unix (includes Mac OS and Linux) systems (use start() for the beginning of the algorithm, stop() for the ending, and show() for printing). 2. The computing times of this algorithm is very high, and the number of paths may be overflow, don't try input numbers even over 16. 3. Name your recursive function prototype as calcPath(int north, int east) to ease grading. 4. Paste your output