QI- You have three figures: a rectangle, a circle and a square. The length of the rectangle is 20 cm. The square is 16 cm?. You have to calculate and print the total (summation) area of these three figures. 1- Write an algorithm for the above problem using Pseudocode. 2- Draw a flowchart for the above problem. 3- Write a program in C++ for the above problem by using C+ Shell. Execute the program, then, by using handwriting, write the program code, in addition to the inputs and the outputs if you have inputs/outputs.

QI- You have three figures: a rectangle, a circle and a square. The length of the rectangle is 20 cm. The square is 16 cm?. You have to calculate and print the total (summation) area of these three figures. 1- Write an algorithm for the above problem using Pseudocode. 2- Draw a flowchart for the above problem. 3- Write a program in C++ for the above problem by using C+ Shell. Execute the program, then, by using handwriting, write the program code, in addition to the inputs and the outputs if you have inputs/outputs.

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

See similar textbooks

Similar questions

[Fish Tank] You play with a clown fish that has an initial size so. The fish can eat other fish in a tank organized in m columns and n rows. The fish at column i and row j has a positive size si,j. When your fish eats another fish, it grows by that amount. For example, if your clown fish has a size of 10 and eats a fish of size 5, it becomes of size 15. You cannot eat a fish that is bigger than your size. The game starts by eating any fish in the first (left-most) column that is not bigger than yours. After that, you advance one column at a time by moving right. You have only three allowed moves. You either stay at the same row, move one row higher or one row lower. You will always move to the right. Thus, you will make exactly m moves to advance from left to right. Your goal is to exit the fish tank from the right with the biggest possible size. The figure below shows an example with the best answer highlighted. In this case, the final fish size is 71 (10+8+7+24+22). You are required…
Find the error in the following code
Problem Statement: Consider a permutation of numbers from 1 to N written on a paper. Let's denote the product of its element as 'prod' and the sum of its elements as 'sum'. Given a positive integer N, your task is to determine whether 'prod' is divisible by 'sum' or not. Input Format: First input will be an integer T. It depicts a number of test cases. Followed by the value for each test case. Each test case will contain an integer N (1<= N <=10^9). It is nothing but the length of the permutation. Output Format: For each test case, print "YEAH" if 'prod' is divisible by 'sum', otherwise print "NAH".
Exercise III: Catalan numbers For n e N, denote by c, to be the number of ways to form a "mountain range" with n upstrokes (U) and n downstrokes (D) that all stay above a horizontal line. For instance: for n = 1, only UD is allowed, so c = 1; • for n = 2, only UUDD and UDUD are allowed, so c2 = 2. 1. Check that c3 = 5 by writing down or drawing all possible options. 2. Consider the power series +00 g(x) = 2 n=0 (by definition co = 1) called the generating function of the sequence (en). Justify that cn < 4" for each n, and deduce that the radius of convergence of g is at least 1/4. 3. It can be show that for r E (-1/4, 1/4), g(x) = 1+ xg(r)? and therefore 1- VI 4.x g(x) = 2.x Use this formula and the known power series of V1+ x to write the first terms of the power series expansion of g, in the form g(x) = co + c1x + c2x2 + C3x + c4x* + ·.. Show how you obtain a few terms, but you do not need to show all computations and you can use a calculator for fractions. Check that you recover co,…
6.use c code to Develop a code that gets two integers from the user and calculates and prints their least common multiplier or LCM. LCM is the smallest number that divides both given integers. Example. lcm (10, 15) = 30, lcm (5,7) = 35 and lcm (12, 24) = 24Hint: we know that lcm(x,y) = xy/gcd(x,y) where gcd is the greatest common divisor (discussed in class). Develop a gcd function in your code, get the two numbers from the user, call your function to calculate their gcd and then use the formula above to calculate and display their lcm GOOD LUCK! Reference This is a list of function prototypes of the C library functions presented in class. You may use any of these functions in your solutions (unless the requirements explicitly indicate otherwise). As you have been provided the function prototypes, you are expected to use the functions correctly in your solutions. double atof(char *string); int atoi(char *string); long atol(char *string); int fclose(FILE *filePointer); char *fgets(char…
Please help me find the C CODE for this problem. Thank you! 1. "Even" Now by CodeChum Admin I'm really fond of even numbers, you know? That's why I'll be letting you make another even number problem yet again. This time, you need to print from a range of two inputted numbers, n1 and n2 (inclusive), all the even numbers from n2 down to n1, in descending order. Input 1. Value of n1 Description The first integer of the range Constraints The value of n1 is guaranteed to be lesser than or equal to n2. Sample 3 2. Value of n2 Description The second integer of the range Constraints The value of n2 is guaranteed to be greater than or equal to n1. Sample 10 Output The first line will contain a message prompt to input the value of n1. The second line will contain a message prompt to input the value of n2. The next line will contain all the even numbers from n2 down to n1. Enter value of n1: 3 Enter value of n2: 10 10 8 6 4
6. Find the errors from the following code. a. T=[a,b,c] printlh (T) b. for i in 1 to 100 : print (1) c. i=10 while [ib) print (a): else if (a
Problem specification: There is a grid of NXN squares. We can easily determines how many different rectangles (squares are excluded) there are in the grid. For example, in a 3X3 grid, you can find 22 different rectangles, marked as the green rectangles. You can see that we did not count the red ones as they are squares. In this assignment, you will write a Java program that takes the value of N as input and determines the total area of all the rectangles in the grid. Assume that the smallest squares in the grid have length 1. So a 3X2 rectangle will have an area of 6. For example, the total area of all the rectangles in the 3X3 grid is 66.…
This Code print the first occurrences of x, Please Modify the code to print the last occurrences of x and print how many times it exists? ( with explanation for each line if possible) many thanks.
Please code in OOP C++, show example output to see if no errorsCrossword Puzzles An unlabeled crossword is given to you as an N by M grid (3 <= N <= 50, 3 <= M <= 50). Some cells will be clear (typically colored white) and some cells will be blocked (typically colored black). Given this layout, clue numbering is a simple process which follows two logical Steps: Step 1: We determine if a each cell begins a horizontal or vertical clue. If a cell begins a horizontal clue, it must be clear, its neighboring cell to the left must be blocked or outside the crossword grid, and the two cells on its right must be clear (that is, a horizontal clue can only represent a word of 3 or more characters). The rules for a cell beginning a vertical clue are analogous: the cell above must be blocked or outside the grid, and the two cells below must be clear. Step 2: We assign a number to each cell that begins a clue. Cells are assigned numbers sequentially starting with 1 in the same order that…
PYTHON QUESTION : The Syracuse sequence of an integer N is the sequence of integers starting with the term N, where each following term is half of the preceding term if it is even, and one plus three times the preceding term if it is odd. The sequence ends when it reaches the integer 1. The maximum of the Syracuse sequence of an integer N is the highest number reached by this sequence. This maximum can sometimes be very high compared to the starting integer N. What is the maximum of the Syracuse sequence of 3428767? To answer this question it is useful to modify the code given in demonstration which calculates the Syracuse sequence. The code given in the demo : n = 27 print(n) while n != 1: if n%2 == 0: n = n // 2 # where n //= 2 or n >>= 1 else: n = 1 + 3*n print(n)
Program in C++ only: Mahesh is very good at his analytical skills so his teacher Ramanujan wants to test his skills so he gives him a condition let's consider a rectangular R table containing N rows and M columns. Rows are numbered 1 to N from top to bottom. Columns are calculated from 1 to M from left to right. Each element of R is a non-negative number. R is pronounced steadily if the total number of elements in the ith line is not less and then the total number of elements in the i-line (1) th for each i lapho is 2 Kanye N and the total element in the Nth line is less than or equal to M. Your job is to find the number of fixed tables of different sizes N x M modulo 1 000 000 000 000. Input: 1 11 Output: 2