The main thread of a Java program can generate additional threads. true or false It is possible to implement an unbounded queue using an array-based approach. true or false
The main thread of a Java program can generate additional threads. true or false It is possible to implement an unbounded queue using an array-based approach. true or false
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
The main thread of a Java
true or false
It is possible to implement an unbounded queue using an array-based approach.
true or false
![public class ArcanboundedAvoue<T> implements QueueloterfagerT>
{
protected final ipt DEFCAP = 100; // default capacity
protected T) elements;
protected ipt origCAPAn // original capacity
protected ipt OHupableovots= // number of elements in this queue
protected ipt front = // index of front of queue
protected ipt ea
// array that holds queue elements
k
// index of rear of queue
public errayUgkouadodQHPUR
{
elements = () new Object[DEFCAP);
rear = DEFCAP - 1;
grisCaA- DEFCAP3;
}
public errayUakouadodQHPuRliot oriecCap
{
elements = (U) new Object[origCapl;
rear = origCAp 13;
thisocieGan- QrisCAP
}
private void enlareel)
Increments the capacity of the queue by an amount
/equal to the original capacity.
// create the larger array
U) larger = (TI) new Object[elerertslerethat orieCapl;
// copy the contents from the smaller array into the larger array
iot CHASalex = front;
{
larger[CHALArgad = elements[CHSmalock:
GOSPoaller = (suUSoallen+ 1) % eleneptslenetbs
// update instance variables
elements = larger;
front = 0;
rear = RHONElement 1;
}
public void ergueuolT element)
//
Adds element to the rear of this queue.
{
enlacgol);
rear = (rear + 1) % elenaptalanetbs
elements[rear] = element;
public T degueMo)
Throws QueuebnderlewEyceotianif this queue is empty;
I/ otherwise, removes front element from this queue and returns it.
{
if (iskpptul)
throw new Queuelladentlowyception"Dequeue attempted on empty queue.");
else
{
TteBetuF elements[front);
elements[front) = null;
front = (front + 1) % elepentaleretis
return toBeturo:
}
public beoleaniskpaptyl)
// Returns true if this queue is empty; otherwise, returns false.
{
return (ouEleovots== 0);
public beeleaniskulk)
Returns false - an unbounded queue is never full.
{
return false;
}
public ipt sizol)
// Returns the number of elements in this queue.
{
return RuOGleoent](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F1b2c1e36-9974-49eb-8a0c-fe4d3c635f06%2F4a05439e-b0a1-4610-abc1-3d70025611e2%2F92j82vv_processed.png&w=3840&q=75)
Transcribed Image Text:public class ArcanboundedAvoue<T> implements QueueloterfagerT>
{
protected final ipt DEFCAP = 100; // default capacity
protected T) elements;
protected ipt origCAPAn // original capacity
protected ipt OHupableovots= // number of elements in this queue
protected ipt front = // index of front of queue
protected ipt ea
// array that holds queue elements
k
// index of rear of queue
public errayUgkouadodQHPUR
{
elements = () new Object[DEFCAP);
rear = DEFCAP - 1;
grisCaA- DEFCAP3;
}
public errayUakouadodQHPuRliot oriecCap
{
elements = (U) new Object[origCapl;
rear = origCAp 13;
thisocieGan- QrisCAP
}
private void enlareel)
Increments the capacity of the queue by an amount
/equal to the original capacity.
// create the larger array
U) larger = (TI) new Object[elerertslerethat orieCapl;
// copy the contents from the smaller array into the larger array
iot CHASalex = front;
{
larger[CHALArgad = elements[CHSmalock:
GOSPoaller = (suUSoallen+ 1) % eleneptslenetbs
// update instance variables
elements = larger;
front = 0;
rear = RHONElement 1;
}
public void ergueuolT element)
//
Adds element to the rear of this queue.
{
enlacgol);
rear = (rear + 1) % elenaptalanetbs
elements[rear] = element;
public T degueMo)
Throws QueuebnderlewEyceotianif this queue is empty;
I/ otherwise, removes front element from this queue and returns it.
{
if (iskpptul)
throw new Queuelladentlowyception"Dequeue attempted on empty queue.");
else
{
TteBetuF elements[front);
elements[front) = null;
front = (front + 1) % elepentaleretis
return toBeturo:
}
public beoleaniskpaptyl)
// Returns true if this queue is empty; otherwise, returns false.
{
return (ouEleovots== 0);
public beeleaniskulk)
Returns false - an unbounded queue is never full.
{
return false;
}
public ipt sizol)
// Returns the number of elements in this queue.
{
return RuOGleoent
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