In C++, 127891011DISPLAY 13.20 A Queue5 namespace queuesavitch6121314151617181920{1:1The operation to add an item in the queue is called push or enqueue operation and will always userear pointer. The operation to remove an item from the queue is called pop or dequeue operationand will always use front pointer. The queue implementation will look like this:DISPLAY 13.21Interface File for a Queue Class (part 1 of 2)//This is the header file queue.h. This is the interface for the class Queue,//which is a class for a queue of symbols.3#ifndef QUEUE_H4 #define QUEUE_Hstruct QueueNode{Bchar data;QueueNode *link;};typedef QueueNode* QueueNodePtr;class Queue{public:BA|dс||Queue ();//Initializes the object to an empty queue.Queue (const Queue& aQueue);~Queue ();A DISPLAY 13.21 Interface File for a Queue Class (part 2 of 2)void add(char item);//Postcondition: item has been added to the back of the queue.char remove();//Precondition: The queue is not empty.//Returns the item at the front of the queue and//removes that item from the queue.21222148232425262778bool empty() const;//Returns true if the queue is empty. Returns false otherwise.28293031323334};35}//queuesavitch36 #endif //QUEUE_Hprivate:QueueNodePtr front;//Points to the head of a linked list.//Items are removed at the headQueueNodePtr back;//Points to the node at the other end of the//linked list. Items are added at this end.Exercise 6.1Implement the queue class as shown above. Use your queue to store the names of 5 studentswaiting outside Student Services to meet with advisors. You may want to add more data to eachnode including student ID, Major, etc.Add a member function displayQueue which displays the contents of the queue. Write the mainfunction to test the queue. Call your program ex6_1.cpp. Be sure to show the contents of queueafter adding or removing each student.It is strongly encouraged that you make your program more user friendly by providing a menu ofoptions for user (for example: user can choose to add an element to the queue or remove it ordisplay entire queue).Note: Queue can be implemented using arrays as well as linked list. This exercise requires you toimplement the linked list version of queues but you should also look at the array implementationto enhance your understanding.

1. Start2. Initialize a Queue object called students.3. Prompt the user to enter an option from…

Implement the queue class as shown above. Use your queue to store the names of 5 students waiting outside Student Services to meet with advisors. You may want to add more data to each node including student ID, Major, etc. Add a member function displayQueue which displays the contents of the queue. Write the main function to test the queue. Call your program ex6_1.cpp. Be sure to show the contents of queue after adding or removing each student. It is strongly encouraged that you make your program more user friendly by providing a menu of options for user (for example: user can choose to add an element to the queue or remove it or display entire queue).

Implement the queue class as shown above. Use your queue to store the names of 5 students waiting outside Student Services to meet with advisors. You may want to add more data to each node including student ID, Major, etc. Add a member function displayQueue which displays the contents of the queue. Write the main function to test the queue. Call your program ex6_1.cpp. Be sure to show the contents of queue after adding or removing each student. It is strongly encouraged that you make your program more user friendly by providing a menu of options for user (for example: user can choose to add an element to the queue or remove it or display entire queue).

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

See similar textbooks

Related questions

Q: What is implicit conversion in c++?

A: Example for Implicit type conversion: #include<stdio.h> int main() { //initializing variable…

Q: The ability to tell basic data types apart from sophisticated ones in C++ is a key skill.

A: Introduction: C++ is a popular programming language used in the development of a wide range of…

Q: In C++, what is operator overloading about?

A: Operator overloading is:

Q: explain the concept of dynamic variables in C++.

A: explain the concept of dynamic variables in C++.

Q: What’s the difference between scoped enumeration type and unscoped enumera

A: Introduction: Enumeration types in C++ are a handy way of creating variables that contain a set of…

Q: What are some of the differences between data types in C++ versus Java?

A: The objective of this question is to understand the differences between data types in C++ and Java.…

Q: Analyze the pros and cons of using pointers and arrays interchangeably in C programs.

A: Introduction: C is a programming language that supports both arrays and pointers, which can be used…

Q: Explain an example of logical operators in C++.

A: Logical operators: They are used to determine the logic that is present in between two variables and…

Q: Hi could you please make the code implemention in c++ thanks

A: The C++ code is given below with output screenshot

Q: How can you tell the difference between basic and sophisticated data types when it comes to C++?

A: Types of Data: Data types provide all the data that have a similar property and serve as a…

Question

In C++,

1
2
7
8
9
10
11
DISPLAY 13.20 A Queue
5 namespace queuesavitch
6
12
13
14
15
16
17
18
19
20
{
1:1
The operation to add an item in the queue is called push or enqueue operation and will always use
rear pointer. The operation to remove an item from the queue is called pop or dequeue operation
and will always use front pointer. The queue implementation will look like this:
DISPLAY 13.21
Interface File for a Queue Class (part 1 of 2)
//This is the header file queue.h. This is the interface for the class Queue,
//which is a class for a queue of symbols.
3
#ifndef QUEUE_H
4 #define QUEUE_H
struct QueueNode
{
B
char data;
QueueNode *link;
};
typedef QueueNode* QueueNodePtr;
class Queue
{
public:
B
A
|d
с
||
Queue ();
//Initializes the object to an empty queue.
Queue (const Queue& aQueue);
~Queue ();
A

DISPLAY 13.21 Interface File for a Queue Class (part 2 of 2)
void add(char item);
//Postcondition: item has been added to the back of the queue.
char remove();
//Precondition: The queue is not empty.
//Returns the item at the front of the queue and
//removes that item from the queue.
21
22
2148
23
24
25
26
27
78
bool empty() const;
//Returns true if the queue is empty. Returns false otherwise.
28
29
30
31
32
33
34
};
35
}//queuesavitch
36 #endif //QUEUE_H
private:
QueueNodePtr front;//Points to the head of a linked list.
//Items are removed at the head
QueueNodePtr back;//Points to the node at the other end of the
//linked list. Items are added at this end.
Exercise 6.1
Implement the queue class as shown above. Use your queue to store the names of 5 students
waiting outside Student Services to meet with advisors. You may want to add more data to each
node including student ID, Major, etc.
Add a member function displayQueue which displays the contents of the queue. Write the main
function to test the queue. Call your program ex6_1.cpp. Be sure to show the contents of queue
after adding or removing each student.
It is strongly encouraged that you make your program more user friendly by providing a menu of
options for user (for example: user can choose to add an element to the queue or remove it or
display entire queue).
Note: Queue can be implemented using arrays as well as linked list. This exercise requires you to
implement the linked list version of queues but you should also look at the array implementation
to enhance your understanding.

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!

SEE SOLUTION Check out a sample Q&A here

Step 1: Algorithm

VIEW

Step 2: The source code for the given problem

VIEW

Step 3: Code screenshot

VIEW

Solution

VIEW

Trending now

This is a popular solution!

Step by step

Solved in 4 steps with 5 images

SEE SOLUTION Check out a sample Q&A here

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

What is concatenation in C++ and what are its advantages?
Make a table of primary/inbuilt data types in C++ .
When it comes to C++, how can you determine the difference between the most fundamental data types and the most advanced ones?
Do pointers in C++ give developers more freedom?
Please explain the concept of complexity in C++.
Explain in detail, the common string manipulation errors that can be encountered in C++?
In C/C++, pointers are employed. Why is it that Java doesn't use pointers?
How do you differentiate between C++'s primitive and structured data types?
When we are talking about c++ and our code, what does encapsulation mean? Please explain in detail thanks