(Inheritance and Polymorphism) In java, No UML is needed.
I 1.10 Implement MyStack using inheritance) In Listing 11.10 MyStack is imple mented using composition. Define a new stack class that extends ArrayList. Draw the UML diagram for the classes and then implement MyStack. Write a test program that prompts the user to enter five strings and displays them in reverse order
Solution
StackTest.java
import java.util.ArrayList;
import java.util.Scanner;
public class StackTest extends ArrayList{
/**
* @param args
*/
public boolean isEmpty(){
return super.isEmpty();
}
public int getSize(){
return super.size();
}
public Object peek(){
return super.get(getSize() - 1);
}
public Object pop(){
Object o = super.get(getSize()-1);
super.remove(getSize()-1);
return o;
}
public void pust(Object o){
super.add(o);
}
public String toString(){
return \"Stack: \"+super.toString();
}
public static void main(String[] args) {
// TODO Auto-generated method stub
new StackTest();
}
public StackTest(){
Scanner scan = new Scanner(System.in);
for(int i=1; i<=5; i++){
System.out.println(\"Enter String \"+i+\": \");
pust(scan.nextLine());
}
System.out.println(\"Given String in stack \"+toString());
System.out.println(\"Reverse Order :\");
for(int i=1; i<=5; i++){
System.out.println(pop());
}
}
}
Output:
Enter String 1:
AAA
Enter String 2:
BBB
Enter String 3:
CCC
Enter String 4:
DDD
Enter String 5:
EEE
Given String in stack Stack: [AAA, BBB, CCC, DDD, EEE]
Reverse Order :
EEE
DDD
CCC
BBB
AAA
.
(Inheritance and Polymorphism) In java- No UML is needed- I 1-10 Imple.docx
1. (Inheritance and Polymorphism) In java, No UML is needed.
I 1.10 Implement MyStack using inheritance) In Listing 11.10 MyStack is imple mented using
composition. Define a new stack class that extends ArrayList. Draw the UML diagram for the
classes and then implement MyStack. Write a test program that prompts the user to enter five
strings and displays them in reverse order
Solution
StackTest.java
import java.util.ArrayList;
import java.util.Scanner;
public class StackTest extends ArrayList{
/**
* @param args
*/
public boolean isEmpty(){
return super.isEmpty();
}
public int getSize(){
return super.size();
}
public Object peek(){
return super.get(getSize() - 1);
}
public Object pop(){
Object o = super.get(getSize()-1);
super.remove(getSize()-1);
return o;
}
public void pust(Object o){
super.add(o);
2. }
public String toString(){
return "Stack: "+super.toString();
}
public static void main(String[] args) {
// TODO Auto-generated method stub
new StackTest();
}
public StackTest(){
Scanner scan = new Scanner(System.in);
for(int i=1; i<=5; i++){
System.out.println("Enter String "+i+": ");
pust(scan.nextLine());
}
System.out.println("Given String in stack "+toString());
System.out.println("Reverse Order :");
for(int i=1; i<=5; i++){
System.out.println(pop());
}
}
}
Output:
Enter String 1:
AAA
Enter String 2:
BBB
Enter String 3:
CCC
Enter String 4:
DDD
Enter String 5:
EEE
Given String in stack Stack: [AAA, BBB, CCC, DDD, EEE]
Reverse Order :
EEE
DDD
CCC
BBB
AAA
![}
public String toString(){
return "Stack: "+super.toString();
}
public static void main(String[] args) {
// TODO Auto-generated method stub
new StackTest();
}
public StackTest(){
Scanner scan = new Scanner(System.in);
for(int i=1; i<=5; i++){
System.out.println("Enter String "+i+": ");
pust(scan.nextLine());
}
System.out.println("Given String in stack "+toString());
System.out.println("Reverse Order :");
for(int i=1; i<=5; i++){
System.out.println(pop());
}
}
}
Output:
Enter String 1:
AAA
Enter String 2:
BBB
Enter String 3:
CCC
Enter String 4:
DDD
Enter String 5:
EEE
Given String in stack Stack: [AAA, BBB, CCC, DDD, EEE]
Reverse Order :
EEE
DDD
CCC
BBB
AAA](data:image/gif;base64,R0lGODlhAQABAIAAAAAAAP///yH5BAEAAAAALAAAAAABAAEAAAIBRAA7)