8. What is the result of the following program execution with the data and operations givenin main( ).void pop){ int item;if(Top == -1){ cout<<"The stack is Empty"<using namespace std;#define MAXSIZE 10void push(int);void pop();void traverse();int stack[MAXSIZE];int Top=-1;int main(){ int x;рop();push(5); push(10); push(20);push(30); push(40);push(55);traverse();pop(); pop();pop); traverse();x=7;push(x); push(x*2);push(3+x);traverse();х-2*(х-1);push(x); push(x*2);push(3+x);traverse();push(100);traverse(); push(101);return 0;else{ item = stack[Top];Тор - Тор-1;}void traverse()int i;if(Top == -1){cout<<"The Stack is Empty"<

Answer is The Stack is Empty 5 10 20 30 40 55 5 10 20 5 10 20 7 14 10 5 10 20 7 14 10 100

8. What is the result of the following program execution with the data and operations gi in main( ). void pop() { int item; if(Top == -1) { cout<<"The stack is Empty"< sing namespace std; define MAXSIZE 10 oid push(int); oid pop(); oid traverse(); at stack[MAXSIZE]; nt Top=-1; nt main() { item = stack[Top]; Тор 3 Тop-1; } } int x; pop(); push(5); push(10); push(20); push(30); push(40);push(55); traverse(); void traverse() { int i; if(Top == -1) { cout<<"The Stack is Empty"<

8. What is the result of the following program execution with the data and operations gi in main( ). void pop() { int item; if(Top == -1) { cout<<"The stack is Empty"< sing namespace std; define MAXSIZE 10 oid push(int); oid pop(); oid traverse(); at stack[MAXSIZE]; nt Top=-1; nt main() { item = stack[Top]; Тор 3 Тop-1; } } int x; pop(); push(5); push(10); push(20); push(30); push(40);push(55); traverse(); void traverse() { int i; if(Top == -1) { cout<<"The Stack is Empty"<

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

4.1 Write a Java program called StackDemo for the following Stack pseudocode and show the output for the remaining elements in the Stack... Plan 1. Create stack st 2. Add the element "Fundamentals" to the stack 3. Add the element of" to the stack 4. Add the element "Programming" to the stack 5. Remove the last item in the stack 6. Print stack st 4.2 Refer to the plan in question 4.1, create a program called Queue demo that indudes a Queue structure called Q1 based on the plan
Consider the following code segment , The variable q is an object of type Queue, the variable s is an object of type Stack. peek method looks at the first element in the queue without removing it. the remove method removes the first element from the queue. add method adds an element to the and of the queue or add an element to the top of the stack. pop method removes an element from the top of the stack What would be the content of the variable q (8 numbers) after we complete the second while loop in the code for (int i = 30; i <= 40; i ++) { if(i % 3 == 0) q.add(i); } while (!q.isEmpty()) { s.add(q.peek()); s.add(q.peek()); q.remove(); } while (!s.isEmpty()) { q.add(s.pop()); }
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] )
Question#3.Write a Python program to reverse a stack using recursion. Problem Solution Hints: 1. Create a class Stack with instance variable items initialized to an empty list. 2. Define methods push, pop, is_empty and display inside the class Stack. 3. The method push appends data to items. 4. The method pop pops the first element in items. 5. The method is_empty returns True only if items is empty. 6. The method display prints the elements of the stack from top to bottom. 7. Define function insert_at_bottom which takes a stack and a data item as arguments. 8. The function insert_at_bottom adds the data item to the bottom of the stack using recursion. 9. Define function reverse_stack which takes a stack as argument. 10. The function reverse_stack reverses the stack using recursion. 11. Create an instance of Stack, push data to it and reverse the stack.
given code #include <stdio.h>#include <stdlib.h> /* typical C boolean set-up */#define TRUE 1#define FALSE 0 typedef struct StackStruct{int* darr; /* pointer to dynamic array */int size; /* amount of space allocated */int inUse; /* top of stack indicator - counts how many values are on the stack */} Stack; void init (Stack* s){s->size = 2;s->darr = (int*) malloc ( sizeof (int) * s->size );s->inUse = 0;} void push (Stack* s, int val){/* QUESTION 7 *//* check if enough space currently on stack and grow if needed */ /* add val onto stack */s->darr[s->inUse] = val;s->inUse = s->inUse + 1;} int isEmpty (Stack* s){if ( s->inUse == 0)return TRUE;elsereturn FALSE;} int top (Stack* s){return ( s->darr[s->inUse-1] );} /* QUESTION 9.1 */void pop (Stack* s){if (isEmpty(s) == FALSE)s->inUse = s->inUse - 1;} void reset (Stack* s){/* Question 10: how to make the stack empty? */ } int main (int argc, char** argv){Stack st1; init (&st1); push…
For the following problems, you need to submit a python code that performs the required functions. Q1: (Stack & Queue) 1. Write a program that utilizes the LinkedStack class and LinkedQueue class to perform the following function. Input :empty stack and a Queue Required: reverse the order of the queue. // you must use the methods of the stack and queue class // Q2) Write a member functions to the class ( CircularQueue ) that performs the followings: 1. Sum-even(CQ) : Print the sum of all even numbers stored in CircularQueue. 2. Perform the followings: a. Create two circular linked lists ( CQ1, CQ2). b. Merge the two circular linked lists in one →CQ1. //Remember: you need to use the class ( CircularQueue ) methods.//
Consider the following statements: stackType<int> stack; int x; Suppose that the input is: 14 45 34 23 10 5 -999 Show what is output by the following segment of code: stack.push(5); cin >> x; while (x != -999) { if (x % 2 == 0) { if (!stack.isFullStack()) stack.push(x); } else cout << "x = " << x << endl; cin >> x; } cout << "Stack Elements: "; while (!stack.isEmptyStack()) { cout << " " << stack.top(); stack.pop(); } cout << endl;
2. Write a program which should contain two stacks (using class template) of static arrays of size5 each, elements of array should be of integer (int) type. User will push values in first stack,when a value will be popped from first stack it should be pushed to second stack. For eachstack you have to check stack overflow and underflow conditions. User may remove an elementfrom second stack as well.
In C++, Write a stack class. The stack class must include at least “push”, “pop”, “top”, “isEmpty”, “isFull” methods. You can implement any additional methods, as they needed. Write your class in stack.h and stack.cpp. The part 1 does not needed to be tested.
Passing Arguments to a FunctionThe sample program in Example 5.4 shows how the stack frame is used to passarguments to a function.The code simply creates some local stack variables, fillsthem with values, and passes them to a function called callex().The callex() function takes the supplied arguments and prints them to the screen.Example 5.4 Stack and Passing Parameters to a Function/* stack2.c */#include <stdlib.h>#include <stdio.h>int callex(char *buffer, int int1, int int2){/* This prints the input variables to the screen:*/printf("%s %d %d\n",buffer,int1, int2);return 1;}int main(int argc, char **argv){Stack Overflows • Chapter 5 173 char buffer[15]="Hello Buffer"; /* a 15-byte character bufferwith12 characters filled/*int int1=1, int2=2; /* two four-byte integers */callex(buffer,int1,int2); /*call our function*/return 1; /*leaves the main function*/}You need to compile this example in MSVC in a console application inRelease mode or in GCC without optimizations. Example…
1. a) Using the stack diagram, convert the following infix expression to a postfix expression. A* (B – C + D) – E / F b) Referring to question 1 (a), give the value of postfix expression by using the stack concept if provided: A=2, B=3, C=8, D=10, E=10 and F=2
I am writing a stack code, where there are two stacks that reads an array of 40 numbers and puts them in ascending and descending order. I put my code on the bottom. The requirements of the code was to write the stack functions using arrays, but whenever i run the code it does not work. However, if use stack in built function the code works. Help me please. PS: I Attached the code requirements. struct Stack1 { int *arr; int NextIndex; int capacity; Stack1() { capacity = 20; arr = new int[capacity]; NextIndex = 0; } int size () { return NextIndex; } bool isEmpty() { if (NextIndex == 0) { return true; } else return false; } void push(int ele) { if (NextIndex == capacity) { int *newArr = new int[2*capacity]; for(int i = 0; i < capacity; i++) {…