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.

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
icon
Related questions
Question

/*
* 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<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);
}
}
}

 

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.
Transcribed Image 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.
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps

Blurred answer
Knowledge Booster
Fundamentals of Testing Strategies
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education