1answer.
Ask question
Login Signup
Ask question
All categories
  • English
  • Mathematics
  • Social Studies
  • Business
  • History
  • Health
  • Geography
  • Biology
  • Physics
  • Chemistry
  • Computers and Technology
  • Arts
  • World Languages
  • Spanish
  • French
  • German
  • Advanced Placement (AP)
  • SAT
  • Medicine
  • Law
  • Engineering
erica [24]
3 years ago
15

Create an instance of your queue that accepts java.lang.String Objects. Starting with an empty queue, use the enqueue(E e) metho

d to add 10,000 java.lang.String objects
Computers and Technology
1 answer:
Aleksandr-060686 [28]3 years ago
6 0

Answer:

Code is given below:

Explanation:

ode.java:

public class Node

{

String data;

Node next;

Node prev;

public Node(String data,Node next, Node prev){

this.next=next;

this.data=data;

this.prev=prev;

}

public Node(){

}

public String getData(){

return data;

}

public void setData(String data){

this.data=data;

}

public Node getNext(){

return next;

}

public void setNext(Node next){

this.next=next;

}

public Node getPrev(){

return prev;

}

public void setPrev(Node prev){

this.prev=prev;

}

}

Linked Queue.java:

public class LinkedQueues {

    Node head ;

   Node tail;

int size=0;

public Oueues(){

   this.head=null;

   this.tail=null;

}

public boolean isEmpty()

{

   return head == tail;

}    

 public int getSize()

    {

          return size;

  }    

 public void insert(String data){

   Node tmp = new Node(data,null,null);

    tmp.data=data;

    tmp.next=null;

    if(head==null){

        head=tail=tmp;

        head.prev=null;

    }

    else{

        tail.next=tmp;

        tmp.prev=tail;

        tail=tmp;

 }    

 }

 public String remove(){

  if(head.next==tail)

      return null;// list empty

  Node tmp=head.next;

  head.next=tmp.next;

  tmp.next.prev=head;

  list();

  return tmp.data;

 }

 public void list(){

     System.out.println("Queues");

     if(size==0){

         System.out.println("İs Empty");

     }

    Node tmp=head;

    while(tmp !=tail.getNext()){

        System.out.println(tmp.getVeri()+" ");

      tmp= tmp.getNext();

    }

     System.out.println();

 }

Linkedstack.java:

public class LinkedStack {

Node head = null;

Node tail = null;

int size=0;

     public int getSize() {

    return size;

      }

  public boolean isEmpty()

      {

   return head == null;

   }    

 public void Push(String data) {

    tail = head;

   head = new Node(data,null,null);

   head.data=data;

   head.next= tail;

   head.prev = null;

   if(tail != null) {

       tail.prev=head;

   }

   size++;

 }

 public void Pop() {

   if (!isEmpty()) {

       head = head.next;   // delete first node

       size--;

   } else {

       System.out.println("İs Empty");

   }

}

  public void Top() {

   Node tmp = head;

   while (tmp != null) {

       System.out.println(tmp.getData());

       tmp = tmp.getNext();

   }

}

 }

ArrayBasedQueue.java

import java.util.LinkedList;

import java.util.Queue;

 

public class ArrayBasedQueue

{

 public static void main(String[] args)

 {

   Queue<Integer> q = new LinkedList<>();

 

   // Adds elements {0, 1, 2, 3, 4} to queue

   for (int i=0; i<5; i++)

    q.add(i);

 

   // Display contents of the queue.

   System.out.println("Elements of queue-"+q);

   int removedele = q.remove();

   System.out.println("removed element-" + removedele);

 

   System.out.println(q);

   int head = q.peek();

   System.out.println("head of queue-" + head);

 

   int size = q.size();

   System.out.println("Size of queue-" + size);

 }

}

ArrayBasedStack.java:

import java.io.*;

import java.util.*;

 

public class ArrayBasedStack

{

static void stack_push(Stack<Integer> stack)

{

for(int i = 0; i < 5; i++)

{

stack.push(i);

}

}

 

// Popping element from the top of the stack

static void stack_pop(Stack<Integer> stack)

{

System.out.println("Pop :");

 

for(int i = 0; i < 5; i++)

{

Integer y = (Integer) stack.pop();

System.out.println(y);

}

}

 }

TestTimes.java:

public class TestTimes implements TestTimesInterface

{

