// the language is c++, please code with common for better understanding, and after your code finished take a screenshot of the execution. Write a C++ program to simulate a stack using an array. You should create an index (the stack pointer) to point into the stack. Initialize it to 0. The stack should grow to location [1], [2], [3], etc. Write a "push (int)" function to push an int onto the top of the stack. Also, write an "int pop" instruction to pop the data that is stored on the top of the stack. The pop instruction must return the popped data. The push and pop instructions should increment and decrement the stack pointer appropriately. Your source should contain calls to your functions demonstrating that it works. Note, that you should do several pushes and several pops to show that data is correctly stored on the stack. You can do this by showing sample runs. Cut and paste the results of the runs into a separate document

// the language is c++, please code with common for better understanding, and after your code finished take a screenshot of the execution. Write a C++ program to simulate a stack using an array. You should create an index (the stack pointer) to point into the stack. Initialize it to 0. The stack should grow to location [1], [2], [3], etc. Write a "push (int)" function to push an int onto the top of the stack. Also, write an "int pop" instruction to pop the data that is stored on the top of the stack. The pop instruction must return the popped data. The push and pop instructions should increment and decrement the stack pointer appropriately. Your source should contain calls to your functions demonstrating that it works. Note, that you should do several pushes and several pops to show that data is correctly stored on the stack. You can do this by showing sample runs. Cut and paste the results of the runs into a separate document

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

WRITE A PROGRAM IN JAVA FOR THE FOLLOWING QUESTION You are to design a simple calculator using the stack data structure to perform additions, subtractions, multiplications and divisions. The user may enter ANY* arithmetic expression in infix using numbers, parentheses and arithmetic operations (+, -, *, /). After an expression is entered, its postfix or prefix notation is displayed and then the result of the expression.
Can anyone convert this c++ code to python? //THIS PROGRAM IS CREATED TO DEMONSTRATE THE OPERATIONS PERFORMED ON STACK & ITS IMPLEMENTATION USING ARRAYS #include <iostream>#include <stdio.h>#include <conio.h>#include <stdlib.h>#include <process.h> //Defining the maximum size of the stack#define MAXSIZE 7 using namespace std; //A class initialized with public and private variables and functionsclass STACK_ARRAY { int stack[MAXSIZE]; int Top; public: //constructor is called and Top pointer is initialized to -1 when an object is created for the class STACK_ARRAY() { Top = -1; } void push(); void pop(); void traverse(); }; //This function will add/insert an element to Top of the stackvoid STACK_ARRAY::push(){ int item; //if the top pointer already reached the maximum allowed size then we can say that the stack is full or overflow if (Top == MAXSIZE-1) { cout << "\nThe Stack Is Full"; }…
Can anyone convert this c++ code to python? //THIS PROGRAM IS CREATED TO DEMONSTRATE THE OPERATIONS PERFORMED ON STACK & ITS IMPLEMENTATION USING ARRAYS #include <iostream>#include <stdio.h>#include <conio.h>#include <stdlib.h>#include <process.h> //Defining the maximum size of the stack#define MAXSIZE 7 using namespace std; //A class initialized with public and private variables and functionsclass STACK_ARRAY { int stack[MAXSIZE]; int Top; public: //constructor is called and Top pointer is initialized to -1 when an object is created for the class STACK_ARRAY() { Top = -1; } void push(); void pop(); void traverse(); }; //This function will add/insert an element to Top of the stackvoid STACK_ARRAY::push(){ int item; //if the top pointer already reached the maximum allowed size then we can say that the stack is full or overflow if (Top == MAXSIZE-1) { cout << "\nThe Stack Is Full"; }…
IN C In this question we get a stack of chars. The implementation is given in a separate file. You should not make assumptions about the exact implementation details.You may only use the following functions to access the stack. typedef struct { // not known } stack_t; // creates a new stack stack_t* stack_create(); // pushes a given item to the stack void stack_push(stack_t* s, char item); // removes the top element from the stack and returns it // Pre condition: stack is not empty char stack_pop(stack_t* s); // checks if the stack is empty bool stack_is_empty(stack_t* s); // frees the stack void stack_free(stack_t* s); a) Write a function that gets a stack of chars and returns the number of elements in it. When the function returns, the stacks must be in their initial state. // returns the size of the stackint stack_size(stack_t* s) b) Write a function that gets two stacks of chars and checks if they are equal (i.e., have the same elements in the same order). When the…
Given a Stack class implementation, move first half of the stack to another stack? Merge two LLs into one LL. Split one LL into two LLs based on a condition. Merge two stacks into one stack. Split one stack into two stacks based on a condition. Data Structure C++ Please just write functions only. Dont write whole code
For the code shown in the screenshot below, draw a picture of the program stack when the function findSlope() is called the first time. You only have to draw the part of the stack for findZero() and findSlope().
Please provide code in C language. I need code for staticsemantic.c and staticsemantic.h Please provide code according to local option: You may process all variables using local scope rules, or process variables before program as global and all other variables as local. Software support Implement a stack adapter according to the following Stack item type is String or whatever was your identifier token instance - the stack will process identifiers. You may also store line number or the entire token for more detailed error messaging You can assume no more than 100 items in a program and generate stack overflow if more Interface void push(String); just push the argument on the stack void pop(void); just remove int find(String); the exact interface may change, see below find the first occurrence of the argument on the stack, starting from the top and going down to the bottom of the stack return the distance from the TOS (top of stack) where the item was found (0 if at TOS) or -1 if not…
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++) {…
Implement a program in C++ that has the following three parts and each does the following: Implements in C++ a Stack ADT (save the file as StackADT.h) Implements all the necessary methods (behavior) of a Stack (save the file as StackADT.cpp) Implements in C++ a main function (the client or application program) that creates and uses Stack objects (save the file as StackMain.cpp). This main function should be able to do the following: It should be able to read a given text file as input, It should be able to get each input value from the input file (one word at a time) and store it (push) on the Stack object until it stores all the words from the input file. It should be able to retrieve an item from the stack and display it on the screen, and then delete (pop) that item from the stack, and repeat until it retrieves all the items from the stack object. NOTE: Please make sure you debug, run, test and see the program working correctly before submitting. Submit the files…
Hello, I'd like you to help me solve this exercise in C language, that's all. I would appreciate your kind help. Thank you. Make 2 Stack-type structures by arranging 10 random numbers. For this you must use the function srand (time (NULL)). These numbers are in the range between 0 and 50 using rand () %51. With the data of the 2 Stacks create a Stack-like structure of 20 elements. Write a program with the following menu: Fill in Stack 1 Fill in Stack 2 Chain the Stacks Exit Chain two stacks by placing the elements of the second stack on those of the first.
Use a stack to reverse the input integer values. Check the stack grows as more elements are pushed. Use with and without function pointer in each of the problem (Please give correct answer with explanation)
write a program in C++ , (Postfix Evaluation) Write a program that evaluates a valid postfix expression such as 6 2 + 5 * 8 4 / -The program should read a postfix expression consisting of digits and operators into a string. Using modified versions of the stack functions implemented earlier in this chapter, the program should scan the expression and evaluate it. The algorithm is as follows: While you have not reached the end of the string, read the expression from left to right. If the current character is a digit, Push its integer value onto the stack (the integer value of a digit character is its value in the computer’s character set minus the value of '0' in the computer’s character set). Otherwise, if the current character is an operator, Pop the two top elements of the stack into variables x and y. Calculate y operator x. Push the result of the calculation onto the stack. When you reach the end of the string, pop the top value of the stack. This is the result of the postfix…