Data Structures and Algorithms in Java
Data Structures and Algorithms in Java
6th Edition
ISBN: 9781118771334
Author: Michael T. Goodrich
Publisher: WILEY
Expert Solution & Answer
Book Icon
Chapter 2, Problem 11R

Explanation of Solution

Output of the code:

Create a main class Maryland that extends the State class and it includes printMe() to display the respective header in console.

// Create a class Maryland

public class Maryland extends State

{

  // Null constructor

  Maryland( )

  {

  }

  // Create a method

  public void printMe( )

  {

  System.out.println("Read it.");

  }

Create a main() function and create the objects for the class using new keyword and call the method printMe() to display the respective header.

  // Main function

  public static void main(String[ ] args)

  {

  // Create the objects for classes

  Region east = new State( );

  State md = new Maryland( );

  Object obj = new Place( );

  Place usa = new Region( );

/* Call the method printMe() using state class object.*/

  md.printMe( );

  // Call the method printMe() using object

  east.printMe( );

  // Call the method printMe() in Place class

  ((Place) obj).printMe( );

  //Assign the state class object to object class

  obj = md;

  // Call the method printMe() in maryland class

  ((Maryland) obj).printMe( );

  //Assign the place class object to object class

  obj = usa;

  // Call the method printMe() in place class

  ((Place) obj).printMe( );

  //Assign the state class object to place class

  usa = md;

  // Call the method printMe() in place class

  ((Place) usa).printMe( );

  }

}

Create a class State that extends the class Region and includes a method printMe() to display the header.

// Create a class that extends the Region

class State extends Region

{

  //Null constructor

  State( )

  {

  }

  //Create a method

  public void printMe( )

  {

  //Display the header

  System.out.println("Ship it.");

  }

}

Create a class Region that extends the class Place and includes a method printMe() to display the header...

Blurred answer
Students have asked these similar questions
Dijkstra's Algorithm (part 1).  Consider the network shown below, and Dijkstra’s link-state algorithm. Here, we are interested in computing the least cost path from node E (note: the start node here is E) to all other nodes using Dijkstra's algorithm. Using the algorithm statement used in the textbook and its visual representation, complete the "Step 0" row in the table below showing the link state algorithm’s execution by matching the table entries (i), (ii), (iii), and (iv) with their values.  Write down your final [correct] answer, as you‘ll need it for the next question.
4. |z + 5 - 5i| = 7
14. dz, C: |z❘ C: |z❘ = 0.6 ze² - 2iz H
Knowledge Booster
Background pattern image
Recommended textbooks for you
Text book image
EBK JAVA PROGRAMMING
Computer Science
ISBN:9781337671385
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
C++ Programming: From Problem Analysis to Program...
Computer Science
ISBN:9781337102087
Author:D. S. Malik
Publisher:Cengage Learning
Text book image
C++ for Engineers and Scientists
Computer Science
ISBN:9781133187844
Author:Bronson, Gary J.
Publisher:Course Technology Ptr
Text book image
Programming Logic & Design Comprehensive
Computer Science
ISBN:9781337669405
Author:FARRELL
Publisher:Cengage
Text book image
Systems Architecture
Computer Science
ISBN:9781305080195
Author:Stephen D. Burd
Publisher:Cengage Learning