Trace though the state of the queue q in the following code fragment. (Assume Queue is a class that has enqueue and dequeue member functions and integer data. Enqueue inserts data in the queue and Dequeue deletes and saves from the queue). int _tmain(int argc, _TCHAR* argv[]) { quetype q; int i,t; for (i = 0; i <= 5; i++) q.enqueue(i); while (!q.isempty()) { i=q.dequeue(); cout << i << endl; } cout << "=========================================" << endl; q.enqueue(5); q.enqueue(7); q.enqueue(13); t = q.dequeue(); q.enqueue(12 + t); t = q.dequeue(); q.enqueue(q.dequeue()); while (!q.isempty()) { i = q.dequeue(); cout << i << endl; } return 0; }
Trace though the state of the queue q in the following code fragment. (Assume Queue is a class that has enqueue and dequeue member functions and integer data. Enqueue inserts data in the queue and Dequeue deletes and saves from the queue). int _tmain(int argc, _TCHAR* argv[]) { quetype q; int i,t; for (i = 0; i <= 5; i++) q.enqueue(i); while (!q.isempty()) { i=q.dequeue(); cout << i << endl; } cout << "=========================================" << endl; q.enqueue(5); q.enqueue(7); q.enqueue(13); t = q.dequeue(); q.enqueue(12 + t); t = q.dequeue(); q.enqueue(q.dequeue()); while (!q.isempty()) { i = q.dequeue(); cout << i << endl; } return 0; }
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
100%
Trace though the state of the queue q in the following code fragment. (Assume Queue is a class that has
enqueue and dequeue member functions and integer data. Enqueue inserts data in the queue and Dequeue
deletes and saves from the queue).
int _tmain(int argc, _TCHAR* argv[])
{
quetype q;
int i,t;
for (i = 0; i <= 5; i++) q.enqueue(i);
while (!q.isempty())
{ i=q.dequeue();
cout << i << endl;
}
cout << "=========================================" << endl;
q.enqueue(5);
q.enqueue(7);
q.enqueue(13);
t = q.dequeue();
q.enqueue(12 + t);
t = q.dequeue();
q.enqueue(q.dequeue());
while (!q.isempty())
{
i = q.dequeue();
cout << i << endl;
}
return 0;
}
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 with 22 images
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