If N represents the number of elements in the queue, then the size method of the ArrayBoundedQueue class is O(N).
If N represents the number of elements in the queue, then the size method of the ArrayBoundedQueue class is O(N).
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
Related questions
Question
determine if the statement is true or false
If N represents the number of elements in the queue, then the size method of the ArrayBoundedQueue class is O(N).
![public class ArravReuededQURUR<T> implements Queuelotertare<T>
{
protected final int DEFCAP = 100; // default capacity
protected TH elements;
// array that holds queue elements
protected int wMElenents = lin/ number of elements in this queue
protected int front = Qin
protected int ein
// index of front of queue
/ index of rear of queue
public AcravBevodedQueHAU
elements = (TI)) new Object[DEFCAP];
rear = DEFCAP - 1;
}
public ArravBouodedQveralint vaxsize)
{
elements = (T)) new Object[maxsie);
rear = VaxSize - 1;
}
public void enguRuelT element)
// Throws QyeyevertlowExsertien if this queue is full;
// otherwise, adds element to the rear of this queue.
{
if (İSEUW)
throw new QueveevertlowExcertieal"Enqueue attempted on a full queue.");
else
{
rear = (rear + 1) % elements leneth:
elements[rear] = element;
OwDElements = QDElements+ 1;
}
public T deguRue)
// Throws QueyeUoderflbwExsertien if this queue is empty;
// otherwise, removes front element from this queue and returns it.
if (iŞEmotu)
throw new QueuellodertlowExcertienl"Dequeue attempted on empty queue.");
else
{
T toReturn = elements[front];
elements[front] = null;
front = (front + 1) % elementsleneth:
wDElements = wmElements- 1;
return toRetua
}
}
public booleao isEMptx)
// Returns true
this queue is empty; otherwise, returns false.
{
return (qumElemAnts== 0);
public boelean İSEUW
// Returns true if this queue is full; otherwise, returns false.
{
return (QumElements== elementsleneth);
}
public int sizell
// Returns the number of elements in this queue.
{
return nymElements
}](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F1b2c1e36-9974-49eb-8a0c-fe4d3c635f06%2Fc4502265-733d-4f81-ab65-1ac4fe2a1f6a%2Fhor55mg_processed.png&w=3840&q=75)
Transcribed Image Text:public class ArravReuededQURUR<T> implements Queuelotertare<T>
{
protected final int DEFCAP = 100; // default capacity
protected TH elements;
// array that holds queue elements
protected int wMElenents = lin/ number of elements in this queue
protected int front = Qin
protected int ein
// index of front of queue
/ index of rear of queue
public AcravBevodedQueHAU
elements = (TI)) new Object[DEFCAP];
rear = DEFCAP - 1;
}
public ArravBouodedQveralint vaxsize)
{
elements = (T)) new Object[maxsie);
rear = VaxSize - 1;
}
public void enguRuelT element)
// Throws QyeyevertlowExsertien if this queue is full;
// otherwise, adds element to the rear of this queue.
{
if (İSEUW)
throw new QueveevertlowExcertieal"Enqueue attempted on a full queue.");
else
{
rear = (rear + 1) % elements leneth:
elements[rear] = element;
OwDElements = QDElements+ 1;
}
public T deguRue)
// Throws QueyeUoderflbwExsertien if this queue is empty;
// otherwise, removes front element from this queue and returns it.
if (iŞEmotu)
throw new QueuellodertlowExcertienl"Dequeue attempted on empty queue.");
else
{
T toReturn = elements[front];
elements[front] = null;
front = (front + 1) % elementsleneth:
wDElements = wmElements- 1;
return toRetua
}
}
public booleao isEMptx)
// Returns true
this queue is empty; otherwise, returns false.
{
return (qumElemAnts== 0);
public boelean İSEUW
// Returns true if this queue is full; otherwise, returns false.
{
return (QumElements== elementsleneth);
}
public int sizell
// Returns the number of elements in this queue.
{
return nymElements
}
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 2 steps
Knowledge Booster
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.Recommended textbooks for you
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)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
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)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education