Homework Help is Here – Start Your Trial Now!
Engineering
Computer Science
java program : Given the following method within the ArrayQueue class, what does it do ? public int Undefined(E item) {      int i = front, count = 0;      for ( int j = 0; j < size; j++ )      {                if (! theData[i].equals(item))                  count++;              i = (i + 1) % capacity;      }      return count; }

java program : Given the following method within the ArrayQueue class, what does it do ? public int Undefined(E item) {      int i = front, count = 0;      for ( int j = 0; j < size; j++ )      {                if (! theData[i].equals(item))                  count++;              i = (i + 1) % capacity;      }      return count; }

C++ Programming: From Problem Analysis to Program Design
C++ Programming: From Problem Analysis to Program Design
8th Edition
ISBN:9781337102087
Author:D. S. Malik
Publisher:D. S. Malik
Chapter18: Stacks And Queues
Section: Chapter Questions
Problem 16PE: The implementation of a queue in an array, as given in this chapter, uses the variable count to...
See similar textbooks
icon
Related questions
Question

java program :

Given the following method within the ArrayQueue class, what does it do ?

public int Undefined(E item)

{

     int i = front, count = 0;

     for ( int j = 0; j < size; j++ )

     {  

             if (! theData[i].equals(item))

                 count++;

             i = (i + 1) % capacity;

     }

     return count;

}

 

  1. It returns the number of the elements in the queue not equal to the element at the front of the queue and, also item.

     

  2. It returns the number of the elements in the queue not equal to the element at the front of the queue.

     

  3. It returns the number of elements of the queue not equal to item.

     

  4. It returns the number of occurrences of item in the queue.

Given the following method within the ArrayQueue class, what does it do ? public int Undefined(E item) { int i = front, count = 0; for ( int j = 0; j< size; j++ ) { if (! theData[i].equals(item)) count++; i = (i + 1) % capacity; } return count; } A) It returns the number of the elements in the queue not equal to the element at the front of the queue and, also item. B It returns the number of the elements in the queue not equal to the element at the front of the queue. It returns the number of elements of the queue not equal to item. D It returns the number of occurrences of item in the queue.
Transcribed Image Text:Given the following method within the ArrayQueue class, what does it do ? public int Undefined(E item) { int i = front, count = 0; for ( int j = 0; j< size; j++ ) { if (! theData[i].equals(item)) count++; i = (i + 1) % capacity; } return count; } A) It returns the number of the elements in the queue not equal to the element at the front of the queue and, also item. B It returns the number of the elements in the queue not equal to the element at the front of the queue. It returns the number of elements of the queue not equal to item. D It returns the number of occurrences of item in the queue.
Expert Solution
steps

Step by step

Solved in 2 steps

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Knowledge Booster
Array
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
  • SEE MORE QUESTIONS
Recommended textbooks for you
C++ Programming: From Problem Analysis to Program…
C++ Programming: From Problem Analysis to Program…
Computer Science
ISBN:
9781337102087
Author:
D. S. Malik
Publisher:
Cengage Learning
SEE MORE TEXTBOOKS