Starting Out with C++ from Control Structures to Objects (8th Edition)
8th Edition
ISBN: 9780133769395
Author: Tony Gaddis
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Question
Chapter 18, Problem 24RQE
Program Plan Intro
Queue:
- A queue contains sequence of items.
- The item which is inserted first is retrieved first.
- Queue performs “First In First Out”.
Operations performed on Queue:
A queue can perform two operations. They are:
- Enqueue
- Dequeue
Enqueue:
Insertion of an element into the queue is called as Enqueue. The elements can be inserted at any end of the queue. The sides in which the items are inserted are called as “Rear”.
Dequeue:
Retrieving an element from the queue is known as Dequeue. The sides in which the items are deleted are called as “Front”.
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
Note : addqueue works like Enqueue and deleteQueue works like Dequeue
Consider the following statements: (8, 9)
queueType queue;
int num;
Show what is output by the following segment of code
num = 7;
queue.addQueue (6);
queue.addQueue (num);
num = queue.front ();
queue.deleteQueue();
queue.addQueue (num + 5);
queue.addQueue (14);
queue.addQueue (num
queue.addQueue (25);
queue.deleteQueue ();
2);
cout <« "Queue elements: ";
while (!queue.isEmptyQueue ())
{
cout <« queue.front () << " ";
queue.deleteQueue();
}
cout <« endl;
Queue elements: 14 14 4 25
Queue elements: 11 14 4 4
Queue elements: 11 14 4 25
Queue elements: 11 14 25 25
Question in image.
Please explain how to do the Question with the answer.
Thank you
3- Write a program that randomly generates 10 numbers (between 1 and 8), inserts into queue and then finds how many distinct elements exist in the queue.
Example 1:
Example 2:
Queue:
2 40 3 3 2 18 4 18 18 3
Queue:
1 1 4 33 16 16 4 16 4
Output: 5
Output: 4
Notes:
• You must use ONLY queue data structure. Don't use other different data structures like string or normal (pure) array or stack or array list.
• Don't write any other method in the Qeueu class. All methods must be written in the main program.
Chapter 18 Solutions
Starting Out with C++ from Control Structures to Objects (8th Edition)
Ch. 18.3 - Describe what LIFO means.Ch. 18.3 - What is the difference between static and dynamic...Ch. 18.3 - What are the two primary stack operations?...Ch. 18.3 - What STL types does the STL stack container adapt?Ch. 18 - Prob. 1RQECh. 18 - Prob. 2RQECh. 18 - What is the difference between a static stack and...Ch. 18 - Prob. 4RQECh. 18 - Prob. 5RQECh. 18 - The STL stack is considered a container adapter....
Ch. 18 - What types may the STL stack be based on? By...Ch. 18 - Prob. 8RQECh. 18 - Prob. 9RQECh. 18 - Prob. 10RQECh. 18 - Prob. 11RQECh. 18 - Prob. 12RQECh. 18 - Prob. 13RQECh. 18 - Prob. 14RQECh. 18 - Prob. 15RQECh. 18 - Prob. 16RQECh. 18 - The STL stack container is an adapter for the...Ch. 18 - Prob. 18RQECh. 18 - Prob. 19RQECh. 18 - Prob. 20RQECh. 18 - Prob. 21RQECh. 18 - Prob. 22RQECh. 18 - Prob. 23RQECh. 18 - Prob. 24RQECh. 18 - Prob. 25RQECh. 18 - Prob. 26RQECh. 18 - Write two different code segments that may be used...Ch. 18 - Prob. 28RQECh. 18 - Prob. 29RQECh. 18 - Prob. 30RQECh. 18 - Prob. 31RQECh. 18 - Prob. 32RQECh. 18 - Prob. 1PCCh. 18 - Prob. 2PCCh. 18 - Prob. 3PCCh. 18 - Prob. 4PCCh. 18 - Prob. 5PCCh. 18 - Dynamic String Stack Design a class that stores...Ch. 18 - Prob. 7PCCh. 18 - Prob. 8PCCh. 18 - Prob. 9PCCh. 18 - Prob. 10PCCh. 18 - Prob. 11PCCh. 18 - Inventory Bin Stack Design an inventory class that...Ch. 18 - Prob. 13PCCh. 18 - Prob. 14PCCh. 18 - Prob. 15PC
Knowledge Booster
Similar questions
- 10) Show the contents of a queue after performing the following operations: ENQUEUE (10)- ENQUEUE (20); DEQUEUE; ENQUEUE (30); ENQUEUE (40); DEQUEUE.arrow_forwardPlease answer question 4.2 the reference question is also given. Please explain how to get the answer with the answer. If can please give answer and explaining as two parts. Thank you.arrow_forwardPlease answer the question in image. Please don't add anything extra Thank you.arrow_forward
- Following initial state of a queue is reflecting the implementation of a circular array. The front and back pointers are shown on the queue. 67 32 45 b. enqueue(95) c. dequeue front Show the queue state after each of the following operations with updating front and back pointers as required: a. enqueue(23) d. dequeue e. enqueue(11) f. dequeue g. dequeue h. dequeue 44 backarrow_forwardQ1- Write a program that create two objects (C, D) from the queue class and do the following: Add 100 elements to queue C by results of muiplication table from (1 to 10) Add 10 elements to queue D by summation the results of cach table alone.arrow_forwardC++ ProgrammingActivity: Queue Linked List Explain the flow of the code not necessarily every line, as long as you explain what the important parts of the code do. The code is already correct, just explain the flow. SEE ATTACHED PHOTO FOR THE PROBLEM #include "queue.h" #include "linkedlist.h" class SLLQueue : public Queue { LinkedList* list; public: SLLQueue() { list = new LinkedList(); } void enqueue(int e) { list->addTail(e); return; } int dequeue() { int elem; elem = list->removeHead(); return elem; } int first() { int elem; elem = list->get(1); return elem;; } int size() { return list->size(); } bool isEmpty() { return list->isEmpty(); } int collect(int max) { int sum = 0; while(first() != 0) { if(sum + first() <= max) { sum += first();…arrow_forward
- With the concepts of Queue Data Structure, write the functions performing the following tasks: 1. Insertion of an element in the Queue i.e. enqueue() 2. Deletion of an Element from the Queue i.e. dequeue() 3. Display All Elements in the Queue i.e. dispqueue() 4. Display the Element at the Front i.e. dispfront() 5. enqueue() the Queue with the elements in ascending order. After that, use the above four functions to display the same elements in the Queue in descending order.arrow_forwardQueue Simulation Create a java program that will simulate Queue operations using 1-D array representation.Each operation is dependent from each other and it's carried out in the next question in a sequential order. Given: A Queue with 10 elements.arrow_forwardHello Kindly Find the attached question Thank youarrow_forward
- Radix Sorting Algorithm In C++, implement the radix sorting algorithm using a queue class.Steps: Create a queue filled with 10 random integers between 1000 and 9999. Next, create a list of 10 empty queues (0-9 digit bins), then dequeue each number from the main queue and enqueue them into the correct digit bin. Dequeue the numbers from each digit bin in order and enqueue them back into the main queue. Repeat the process for every digit (tens, hundreds, thousands, etc.) Finally, print the sorted list.arrow_forwardQueues Problem 4arrow_forward17 T OR F The QueueInterface interface represents a contract between the implementer of a Queue ADT and the programmer who uses the ADT.arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
C++ Programming: From Problem Analysis to Program...Computer ScienceISBN:9781337102087Author:D. S. MalikPublisher:Cengage Learning
C++ Programming: From Problem Analysis to Program...
Computer Science
ISBN:9781337102087
Author:D. S. Malik
Publisher:Cengage Learning