Write the program by completing the main program that doesthe following:1. Call the push function three times.2. Prints out the updated stack3. Calls the pop function once4. Print the updated stack again.No need to write the algorithm for this problem, it is already given to you.#include <stdio.h>#define STACK_EMPTY '0'#define STACK_SIZE 20voidpush(char stack[], /* input/output - the stack */char item, /* input - data being pushed onto the stack */int *top, /* input/output - pointer to top of stack */int max_size) /* input - maximum size of stack */{if (*top < max_size-1) {++(*top);stack[*top] = item;}}charpop (char stack[], /* input/output - the stack */int *top) /* input/output - pointer to top of stack */{char item; /* value popped off the stack */if (*top >= 0) {item = stack[*top];--(*top);} else {item = STACK_EMPTY;}return (item);}intmain (void){char s [STACK_SIZE];int s_top = -1; // stack is empty/* complete the program here */return (0);}

Write the program by completing the main program that doesthe following:1. Call the push function three times.2. Prints out the updated stack3. Calls the pop function once4. Print the updated stack again.No need to write the algorithm for this problem, it is already given to you.#include <stdio.h>#define STACK_EMPTY '0'#define STACK_SIZE 20voidpush(char stack[], /* input/output - the stack /char item, / input - data being pushed onto the stack /int top, /* input/output - pointer to top of stack /int max_size) / input - maximum size of stack /{if (top < max_size-1) {++(top);stack[top] = item;}}charpop (char stack[], /* input/output - the stack /int top) /* input/output - pointer to top of stack /{char item; / value popped off the stack /if (top >= 0) {item = stack[top];--(top);} else {item = STACK_EMPTY;}return (item);}intmain (void){char s [STACK_SIZE];int s_top = -1; // stack is empty/* complete the program here */return (0);}

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 1TF

See similar textbooks

Similar questions

