There is a producer who manufactures chocolate and a consumer who consumes that chocolate. Both producer and consumer maintains a stack. The stack on producer side keeps the track of variety of chocolate produced by the producer. The stack on consumer side keeps the track of particular variety of chocolate consumed by the consumer. Write a program which print '1' if the producer produces more chocolate of a particular variety than consumer consumes it and print '0' if any variety of chocolate produced is less than the consumption by the consumer for that particular variety.

There is a producer who manufactures chocolate and a consumer who consumes that chocolate. Both producer and consumer maintains a stack. The stack on producer side keeps the track of variety of chocolate produced by the producer. The stack on consumer side keeps the track of particular variety of chocolate consumed by the consumer. Write a program which print '1' if the producer produces more chocolate of a particular variety than consumer consumes it and print '0' if any variety of chocolate produced is less than the consumption by the consumer for that particular variety.

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 3PE

See similar textbooks

Similar questions

Draw a stack: We start with an empty stack and then execute the following commands: push 4 push 7 pop push 5 push 5 push 8 push 7 push 8 pop pop pop push 7 push 6 pop pop push 8
In C++, Write a program which is menudriven ( i) Push, ii) POP, iii) Peek iv) Print). It will create a stack ofinteger type data. You have to implement the following operations.a. Push (Insert a data to the stack)b. Pop (Print the data at the TOP and remove thedata)c. Peek (Print the data at the TOP)d. Print (Print the whole stack)
Design and implement an application that reads a sentence fromthe user and prints the sentence with the characters of each wordbackwards. Use a stack to reverse the characters of each word.8. Pop the infix expression off the stack and print it.
In the following code, assume myStack is a stack that holds integers. What would be the contents of the stack after the following operations, indicating what element is currently at the top and the bottom of the stack. myStack.push(1);myStack.push(2);myStack.push(3);myStack.pop();myStack.push(4);myStack.push(5);myStack.pop(); Group of answer choices 4 <- Top21 <- Bottom 5 <- Top31 <- Bottom 4 <- Top32 <- Bottom 5 <- Top21 <- Bottom
The following operations are performed on a stack:PUSH A, PUSH B, POP, PUSH C, PUSH D, POP, PUSH E, POP, POP, PUSH FWhat does the stack contain after the PUSH F?a. Fb. A B C D E Fc. A C Fd. A Fe. none of the above.
Design and implement an application that reads a sentence fromthe user and prints the sentence with the characters of eachword backwards. Use a stack to reverse the characters of eachword.
4-) Below is a program written in order to perform a task, trace the program and provide comments for the code. In a few sentences, describe what does the program do? and show the result of the execution: #include <iostream> #include <cstring> #include <stack> using namespace std; #define maxchars 100// int main() { char input_str[maxchars+1], *p; stack<double> num_stack; int c; double a, b, n; cout << "Enter string: "; cin.getline(input_str, maxchars); p = strtok(input_str, " "); while (p) { c = p[0]; if (c == '+' || c == '*' || c == '/' || c == '-') { if (num_stack.size() < 2) { cout << "Error: too many ops." << endl; system("pause"); return -1; } b = num_stack.top(); num_stack.pop();…
Create an application that reads a statement from the user and outputs it with the characters of each word reversed. To reverse the characters in each word, use a stack.Create an application that reads a statement from the user and outputs it with the characters of each word reversed. To reverse the characters in each word, use a stack.
A group of students writes their names and unique student ID numbers on sheets of paper. The sheets are then randomly placed in a stack. Their teacher is looking to see if a specific ID number is included in the stack. Which of the following best describes whether their teacher should use a linear or a binary search? a. The teacher could use either type of search though the binary search is likely to be faster b. The teacher could use either type of search though the linear search is likely to be faster c. Neither type of search will work since the data is numeric d. Only the linear search will work since the data has not been sorted
Create a TestStack project. Add a Stack class with all of the methods implemented and commented (constructor, push, pop, is empty, clear, peek, toString). Create a TestStack class with main(). main() should use your Stack class to do one of the following: OPTION A) Use your stack class to reverse a user inputted string. A palindrome is a word that reads the same backwards as it does forwards. For example, madam is a palindrome, hello is not. Use your stack class to test if an input string is a palindrone or not. OPTION B) Use your new Stack to add a function that checks for balanced parenthese in an equation. Use these three equations, plus one of your own to test your code. ((3^2 + 8)*(5/2))/(2+6) ((3^2 + 8)*(5/2))/(2+6)) (((3^2 + 8)*(5/2)/(2+6) When encountering a left parenthese, push it on the stack. Pop one off when you encounter a right parenthese. Return true or false depending if parentheses are balanced or not (stack is empty after last right parenthese causes a…
What will be the stack content after following operations: Push 5 Push 8 Pop Push 1 Push 12 Pop
In a few sentences, describe what does the program do? and show the result of the execution: #include <iostream>#include <cstring>#include <stack>using namespace std;#define maxchars 100 int main(){ char input_str[maxchars+1], *p; stack<double> num_stack; int c; double a, b, n; cout << "Enter string: "; cin.getline(input_str, maxchars); p = strtok(input_str, " "); while (p) { c = p[0]; if (c == '+' || c == '*' || c == '/' || c == '-') { if (num_stack.size() < 2) { cout << "Error: too many ops." << endl; system("pause"); return -1; } b = num_stack.top(); num_stack.pop(); a = num_stack.top(); num_stack.pop(); switch (c) { case '+': n = a + b; break; case '*': n = a * b; break; case '/': n = a / b; break; case…