/*
* To change this license header, choose License Headers in Project Properties.
* To change this template file, choose Tools | Templates
* and open the template in the editor.
*/
package Apps;
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 stringQueue;
//stringQueue = new CircularArrayQueue(SIZE);
stringQueue = new LinkedQueue();
StackADT stringStack;
stringStack = new ArrayStack(SIZE);
String line;
for (int i = 0; i < size;="">
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;="">
// 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;="">
// TODO Remove an element in the order opposite to they were entered
// Save it to the String variable, named line
System.out.println(line);
}
}
}
Extracted text: Assume that we have to store strings provided by a user and then output the strings in the same order in which they were entered, which data structure is better to apply, between Queue and Stack? If we have to output the strings in the order opposite to they were entered, which data structure is better to apply, between Queue and Stack? The goal of the programming question is to • practice how to code enqueue(another), dequeue(), size(), isEmpty) in the array-based implementation of queue • compare the queue structure with the stack structure • apply queues and stacks in the application of repeating strings. To check where statements are missing, please take a look at the comments starting with "//TODO". Task. Please follow the steps: 1. Quickly read RepeatStrings.java in the src/Apps sub-folder and get an idea of reading strings in the same or opposite order. Here we assume that you have download the start code package, and launch it in NetBeans, as shown in the preparation part of the lab description. 2. Fill missing codes in size), first), isEmpty0 of ArrayQueue.java in the src/DataStructures sub- folder 3. Fill missing codes in enque(another), deque() of ArrayQueue.java in the src/DataStructures sub- folder (Hints can be found in the lab description) 4. Fill missing codes in RepeatStrings.java in the src/Apps sub-folder After you finish, please run the code and submit your code.