Print square using “” Program plan: Import the necessary package. Create a class “StarSquare.java” file, Define the function “main()”, Declare and initialize the necessary variables. Create Scanner object to get the user input. Get the side of the square from the user using “next()”. Check whether the side length of the square is valid using “if” statement, Subtract 2 from the value of the size of the square. Execute “while” loop to print the top row with “”. Execute next “while” loop to print remaining rows with first “” and expected number of spaces and then the last “”. Execute another “while” loop to print the last row with complete “*”. Otherwise, print the invalid message.

Question

Want to see the full answer?

Answer 1

Question

Chapter 4, Problem 21.1E

Program Plan Intro

**Print square using “*”

Program plan:**

Import the necessary package.

Create a class “StarSquare.java” file,

Define the function “main()”,

Declare and initialize the necessary variables.

Create Scanner object to get the user input.

Get the side of the square from the user using “next()”.

Check whether the side length of the square is valid using “if” statement,

Subtract 2 from the value of the size of the square.

Execute “while” loop to print the top row with “”.

Execute next “while” loop to print remaining rows with first “” and expected number of spaces and then the last “”.

Execute another “while” loop to print the last row with complete “”.

Otherwise, print the invalid message.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Students have asked these similar questions

The Horse table has the following columns: ID - integer, auto increment, primary key RegisteredName - variable-length string Breed - variable-length string Height - decimal number BirthDate - date Delete the following rows: Horse with ID 5 All horses with breed Holsteiner or Paint All horses born before March 13, 2013 To confirm that the deletes are correct, add the SELECT * FROM HORSE; statement.

Why is Linux popular? What would make someone choose a Linux OS over others? What makes a server? How is a server different from a workstation? What considerations do you have to keep in mind when choosing between physical, hybrid, or virtual server and what are the reasons to choose a virtual installation over the other options?

Objective you will: 1. Implement a Binary Search Tree (BST) from scratch, including the Big Five (Rule of Five) 2. Implement the TreeSort algorithm using a in-order traversal to store sorted elements in a vector. 3. Compare the performance of TreeSort with C++'s std::sort on large datasets. Part 1: Understanding TreeSort How TreeSort Works TreeSort is a comparison-based sorting algorithm that leverages a Binary Search Tree (BST): 1. Insert all elements into a BST (logically sorting them). 2. Traverse the BST in-order to extract elements in sorted order. 3. Store the sorted elements in a vector. Time Complexity Operation Average Case Worst Case (Unbalanced Tree)Insertion 0(1log n) 0 (n)Traversal (Pre-order) 0(n) 0 (n)Overall Complexity 0(n log n) 0(n^2) (degenerated tree) Note: To improve performance, you could use a…