Explanation of Solution
The corrected program is given below with errors and corrections explained in the in-lined comments:
#include <iostream>
#include <iomanip>
using namespace std;
int main()
{
//declare double pointer variables
double *baseRadius;
double *height;
//set the print output format
cout << fixed << showpoint << setprecision(2);
//allocate memory of type double and store the
//address of the allocated memory in baseRadius
baseRadius = new double;
//store 1.5 in the allocated memory
*baseRadius = 1.5;
//allocate memory of type double and store the
//address of the allocated memory in height
height = new double;
//store the value of the RHS expression in the allocated memory
//RHS = 2 &*#x00A0;(1.5) = 3.0
*height = 2 &*#x00A0;(*baseRadius);
//allocate fresh memory of type double and store the
//address of the allocated memory in baseRadius
//the earlier address referred to by baseRadius now
//becomes a case of leaked memory
//so it is essential to first deallocate the memory
//using delete operator
delete baseRadius;
baseRadius = new double;
//store 4.0 in the allocated memory
*baseRadius = 4.0;
//the code prints the address stored in baseRadius
//instead of the actual radius of the base
///cout << "Radius of the base: " << baseRadius << endl;
//so the correct code is
cout << "Radius of the base: " << *baseRadius << endl;
�...
Want to see the full answer?
Check out a sample textbook solutionChapter 12 Solutions
C++ Programming: From Problem Analysis to Program Design
- Write the following function to draw a regular polygon:def drawPolygon(x = 0, y = 0, radius = 50, numberOfSides = 3):The polygon is centered at (x, y) with a specified radius for the bounding circle for the polygon and the number of sides. Write a test program that displays a triangle, square, pentagon, hexagon, heptagon, and octagon, as shown in Figure 6.12a.arrow_forwardCorrect answer only. Code and output screenshot. Nastia has 2 positive integers An and B. She characterizes that: The integer is acceptable in case it is detachable by A⋅B; In any case, the integer is almost acceptable, in case it is detachable by A. For instance, if A=6 and B=4, the integers 24 and 72 are acceptable, the integers 6, 660 and 12 are almost acceptable, the integers 16, 7 are neither acceptable nor almost great. Discover 3 unique positive integers x, y, and z to such an extent that precisely one of them is acceptable and the other 2 are almost acceptable, and x+y=z. Input The main line contains a solitary integer t (1≤t≤10000) — the number of experiments. The primary line of each experiment contains two integers An and B (1≤A≤106, 1≤B≤106) — numbers that Nastia has. Output For each experiment print: "Indeed" and 3 distinct positive integers x, y, and z (1≤x,y,z≤1018) to such an extent that precisely one of them is acceptable and the other 2…arrow_forwardWrite code that iterates while userNum is less than 12. Each iteration: Put userNum to output. Then, put "/" to output. Then, assign userNum with userNum multiplied by 3.arrow_forward
- Write a code to this usingarrow_forwardAnalyze the following code. int x = 13B while (0 < x) && (x < 100) System.out .printin(x++); The numbers 2 to 100 are displayed. The code does not compile because the loop body is not in the braces. O The loop runs forever. The code does not compile because (0 < x) && (x < 100) is not enclosed in a pair of parentheses. The numbers 1 to 99 are displayed.arrow_forward#5.Incorrect gurantee downvote. Euler's totient function, also known as phi-function ϕ(n),counts the number of integers between 1 and n inclusive,which are coprime to n.(Two numbers are coprime if their greatest common divisor (GCD) equals 1)."""def euler_totient(n): """Euler's totient function or Phi function. Time Complexity: O(sqrt(n)).""" result = n for i in range(2, int(n ** 0.5) + 1): if n % i == 0: while n % i == 0: n //= i.arrow_forward
- Consider this code: "int s = 20; int t = s++ + --s;". What are the values of s and t? A. s is 19 and t is 38 B. s is 20 and t is 38 C. s is 20 and t cannot be determined D. s is 19 and t is 39 E. s is 20 and t is 39arrow_forwardWrite code that outputs variable numItems.arrow_forwardExercise 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,…arrow_forward
- C++ Programming: From Problem Analysis to Program...Computer ScienceISBN:9781337102087Author:D. S. MalikPublisher:Cengage LearningMicrosoft Visual C#Computer ScienceISBN:9781337102100Author:Joyce, Farrell.Publisher:Cengage Learning,