You need to insert the numbers2,4,3,7, one at a time in that order into to an initially empty queue. Represent that process using the standard constructors EmptyQueue and push. Show, in the standard two-cell notation, the resulting queue. What is the result of the operation top on that queue? What is the result of the operation pop on the original queue you created? What is the result of the operation pop followed by pop followed by top on the original queue you created?

You need to insert the numbers2,4,3,7, one at a time in that order into to an initially empty queue. Represent that process using the standard constructors EmptyQueue and push. Show, in the standard two-cell notation, the resulting queue. What is the result of the operation top on that queue? What is the result of the operation pop on the original queue you created? What is the result of the operation pop followed by pop followed by top on the original queue you created?

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter18: Stacks And Queues

Section: Chapter Questions

Problem 16PE: The implementation of a queue in an array, as given in this chapter, uses the variable count to...

See similar textbooks

Similar questions

Write a method to find the largest number in a given queue. The Objects in the queue are integers. You are using the standard Queue class that we discussed in this course. The Queue class has all the standard queue methods, such as, enqueue, dequeue, size, and dequeueAll. The Queue object, q, in the parameter of the method must contain the same elements in the same sequence before leaving the method as they were when entering the method. You are not allowed to use any temporary container (such as another queue, or a stack, or an array, or a linked list.) You can create variables of primitive data types (such as, an integer.) You must use the following header. public int largestNum(Queue q){
Create a new Java class in a file named "ListPQ.java" that implements the Queue interface and uses the LinkedList provided by the JCF to implement a priority queue. Note that LinkedList does not automatically order values based on priority, so it will be up to you to make sure that values are removed in priority order. You should try to implement your priority queue as efficiently as possible - basic operations should run in constant or linear time. Your priority queue need only work with integers. Do not modify any of the provided code. //This is ArrayHeap (provided code) import java.util.Arrays; public class ArrayHeap implements Heap { private int[ ] array; private int size; public ArrayHeap() { array = new int[3]; size = 0; } @Override public void add(int value) { // add pt 1 if(size == array.length) { array = Arrays.copyOf(array, size*2); } array[size] = value; // sifting up int child = size; int parent = (child - 1) / 2; while(array[parent] > array[child]) { swap(parent,…
Please, help me to do this in Java. Create a program to view the waiting list. The list (5 entries) is created in the program and is an object of the LinkedList class. The list entry is a QueuePerson object that contains the queue's last name, first name, and patronymic fields (of type String), an AddressValue field for the queue's address, and queue priority (int type). In turn, the field of the AddressValue type contains three fields of the String type: the name of the city, the name of the street and the house number, as well as an int type field - the apartment number (if the apartment number is 0, the house in which the subject lives does not have apartments). Entries in the queue are sorted according to priority, and the queue is added last in the queue of its priority. Provide the possibility of receiving so that there is no repetition in the queue by the name of the person on the waiting list, for which use TreeSet.
Write a program for the implementation of a queue using singly linked list. The elements of the queue should be strings of length at most 20 characters. Print the queue and do the following operations on the created queue : (a) Insert a new element. (b) Delete an element from the queue.
The implementation of a queue in an array, as given in this chapter, uses the variable count to determine whether the queue is empty or full. You can also use the variable count to return the number of elements in the queue. On the other hand, class linkedQueueType does not use such a variable to keep track of the number of elements in the queue. Redefine the class linkedQueueType by adding the variable count to keep track of the number of elements in the queue. Modify the definitions of the functions addQueue and deleteQueue as necessary. Add the function queueCount to return the number of elements in the queue. Also, write a program to test various operations of the class you defined.
in java Write a method for the Linked Based List class which returns the largest item in the list. If the list is empty return null. Assume that class T is Comparable.DO NOT USE ANY OTHER METHODS OF THE LINKED BASED LIST CLASS. What is the worst case and best case complexity of the code in the previous problem? Explain your answer.
QUESTION 9 Write a complete Java program to implement a QUEUE in a bank using LinkedList class as follows: • Provide the menu as shown below; use an infinite loop; stop when user opts 4. 1. Add a customer 2. Remove a customer 3. Show the queue 4. Exit • Add a customer should add an int number at the end of queue using the method addLast(). • Remove a customer should delete the int from front using the method removeFirst(). Show the queue should display the numbers in queue using the method System.out.printIn(). For the toolbar, press ALT+F10 (PC) or ALT+FN+F10 (Mac).
Write the code to delete a node in the middle of a list implemented as a linked list with the dummy node (see Exercise 3). Compare your answer with the answer to Exercise 3. Are they the same? What do you conclude? Does the dummy node simplify the operation on the list? How?
Consider the following functions are called for an integer queue in order. What will be the final state of the queue after these operations?CreateQueue(Q);Enqueue(9, Q);Enqueue(1, Q);Dequeue(&x, Q);Enqueue(4, Q);ClearQueue(Q);Enqueue(1, Q);QueueGetFront(&x, Q);Enqueue(7, Q);Dequeue(&x, Q);Enqueue(9, Q);Enqueue(2, Q);Dequeue(&x, Q);Enqueue(3,Q);
CODE IN JAVA You have probably heard about the deque (double-ended queue) data structure, which allows for efficient pushing and popping of elements from both the front and back of the queue. Depending on the implementation, it also allows for efficient random access to any index element of the queue as well. Now, we want you to bring this data structure up to the next level, the teque (triple-ended queue)!
Write a program that implement a FIFO queue integer numbers using a double linked list as its underlying physical data structure. Use LFIFOQuequeClass as its name and define a testing class to test it.. (Note, do not include methods in the double linkedlist that will not be used by your program)
You want to buy a ticket for a well-known concert which is happening in your city. But the number of tickets available is limited. Hence the sponsors of the concert decided to sell tickets to customers based on some priority. A queue is maintained for buying the tickets and every person is attached with a priority (an integer, 1 being the lowest priority). The tickets are sold in the following manner - 1. The first person (pi) in the queue requests for the ticket. 2. If there is another person present in the queue who has higher priority than pi, then ask pi to move at end of the queue without giving him the ticket. 3. Otherwise, give him the ticket (and don't make him stand in queue again). Giving a ticket to a person takes exactly 1 minute and it takes no time for removing and adding a person to the queue. And you can assume that no new person joins the queue. Given a list of priorities of N persons standing in the queue and the index of your priority (indexing starts from 0). Find…