Solved

How to implement the standard Queue ADT?

Posted on 2008-06-16
8
1,183 Views
Last Modified: 2009-05-23
Hello.
I have to show how to implement the standard Queue ADT using only a Priority Queue and one additional integer instance variable. Can anyone provide a text description of the process?
0
Comment
Question by:secondcup
8 Comments
 
LVL 53

Expert Comment

by:Infinity08
ID: 21795843
Is this an assignment ? How far did you get ? What are you unsure about ?
0
 

Author Comment

by:secondcup
ID: 21796786
I have no idea how to implement the Queue ADT using only a Priority Queue and one additional integer instance variable.  I just know we can implement it by using List...but I do not get what it means by one additional integer..
0
 
LVL 53

Accepted Solution

by:
Infinity08 earned 168 total points
ID: 21796980
A queue is a special case of a priority queue, where the priority is basically the time of insertion.
0
Why You Should Analyze Threat Actor TTPs

After years of analyzing threat actor behavior, it’s become clear that at any given time there are specific tactics, techniques, and procedures (TTPs) that are particularly prevalent. By analyzing and understanding these TTPs, you can dramatically enhance your security program.

 
LVL 3

Assisted Solution

by:Sankozi
Sankozi earned 166 total points
ID: 21797194
I think this is good solution. You just need this additional integer to determine priority of next element that will be pushed.


class Queue

{

  PQueue pQueue = new PQueue(); 

  int nextPriority = Integer.MAX_VALUE;
 

  void push(T t)

  {

    pQueue.insertWithPriority(t, nextPriority --);
 

    if(nextPriority == Integer.MIN_VALUE)

    {

      reload(); //"restart" queue

    }

  }
 

  T pop()

  {

    p.getNext();

  }
 

  void reload()

  {

    oldPQ = pQueue;

    pQueue = new PQueue();

    nextPriority = Integer.MAX_VALUE;
 

    while(!oldPQ.empty())

    {

      push(oldPQ.pop());

    }

  }

}

Open in new window

0
 
LVL 53

Expert Comment

by:Infinity08
ID: 21797260
Sankozi, be careful with posting full code solutions to what might be an assignment - that's not permitted on this site.
0
 
LVL 1

Assisted Solution

by:CCSINCOMETRUST
CCSINCOMETRUST earned 166 total points
ID: 21917134
You may want to consider implementing a circular queue depending on what it will be used for and if you don't know how much it will hold ahead of time.

Hint: Google "Java Circular Queue" or "C++ Circular Queue" - you should have no problem finding code that you can use.
0

Featured Post

What Security Threats Are You Missing?

Enhance your security with threat intelligence from the web. Get trending threat insights on hackers, exploits, and suspicious IP addresses delivered to your inbox with our free Cyber Daily.

Join & Write a Comment

The greatest common divisor (gcd) of two positive integers is their largest common divisor. Let's consider two numbers 12 and 20. The divisors of 12 are 1, 2, 3, 4, 6, 12 The divisors of 20 are 1, 2, 4, 5, 10 20 The highest number among the c…
Prime numbers are natural numbers greater than 1 that have only two divisors (the number itself and 1). By “divisible” we mean dividend % divisor = 0 (% indicates MODULAR. It gives the reminder of a division operation). We’ll follow multiple approac…
This tutorial demonstrates a quick way of adding group price to multiple Magento products.
This video demonstrates how to create an example email signature rule for a department in a company using CodeTwo Exchange Rules. The signature will be inserted beneath users' latest emails in conversations and will be displayed in users' Sent Items…

747 members asked questions and received personalized solutions in the past 7 days.

Join the community of 500,000 technology professionals and ask your questions.

Join & Ask a Question

Need Help in Real-Time?

Connect with top rated Experts

12 Experts available now in Live!

Get 1:1 Help Now