Database System Concepts
7th Edition
ISBN: 9780078022159
Author: Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher: McGraw-Hill Education
expand_more
expand_more
format_list_bulleted
Related questions
Concept explainers
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](https://content.bartleby.com/qna-images/question/1b2c1e36-9974-49eb-8a0c-fe4d3c635f06/4a05439e-b0a1-4610-abc1-3d70025611e2/92j82vv_processed.png)
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 nowThis is a popular solution!
Step by stepSolved 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.Similar questions
- Implement a Queue using a vector or the STD ::queue:: class Note the difference in what it takes to implement using a char[] array vs a vector or the STD ::queue:: class The user will input a string and the program will return the string with each letter in the string duplicated. Displaying correct Queue implementation. Utilize the conventional methods as needed. Sample Execution Please input String: happy Program will produce the output string. Only use the enqueue(), dequeue(), empty(), etc hhaappyyarrow_forwardPlease DO NOT respond to this question by copy/pasting the code provided elsewhere on the site, none of those work. Thanks. Virtual Memory Lab This lab project addresses the implementation of page-replacement algorithms in a demand-paging system. Each process in a demand-paging system has a page table that contains a list of entries. For each logical page of the process, there is an entry in the table that indicates if the page is in memory. If the page is in memory, the memory frame number that page is resident in is indicated. Also, for each page, the time at which the page has arrived in memory, the time at which it has been last referenced, and the number of times the page has been referenced since the page arrived in memory are maintained. The page table data structure is a simple array of page-table entries (PTEs). Each PTE contains five fields as defined below: struct PTE { int is_valid; int frame_number; int arrival_timestamp; int…arrow_forwardcomplete TODO's using Javaarrow_forward
- Complete the following code. The goal is to implement the producer-consumer problem. You are expected to extend the provided C code to synchronize the thread operations consumer() and producer() such that an underflow and overflow of the queue is prevented. You are not allowed to change the code for implementing the queue operations, that is the code between lines 25 and 126 as shown in the Figure below. You must complete the missing parts between lines 226-261 as shown in the screenshot.arrow_forwardSimple JAVA queue code implementation please help for any part, please be clear, thank you Given an interface for Queue- Without using the java collections interface (ie do not import java.util.List,LinkedList, Stack, Queue...)- Create an implementation of Queue interface provided- For the implementation create a tester to verify the implementation of thatdata structure performs as expected Wait in line – Queue (fifo)- Implement the provided Queue interface ( fill out the implementation shell)- Put your implementation through its paces by exercising each of the methods ina test harness- Add to your ‘BusClient’ the following functionality using your Queue-o Create (enqueue) 6 riders by name§ Iterate over the queue, print all riderso Peek at the queue / print the resulto Remove (dequeue) the head of the queue§ Iterate over the queue, print all riderso Add two more riders to the queueo Peek at the queue & print the resulto Remove the head & print the result§ Iterate over the…arrow_forwardPlease help with the following in Java Write a Java program create a stack with elements pushed 1, 2, 3, 4 and 5, removes the middle element. Note that you may use only push(), pop(), peek() and empty() methods of the stack.arrow_forward
- OCaml Code: The goal of this project is to understand and build an interpreter for a small, OCaml-like, stackbased bytecode language. Make sure that the code compiles correctly and provide the code with the screenshot of the output. Make sure to have the following methods below: -Push integers, strings, and names on the stack -Push booleans -Pushing an error literal or unit literal will push :error: or :unit:onto the stack, respectively -Command pop removes the top value from the stack -The command add refers to integer addition. Since this is a binary operator, it consumes the toptwo values in the stack, calculates the sum and pushes the result back to the stack - Command sub refers to integer subtraction -Command mul refers to integer multiplication -Command div refers to integer division -Command rem refers to the remainder of integer division -Command neg is to calculate the negation of an integer -Command swap interchanges the top two elements in the stack, meaning that the…arrow_forwardJava Algorithm Programming Question Implement the ADT queue by using a circular linked list. Recall that this list has only an external reference to its last note. Example Output: Create a queue: isEmpty () returns true Add to queue to get Joe Jess Jim Jill Jane Jerry isEmpty () returns false Testing getFront and dequeue: Joe is at the front of the queue. Joe is removed from the front of the queue. Jess is at the front of the queue. Jess is removed from the front of the queue. Jim is at the front of the queue. Jim is removed from the front of the queue. Jill is at the front of the queue. Jill is removed from the front of the queue. Jane is at the front of the queue. Jane is removed from the front of the queue. Jerry is at the front of the queue. Jerry is removed from the front of the queue. The queue should be empty: isEmpty() returns true Add to queue to get Joe Jess Jim Testing clear: isEmpty() returns true Add to queue to get Joe Jess Jim Joe is at the front of the queue. Joe is…arrow_forwardJava: Which of the following operations has the least running time in a Queue (assume that only Queue interface operations are available; some operations may require use of an additional temporary queue)? Multiple choice. Deleting the element at the rear of the queue Checking if an element x is present in the queue Finding the number of elements in the queue all of the above have identical worst case running timearrow_forward
arrow_back_ios
arrow_forward_ios
Recommended textbooks for you
- Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill Education
Starting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSON
Digital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON 
C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSON
Database Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage Learning
Programmable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education
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