Print Christmas tree Program plan: Import the required package. Create a class “ChristmasTree”, Define the method “main()”, Declare the necessary variables. Create “Scanner” object. Prompt the user to enter the number of segments and height of the Christmas tree. Get the number of segments and height from the user. Print new line. Assign the number of segments and height to the variable “m” and “n” respectively. Set the starting row value to “1”. Create “for” loop to iterate till number of segments using “i”, Create “for” loop to iterate till the height of the tree using “j”, Execute “while” loop, Print space. Increment counter variable. Create loop whenever the number of rows greater than the “i” value, Print space. Create loop whenever the “j” value is less than or equal to “i” value, Print “”. Create loop using the variable “k” whenever the value is less than “i”, Print “”. Print new line. Increment the starting row. Increment the number of rows. Print stem of the tree as follows, Create loop till the value get from dividing the (number of rowsnumber of segments-1) by “2”, Print space. Print “”. Create loop till the value get from dividing the (number of rowsnumber of segments-1) by “2”, Print space. Print “”. Create loop till the value get from subtracting “3” from the value which is obtained from dividing the (number of rowsnumber of segments-1) by “2”, Print the space. Create loop till the value “7”. Print “”.

Question

Want to see the full answer?

Answer 1

Question

Chapter 3, Problem 1PP

Program Plan Intro

Print Christmas tree

Program plan:

Import the required package.

Create a class “ChristmasTree”,

Define the method “main()”,

Declare the necessary variables.

Create “Scanner” object.

Prompt the user to enter the number of segments and height of the Christmas tree.

Get the number of segments and height from the user.

Print new line.

Assign the number of segments and height to the variable “m” and “n” respectively.

Set the starting row value to “1”.

Create “for” loop to iterate till number of segments using “i”,

Create “for” loop to iterate till the height of the tree using “j”,

Execute “while” loop,

Print space.

Increment counter variable.

Create loop whenever the number of rows greater than the “i” value,

Print space.

Create loop whenever the “j” value is less than or equal to “i” value,

Print “”.

Create loop using the variable “k” whenever the value is less than “i”,

Print “”.

Print new line.

Increment the starting row.

Increment the number of rows.

Print stem of the tree as follows,

Create loop till the value get from dividing the (number of rowsnumber of segments-1) by “2”,

Print space.

Print “”.

Create loop till the value get from dividing the (number of rowsnumber of segments-1) by “2”,

Print space.

Print “”.

Create loop till the value get from subtracting “3” from the value which is obtained from dividing the (number of rowsnumber of segments-1) by “2”,

Print the space.

Create loop till the value “7”.

Print “”.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Students have asked these similar questions

D. S. Malik, Data Structures Using C++, 2nd Edition, 2010

Methods (Ch6) - Review 1. (The MyRoot method) Below is a manual implementation of the Math.sqrt() method in Java. There are two methods, method #1 which calculates the square root for positive integers, and method #2, which calculates the square root of positive doubles (also works for integers). public class SquareRoot { public static void main(String[] args) { } // implement a loop of your choice here // Method that calculates the square root of integer variables public static double myRoot(int number) { double root; root=number/2; double root old; do { root old root; root (root_old+number/root_old)/2; } while (Math.abs(root_old-root)>1.8E-6); return root; } // Method that calculates the square root of double variables public static double myRoot(double number) { double root; root number/2; double root_old; do { root old root; root (root_old+number/root_old)/2; while (Math.abs (root_old-root)>1.0E-6); return root; } } Program-it-Yourself: In the main method, create a program that…

I would like to know the main features about the following 3 key concepts:1. Backup Domain Controller (BDC)2. Access Control List (ACL)3. Dynamic Memory