logo Use CA10RAM to get 10%* Discount.
Order Nowlogo
(5/5)

Use static methods with (nested) loops and a class constant, SIZE, to scale the figure. Each print statement should print at most one of the same character (i.e. use loops to get more than a single, or set of, characters to print). Methods and loops should be used to avoid redundancy.

INSTRUCTIONS TO CANDIDATES
ANSWER ALL QUESTIONS

Write a program to print the following robot figure.

Use static methods with (nested) loops and a class constant, SIZE, to scale the figure. Each print statement should print at most one of the same character (i.e. use loops to get more than a single, or set of, characters to print). Methods and loops should be used to avoid redundancy.

Scaling of SIZE will affect both the height and width of the figure, as shown. Your code should be able to scale by factors of two by adjusting the class constant (SIZE = 2, SIZE = 4, SIZE = 6, etc.). robots.txt download Copy and paste your output for sizes 2, 4 and 6 into a text file (.txt).

You can use notepad or word, then add a short reflections report in that file of how this exercise went. Describe what went smoothly, what was difficult. Where did you grow as a programmer? Upload your .java file along with your .txt file to canvas.

Grading criteria 5 pts: Methods used which illustrate overal stucture, 1 pt Nested Loops, 1 pt Avoids Redundancy, 1 pt Accurate Output for each SIZE, 1 pt Reflections Report, 1 pt robots.txt download

HINT: Watch and do the coding from the video Space Shuttle before doing this assingment if you want it to be easier.

(5/5)
Attachments:

Expert's Answer

1180 Times Downloaded

Related Questions

. Introgramming & Unix Fall 2018, CRN 44882, Oakland University Homework Assignment 6 - Using Arrays and Functions in C

DescriptionIn this final assignment, the students will demonstrate their ability to apply two ma

. The standard path finding involves finding the (shortest) path from an origin to a destination, typically on a map. This is an

Path finding involves finding a path from A to B. Typically we want the path to have certain properties,such as being the shortest or to avoid going t

. Develop a program to emulate a purchase transaction at a retail store. This program will have two classes, a LineItem class and a Transaction class. The LineItem class will represent an individual

Develop a program to emulate a purchase transaction at a retail store. Thisprogram will have two classes, a LineItem class and a Transaction class. Th

. SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of Sea Ports. Here are the classes and their instance variables we wish to define:

1 Project 1 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of

. Project 2 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of Sea Ports. Here are the classes and their instance variables we wish to define:

1 Project 2 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of

1180 Times Downloaded

Ask This Question To Be Solved By Our ExpertsGet A+ Grade Solution Guaranteed

expert
Um e HaniScience

510 Answers

Hire Me
expert
Muhammad Ali HaiderFinance

579 Answers

Hire Me
expert
Husnain SaeedComputer science

885 Answers

Hire Me
expert
Atharva PatilComputer science

680 Answers

Hire Me
April
January
February
March
April
May
June
July
August
September
October
November
December
2025
1950
1951
1952
1953
1954
1955
1956
1957
1958
1959
1960
1961
1962
1963
1964
1965
1966
1967
1968
1969
1970
1971
1972
1973
1974
1975
1976
1977
1978
1979
1980
1981
1982
1983
1984
1985
1986
1987
1988
1989
1990
1991
1992
1993
1994
1995
1996
1997
1998
1999
2000
2001
2002
2003
2004
2005
2006
2007
2008
2009
2010
2011
2012
2013
2014
2015
2016
2017
2018
2019
2020
2021
2022
2023
2024
2025
2026
2027
2028
2029
2030
2031
2032
2033
2034
2035
2036
2037
2038
2039
2040
2041
2042
2043
2044
2045
2046
2047
2048
2049
2050
SunMonTueWedThuFriSat
30
31
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
1
2
3
00:00
00:30
01:00
01:30
02:00
02:30
03:00
03:30
04:00
04:30
05:00
05:30
06:00
06:30
07:00
07:30
08:00
08:30
09:00
09:30
10:00
10:30
11:00
11:30
12:00
12:30
13:00
13:30
14:00
14:30
15:00
15:30
16:00
16:30
17:00
17:30
18:00
18:30
19:00
19:30
20:00
20:30
21:00
21:30
22:00
22:30
23:00
23:30