*The Question In the PictureCriteriaa. Create a class called Queue with member variable queueArr, integer queue array, integer rear, integer frontb. i. Initialize rear and front to -1ii. Receive an integer and check if queue is full, if not then insert the integer to the queue arrayiii. Delete front element from queue if front is not equal to rear (empty)iv. Print out the queue array if rear is not equal to front.c. i. Provides a choice to the user if they want to insert, delete or display the queue.ii. According to the user response, the appropriate function is called. Without using C++ queue STL, write a simple menu based selection to insert, delete, show andexit from queue.1. Create a class called Queue with member variable queueArr as integer queue array,integer rear and integer front to keep track both rear and front element in the queuearray.2. Define several member functions in Queue such as aa. constructor – initialize both rear and front to -1b. insert – receive an integer and check if queue is full, if not then insert the integerto the queue arrayc. delete – delete front element from queue if front is not equal to rear (empty)d. display – if rear is not equal to front, then print out the queue array.3. Write a main function to test the Queue class.

Code: #include <iostream>#include<conio.h>#include<stdlib.h> #define MAX_SIZE 100…

Answered: *The Question In the Picture Criteria…

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

Concept explainers

Question

100%

*The Question In the Picture

Criteria

a. Create a class called Queue with member variable queueArr, integer queue array, integer rear, integer front

i. Initialize rear and front to -1
ii. Receive an integer and check if queue is full, if not then insert the integer to the queue array
iii. Delete front element from queue if front is not equal to rear (empty)
iv. Print out the queue array if rear is not equal to front.

i. Provides a choice to the user if they want to insert, delete or display the queue.

ii. According to the user response, the appropriate function is called.

Without using C++ queue STL, write a simple menu based selection to insert, delete, show and
exit from queue.
1. Create a class called Queue with member variable queueArr as integer queue array,
integer rear and integer front to keep track both rear and front element in the queue
array.
2. Define several member functions in Queue such as a
a. constructor – initialize both rear and front to -1
b. insert – receive an integer and check if queue is full, if not then insert the integer
to the queue array
c. delete – delete front element from queue if front is not equal to rear (empty)
d. display – if rear is not equal to front, then print out the queue array.
3. Write a main function to test the Queue class.

Expert Solution

Step by step

Solved in 2 steps with 1 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.

Recommended textbooks for you

Database System Concepts

Computer Science

ISBN:

9780078022159

Author:

Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:

McGraw-Hill Education