Databases
StackOverflow2013
Postsdbo
POJava - Bounded Queue using array
 

Note that there are some explanatory texts on larger screens.

plurals
  1. POJava - Bounded Queue using array
    primarykey
    data
    text
    <p>I was asked to create a bounded queue class to which the conditions were the following: </p> <p>Using only primitive types, implement a bounded queue to store integers. The data structure should be optimized for algorithmic runtime, memory usage, and memory throughput. No external libraries should be imported and/or used. The solution should be delivered in one class that provides the following functions:</p> <ul> <li>constructor - class should provide one method for object creation that takes an integer to set the size of the queue.</li> <li>enqueue - function should take an integer and store it in the queue if the queue isn't full. The function should properly handle the case where the queue is already full.</li> <li>dequeue - function should return an integer if one is currently stored in the queue. The function should properly handle the case where the queue is empty.</li> </ul> <p>I wrote this class but I wanted to ask for help by having someone test it as well to see if it works properly. I wrote a small main class to test it and everything seems to be working but I want another pair of eyes to look at it before I submit it. Its for an internship. Thank you in advance.</p> <pre><code>public class Queue&lt;INT&gt; { int size; int spacesLeft; int place= 0; int[] Q; public Queue(int size) { this.size = size; spacesLeft = size; Q = new int[size]; } //enqueue - function should take an integer and store it in the queue if the queue isn't full. //The function should properly handle the case where the queue is already full public void enque(int newNumber) throws Exception { if(place &lt;= size) { Q[place] = newNumber; place++; spacesLeft--; } else throw new Exception(); } //dequeue - function should return an integer if one is currently stored in the queue. //The function should properly handle the case where the queue is empty. public int deque() throws Exception { int dequeNum; if(spacesLeft == size) throw new Exception(); else { dequeNum = Q[0]; spacesLeft++; } int[] tempAry = new int[size]; for (int i=0; i &lt; Q.length; i++) { if(i &lt; size-1) { tempAry[i] = Q[i+1]; // put in destination } } Q = tempAry; for(int i = 0; i &lt; Q.length; i++) { System.out.println("value in Q"+Q[i]); } return dequeNum; } } </code></pre>
    singulars
    1. PO
      singulars
      1. PTAnswer
    1. This table or related slice is empty.
    1. PTQuestion
    1. USDavid Grant
    1. USTitaniuM
    plurals
    1. This table or related slice is empty.
    1. PL
      singulars
      1. LTLinked
    1. This table or related slice is empty.
    1. PO
      singulars
      1. PTAnswer
    2. PO
      singulars
      1. PTAnswer
    3. PO
      singulars
      1. PTAnswer
    1. VO
      singulars
      1. POJava - Bounded Queue using array
      1. This table or related slice is empty.
      1. VTUpMod
    2. VO
      singulars
      1. POJava - Bounded Queue using array
      1. UScoletrain
      1. VTFavorite
    1. COYou spelt enqueue and dequeue wrong. :)
      singulars
      1. POJava - Bounded Queue using array
      1. USDavid Grant
    2. COIt's much better to implement a queue over a linked list instead of an array imo.
      singulars
      1. POJava - Bounded Queue using array
      1. USTudor
    3. COIf you write it as a LIFO queue instead of FIFO, it'll be a lot easier for you.
      singulars
      1. POJava - Bounded Queue using array
      1. USDavid Grant
 

Querying!

 
Guidance
A row detail

Detail views are divided into sections. All the information in the data section comes from columns in the selected row. The other sections display data from other, related rows.

Related data can be related in a to-one or a to-many fashion. Captions of data related in a to-many fashion link to a list view showing a filtered view of the table.

Try moving around until you find a non-empty to-many entry and click on the label to get to one. You can move back to the root by clicking on the database name in the header.

SQuiL has stopped working due to an internal error.

If you are curious you may find further information in the browser console, which is accessible through the devtools (F12).

Reload