Suppose that we would like to implement a queue system for a commercial website. Given that the website offers 3 items for sale (or a list of items), each item has a limit quantity in stock. Implement a queue of customers, each customer can buy only a few number product among the available three items. Determine the item name, their quantity in stock; Specify a queue of n customers, each customer can buy k products from one item (k is different for each customer); Customers take turn to enter (enqueue) and leave (dequeue) the queue according to the FIFO order to purchase wanted products; If a customer successfully purchased products, then display a message and reduce the number of products in stock; otherwise, if the item has been run out, display a warning message. Implement the above problems in C/C++ using a Queue data structur. Write a main function for tes

Suppose that we would like to implement a queue system for a commercial website. Given that the website offers 3 items for sale (or a list of items), each item has a limit quantity in stock. Implement a queue of customers, each customer can buy only a few number product among the available three items. Determine the item name, their quantity in stock; Specify a queue of n customers, each customer can buy k products from one item (k is different for each customer); Customers take turn to enter (enqueue) and leave (dequeue) the queue according to the FIFO order to purchase wanted products; If a customer successfully purchased products, then display a message and reduce the number of products in stock; otherwise, if the item has been run out, display a warning message. Implement the above problems in C/C++ using a Queue data structur. Write a main function for tes

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 program in Python to show how a queue works using empty, size, front, back, push item onto queue, and push item off queue.
Write a program using the queue in the Java language, as it works on entering several random values and then outputs the largest and smallest value entered.
This is a java question Trace through the state of the queue q in the following code fragment in the main method. You need to show the queue with its values for credit. Queue <Integer> q = new ArrayDeque<Integer>( );q.add(14);q.add(-47);q.offer(75);q.poll( );Integer v = q.peek( );q.add( v - 32);q.remove( );q.add(q.poll( ));System.out.println ("q has " + q);System.out.println ("v has " + v); Final Result for q: v:
Write a program in Java to implement a Singly linked list with two fields: String name and Integer Age. a) Then, Program ask user to enter name and age of a student, and add the node in the link list b) Store name and age of 5 students c) Then, traverse the link List to print all the nodes
In this lab the task is to write a program that maintains a personal phone book. The program allows to: ▪ Add and Delete entries from the phone book, ▪ Search the phone book for a specific entry by last name or by phone number, and ▪ Print out the entire entries in the phone book. The data in the phone book is maintained by storing in memory with the use of a singly linked list, with one list node per entry. Each node contains members for storing a person’s family name, first name, address, and the phone number. Use strings to store this information. The linked list must be kept in increasing alphabetical order, sorted by family name. There are no duplicate entries with the same family name allowed in the phone book. This program should be menu driven, with the user being offered a choice of the following commands described below: ▪ Insert a new entry into the phone book. The program should prompt the user for a new family name and first name, an address and a phone number. This…
I am trying to write a program, in JAVA, that will show the output of the following sequence of queue operations: enqueue(5), enqueue(3),dequeue(),enqueue(2),enqueue(8),dequeue(), dequeue(),enqueue(9),enqueue(1),dequeue(),enqueue(7),enqueue(6), dequeue(),dequeue(),enqueue(4),dequeue(),dequeue(),
# Suppose you have a random list of people standing in a queue.# Each person is described by a pair of integers (h, k),# where h is the height of the person and k is the number of people# in front of this person who have a height greater than or equal to h.# Write an algorithm to reconstruct the queue. # Note:# The number of people is less than 1,100. # Example # Input:# [[7,0], [4,4], [7,1], [5,0], [6,1], [5,2]] # Output:# [[5,0], [7,0], [5,2], [6,1], [4,4], [7,1]]. I need code only.
# Suppose you have a random list of people standing in a queue.# Each person is described by a pair of integers (h, k),# where h is the height of the person and k is the number of people# in front of this person who have a height greater than or equal to h.# Write an algorithm to reconstruct the queue. # Note:# The number of people is less than 1,100. # Example # Input:# [[7,0], [4,4], [7,1], [5,0], [6,1], [5,2]] # Output:# [[5,0], [7,0], [5,2], [6,1], [4,4], [7,1]]
Implement a priority queue (for both max and min, one time the bigger numbers should have higher priority, other time the smaller numbers should have higher priority ) in python using a linked list. The priority queue should have four functions, 1/ insert(item, priorityValue), peek(), delete(), changePriority(item, newPriority).
Consider the following statements for a String queue: Queue Q = new Queue(); String x = "", y = ""; Show what is output by the following segment of code. x = "g"; y = "e"; Q.enqueue(x + "8"); Q.enqueue(y); x = Q.front( ); Q.dequeue( ); Q.enqueue(y + "5"); Q.enqueue(x); y = Q.front(); Q.enqueue(y + "9"); System.out.println(“Queue Elements: “ + Q);
Imagine you have an empty Queue of integers, Q, with 5 elements size, and two integer numbers x and y. Draw a picture of Q, x and y after executing the following code:
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.