Code in C One of the applications of a stack is to backtrack - that is, to retrace its steps. As an example, imagine we want to read a list of items, and each time we read a negative number we must backtrack and print the five numbers that come before the negative number and then discard the negative number. Use a stack to solve this problem. Use a stack and push them into the stack (without printing them) until a negative number is read. At this time, stop reading and pop five items from the stack and print them. If there are fewer than five items in the stack, print an error message and stop the program. After printing the five items, resume reading data and placing them in the stack. When the end of the file is detected, print the message and the items remaining in the stack. Sample Output 1 2 3 4 5 6 7 -1 7 6 5 4 3 9 6 4 3 -2 3 4 6 9 2 -3 Number of items left is less than five! Program is terminating! Project name : Backtrack Filenames: backtrack.h, backtrack.c,…
(Printing a Sentence in Reverse Order with a Stack) Write a program that inputs a line of text and uses a stack object to print the line reversed.
In this program the "Size of stack " make a null please.For example "Size of stack = 0". #include <iostream>#include <stack> using namespace std; int main(){ stack<int> s; //declare a stack for(int i=1;i<=8;i++) //for 8 times { int input; cout << "Enter an element to be pushed: "; cin >> input; //read input s.push(input); //push input to stack } cout << "Size of stack = " << s.size() << endl; //print size cout << "Top element = " << http://s.top() << endl; //print top s.pop(); //remove top element cout << "Top element after deletion = " << http://s.top() << endl; //print top return 0;}
You are given N elements and your task is to Implement a Stack in which you can get a minimum element in O(1) time. Example 1: Input: push(2) push(3) pop() getMin() push(1) getMin() Output: 2 1 Explanation: In the first test case for query push(2) Insert 2 into the stack. The stack will be {2} push(3) Insert 3 into the stack. The stack will be {2 3} pop() Remove top element from stack Poped element will be 3 the stack will be {2} getMin() Return the minimum element min element will be 2 push(1) Insert 1 into the stack. The stack will be {2 1} getMin() Return the minimum element min element will be 1.
Machine organization The following operations are performed on a stack: PUSH A, PUSH B, POP, PUSH C, POP,POP,PUSH D, PUSH E, POP, PUSH F. What does the stack contain after each operation?
# cannot contain syntax error # stack class class Stack:def __init__(self, iL=[]):self.aList = iL[:] def push(self, newElem:int):"""push a new element on top"""self.aList.append(newElem) def pop(self)->int:"""return top item"""return self.aList.pop() def empty(self):"""Is the stack empty?"""return self.aList == [] def __repr__(self):return repr(self.aList) # use only the above stack methods to define a function to# delete an item x from a stack, (only one x (the upper one) is to be deleted)# keep the order of the remaining items in the stack unchanged# can change orginal stack# return a new stack def delx(sk:Stack, x:'item')-> Stack: #Code goes here if __name__ == "__main__": #Testing code here
A letter means push and an asterisk means pop in the following sequence. Give the contents of s[0], ..., s[4] after the execution of this sequence of operations performed on an initially empty LIFO stack. L A * S T I * N * F I R * S T * * O U * T * * * * * *
Consider the following stack, which can be written as [70, 10, 50, 80, 20] i.e. the "top" of the stack is the first element in the list Consider the following code (written as pseudocode): myfunction( stack1 ) stack2 = createStack() while stack1 is NOT empty value = top(stack1) pop(stack1) while stack2 is NOT empty and top(stack2) > value push(stack1, top(stack2)) pop(stack2) push(stack2, value) print(stack2) // Prints the current stack as [element_1, element_2, ..., element_n] return stack2 From the answers below, select the correct output for the first 4 print statements if myFunction is executed with: myFunction( [ 70, 10, 50, 80, 20] )
54. What is the difference between the top and pop operations of a stack? Group of answer choices The top operation removes the top item of the stack. The pop operation returns a reference to the top item on the stack and remove it. The top operation removes the top item of the stack. The pop operation returns a reference to the top item on the stack without removing it. The pop operation removes the top item of the stack. The top operation returns a reference to the top item on the stack without removing it. The pop and top operations are doing the same thing which removes the top item of the stack. The pop operation removes the top item of the stack. The top operation returns a reference to the top item on the stack and remove it.
stack.h is in picture this is stack.c#include <stdlib.h>#include <stdio.h>#include <string.h>#include <assert.h>#include "stack.h"void push(Stack **q, char *word) {// IMPLEMENT}char *pop(Stack *q) {// IMPLEMENT}void print(Stack *q) {// IMPLEMENT}int isEmpty(Stack *q) {// IMPLEMENT}void delete(Stack *q) {// IMPLEMENT}/***** Expected output: *****No itemsabcabcdefNo itemss = Worldt = Hello*****************************/int main(int argc, char **argv){Stack *q = NULL;// print the stackprint(q);// push itemspush(&q, "a");push(&q, "b");push(&q, "c");print(q);// pop itemswhile (!isEmpty(q)) {char *item = pop(q);printf("%s\n", item);free(item);}char *item = pop(q);assert(item == NULL);// push againpush(&q, "d");push(&q, "e");push(&q, "f");print(q);// destroy the stackdelete(q);// print againprint(q);// check copychar *s = (char *)malloc(10);strcpy(s, "Hello");push(&q, s);strcpy(s, "World");char *t = pop(q);printf("s = %s\n", s);printf("t =…
Suppose you have a stack with a maximum size of 1000 elements and you want to perform the following operations: Push 500 elements onto the stack. Pop 200 elements from the stack. Push 800 elements onto the stack. Pop all remaining elements from the stack. What is the final size of the stack after performing all these operations?
Can you explain in detail, line by line, what the attached algorithm is doing? I need further understanding. For further clarification the prompt asks the following: Write an algorithm Replace that takes a stack and two items. If the first item is in the stack, replace it with the second item, leaving the rest of the stack unchanged.