Java Programming, Loose-Leaf Version
Java Programming, Loose-Leaf Version
9th Edition
ISBN: 9781337685900
Author: FARRELL, Joyce
Publisher: Cengage Learning
Expert Solution & Answer
Book Icon
Chapter 3, Problem 2GZ

Explanation of Solution

Program code:

MyCharacter.java

//define a class MyCharacter

public class MyCharacter

{

//define the class member variables

private String name;

private int health;

private int power;

//constructor

public MyCharacter()

{

}

//constructor

public MyCharacter(String n, int h, int p)

{

//initialize the variables

name = n;

health = h;

power = p;

}

//define the method getName()

public String getName()

{

//return the value of name

return name;

}

//define the method setName()

public void setName(String name)

{

//set the value of name

this.name = name;

}

//define the method getHealth()

public int getHealth()

{

//return the value of health

return health;

}

//define the method setHealth()

public void setHealth(int health)

{

//set the value of health

this.health = health;

}

//define the method getPower()

public int getPower()

{

//return the value of power

return power;

}

//define the method setPower()

public void setPower(int power)

{

//set the value of power

this.power = power;

}

}

Explanation:

The above snippet of code is used to create a class “MyCharacter”. In the code,

  • Import the required header files.
  • Define a class “MyCharacter”
    • Declare the class variables “name”, “health” and “power”.
    • Define the constructor “MyCharacter”.
      • Set the values of variables “name”, “health” and “power”.
    • Define the “getName()” method.
      • Return the value of “name”.
    • Define the “setName()” method...

Blurred answer
Students have asked these similar questions
using r langauge The data law82 in bootstrap library contains LSAT and GPA for 82 law schools. Compute and compare the three 95% bootstrap confidence interval estimates for the correlation statistics.
What is the number of derangements of size k from the set {1,2,...n} to the set {1,2,...n} so that f(x) != x exactly k times with 1 <= k <= n
Trace a State Space Tree introduced in the Chapter 5.1 using algorithms depth_first_search (page 205), checknode (page 207), and expand (page 210).       Assume that State Space Tree is a two-level full binary tree (root is level 0). Node #2 (according to notation used in the Figure 5.1, page 204) is non-promising.   Count the number of steps performed by each of those three algorithms. Consider execution of instructions like "visit node" or execution of "promising function" as one step, "write a solution" as an exit call.       Note: no need to print or a draw a whole tree. Just provide three numbers as an answer
Knowledge Booster
Background pattern image
Similar questions
SEE MORE QUESTIONS
Recommended textbooks for you
Text book image
EBK JAVA PROGRAMMING
Computer Science
ISBN:9781337671385
Author:FARRELL
Publisher:CENGAGE LEARNING - CONSIGNMENT
Text book image
EBK JAVA PROGRAMMING
Computer Science
ISBN:9781305480537
Author:FARRELL
Publisher:CENGAGE LEARNING - CONSIGNMENT
Text book image
Microsoft Visual C#
Computer Science
ISBN:9781337102100
Author:Joyce, Farrell.
Publisher:Cengage Learning,
Text book image
Programming Logic & Design Comprehensive
Computer Science
ISBN:9781337669405
Author:FARRELL
Publisher:Cengage
Text book image
Programming with Microsoft Visual Basic 2017
Computer Science
ISBN:9781337102124
Author:Diane Zak
Publisher:Cengage Learning