 public static enum TimeUnits {};

 public static enum MemoryUnits{};

}

Driver.java:

public class driver

{

public static void main(String args[])

{

   Scanner s = new Scanner(System.in);

   LinkedStack y = new LinkedStack();

   LinkedQueues k = new LinkedQueues();

   ArrayBasedStack as=new ArrayBasedStack();

     ArrayBasedQueue as=new ArrayBasedQueue();

   FileWriter fwy;

   FileWriter fwk;

   File stack = new File("stack.txt");

   if (!stack.exists()) {

       stack.createNewFile();

   } else {

       System.out.println("already exists ");

   }

   BufferedReader reader = null;

   reader = new BufferedReader(new FileReader(stack));

   String line = reader.readLine();

   while (line != null) {

       y.Push(line = reader.readLine());

       System.out.println(line);

   }

   File queue = new File("queue.txt");

   if (!queue.exists()) {

       queue.createNewFile();

   } else {

       System.out.println("already exists ");

   }

   BufferedReader read = null;

   read = new BufferedReader(new FileReader(queue));

   String lines = read.readLine();

   while (lines != null) {

       lines = read.readLine();

       k.insert(lines);

       System.out.println(lines);

   }

int choice;

     System.out.println("1. Stack out- queue add");

     System.out.println("2. Stack add- queue out");

     System.out.println("3. Stack and queue ");

     System.out.println("4. File writer");

     choice = s.nextInt();

   switch (choice) {

       case 1:

           k.insert(s.next());

           k.list();

           y.pop();

           break;

       case 2:

         y.Push(s.next());

           y.Top();

         k.remove();

           break;

       case 3:

           y.Top();

           k.list();

           break;

       case 4:

           fwy = new FileWriter(stack);

           Node no = y.head;

           while (no.next != null) {

               fwy.write("\n" + no.data);

               no = no.next;

           }

           fwy.flush();

           fwy.close();

           fwk = new FileWriter(queue);

           Node noo = k.head;

           while (noo.next != null) {

               fwk.write("\n" + noo.data);

               noo = noo.next;

           }

           fwk.flush();

           fwk.close();

           break;

        }

 

}

}

You might be interested in
Why is monitor called softcopy output device?​
Mademuasel [1]

Answer:

A display device is the most common form of output device it presents output visually on a computer screen.the output appears temporarily on the screen and can easily altered or erased,it is sometimes referred to as softcopy

7 0
3 years ago
What year did polaroid introduce one-step photography with the SX-70
blagie [28]

Answer:

I first saw the Polaroid SX-70—the one-step instant camera introduced in 1972 by the company's co-founder, Dr.

Explanation:

5 0
2 years ago
Identify the three fuzzy logic systems in the given text.
Furkat [3]

Answer:

she is the both city CAA been Van from is next

4 0
3 years ago
¿Cuál es la influencia de las redes sociales en casa?
Natalka [10]
La influencia de las redes sociales en la casa puede variar. Primero puede ser bueno porque podemos usar las redes sociales para ver recetas de cocina para hacer en casa. Segundo puede ser malo porque las personas de la casa podrían sufrir acoso cibernético .
3 0
3 years ago
What happens to a mechanical system when two opposing torques do not cancel out?
const2013 [10]
The system will move in the direction of the stronger torque
5 0
3 years ago
Other questions:
  • To instruct Oracle11 g to sort data in ascending order, enter ____ after the column name in the ORDER BY clause.
    15·2 answers
  • A communications system connecting two or more computers is called a(n) ________.
    7·1 answer
  • To create a chart you need to select at least ___ in a range of data
    15·1 answer
  • ou work as network administrator for an organization that has a Windows-based network. You want to use multiple security counter
    10·1 answer
  • What is the first step to creating a PivotTable?
    11·1 answer
  • Moderate changes to existing processes falls under the _________ analysis. Business Process Automation (BPA) Business Process Im
    5·1 answer
  • How do you copy and paste plz let me know
    14·2 answers
  • What is the meaning of delegation
    13·2 answers
  • A simple C program to find the logarithm of any number in any base.....​
    13·1 answer
  • 2. When you establish a connection to a remote host using Remote Desktop Connection, what appears at the top of the screen that
    15·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!