class Q { Object[] Q; int head, tail; public Q() { this(10); } public Q(int l) { Q = new Object[l]; head = 0; tail = 0; } public boolean enqueue(Object x) { if ( <*1*> ) // overflow return false; Q[tail++ % Q.length] = x; return true; } public Object dequeue() { if ( <*2*> ) // empty queue return null; return Q[head++ % Q.length]; } }
class Q { Object[] Q; int head, tail; public Q() { this(10); } public Q(int l) { Q = new Object[l]; head = 0; tail = 0; } public boolean enqueue(Object x) { if ( <*1*> ) // overflow return false; Q[tail++ % Q.length] = x; return true; } public Object dequeue() { if ( <*2*> ) // empty queue return null; return Q[head++ % Q.length]; } }
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
Which of the following statements would correctly fill <*1>?
class Q {
Object[] Q;
int head, tail;
public Q() {
this(10);
}
public Q(int l) {
Q = new Object[l];
head = 0;
tail = 0;
}
public boolean enqueue(Object x) {
if ( <*1*> ) // overflow
return false;
Q[tail++ % Q.length] = x;
return true;
}
public Object dequeue() {
if ( <*2*> ) // empty queue
return null;
return Q[head++ % Q.length];
}
}
class Q {
Object[] Q;
int head, tail;
public Q() {
this(10);
}
public Q(int l) {
Q = new Object[l];
head = 0;
tail = 0;
}
public boolean enqueue(Object x) {
if ( <*1*> ) // overflow
return false;
Q[tail++ % Q.length] = x;
return true;
}
public Object dequeue() {
if ( <*2*> ) // empty queue
return null;
return Q[head++ % Q.length];
}
}
tail - Q.length <= head
tail - Q.length < head
tail - Q.length >= head
tail - Q.length > head
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
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