Answered: import ADTs.QueueADT; import…

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Related questions

Question

import ADTs.QueueADT;
import DataStructures.ArrayStack;
import ADTs.StackADT;
import DataStructures.LinkedQueue;
import java.util.Scanner;

/**
*
* @author Qiong
*/
public class RepeatStrings {
public static void main(String[] argv) throws Exception{
final int SIZE = 3;
Scanner keyboard = new Scanner(System.in);

QueueADT<String> stringQueue;
//stringQueue = new CircularArrayQueue<String>(SIZE);
stringQueue = new LinkedQueue<String>();
StackADT<String> stringStack;
stringStack = new ArrayStack<String>(SIZE);

String line;
for (int i = 0; i < SIZE; i++){
System.out.print("Enter a line of text which includes only 3 words > ");
line = keyboard.nextLine();

//TODO enque the new element

//TODO push the new element

}

System.out.println("\nOrder is: ");
for (int i = 0; i < SIZE; i++){
// TODO Remove an element in the order in which we input strings
// Save it to the String variable, named line

System.out.println(line);
}

System.out.println("\nOpposite order is: ");
for (int i = 0; i < SIZE; i++){
// TODO Remove an element in the order opposite to they were entered
// Save it to the String variable, named line

System.out.println(line);
}
}
}