Stack ADTImplement a program in C++ that has the following three parts and each does the following:1. Implements in C++, the specification of a Stack ADT with all the Main and Helper behaviors (save the file as StackADT.h)2. Implements in C++, all the necessary methods (behavior) of the StackADT (save the file as StackADT.cpp)3. Implements in C++, a main function (the client or application program) that creates and uses Stack objects (save the file as StackMain.cpp). Thismain function should be able to do the following:a. It should be able to read a given text file as input,b. It should be able to get each input value from the input file (one word at a time) and store it (push) on the StackADT object until it stores allthe words from the input file.c. It should be able to retrieve an item from the stack and 1) display it on the screen, as well as 2) write it to an output file, and then delete (pop)that item from the stack, and repeat this process 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 ('StackADT.h', 'StackADT.cpp', and 'StackADTMain.cpp")• Make sure all the code statements are commented.• Make sure your program is indented properly.

In the C++ Code written below, the push() function takes an argument value and makes sure it is to…

Answered: Implement a program in C++ that has the…

Engineering

Computer Science

Implement a program in C++ that has the following three parts and each does the following:

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

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…
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…
Modify the C++ class for the abstract stack type shown belowto use a linked list representation and test it with the same code thatappears in this chapter. #include <iostream.h>class Stack {private: //** These members are visible only to other//** members and friends (see Section 11.6.4)int *stackPtr;int maxLen;int topSub;public: //** These members are visible to clientsStack() { //** A constructorstackPtr = new int [100];maxLen = 99;topSub = -1;}~Stack() {delete [] stackPtr;}; //** A destructorvoid push(int number) {if (topSub == maxLen)cerr << "Error in push--stack is full\n";else stackPtr[++topSub] = number;}void pop() {if (empty())cerr << "Error in pop--stack is empty\n";else topSub--;}int top() {if (empty())cerr << "Error in top--stack is empty\n";elsereturn (stackPtr[topSub]);}int empty() {return (topSub == -1);} }
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.
write in c++ Given the class declaration (from a .h file) for a stack (or queue) implemented as a static array (or linked list), implement certain stack or queue functions (push, pop, enqueue, dequeue, isFull, isEmpty, constructor, destructor) any class just need an example
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"; }…
Write a program in C that implements a stack data structure with the following functionalities: Push an element onto the stack. Pop an element from the stack. Peek at the top element of the stack without removing it. Check if the stack is empty. Display the elements of the stack. Your program should use dynamic memory allocation to create the stack and should not use any pre-built stack libraries or functions. To test your program, write a main function that creates a stack, pushes some elements onto it, pops some elements from it, peeks at the top element, checks if the stack is empty, and displays the elements of the stack. Make sure to handle any potential errors that may occur, such as trying to pop from an empty stack or trying to push onto a full stack.
Code in C, Implement a C program using the stack and queue operations Code a stack and queue test driver. A test driver is a program created to test functions that are to be placed in a library. Its primary purpose is to completely test functions; therefore, it has no application use. The functions to be tested are push stack, pop stack, enqueue, and dequeue. You may include other stack and queue functions as required. All data should be integers. You need two stacks and two queues in the program, as described below. a. Input stack: used to store all user inputb. Input queue: used to store all user inputc. Output stack: used to store data deleted from input queued. Output queue: used to store data deleted from input stack Use a menu-driven user interface that prompts the user to select either insert or delete. If an insert is requested, the system should prompt the user for the integer to be inserted. The data are then inserted into the input stack and input queue. If a delete is…
Please answer the following question in Python code: Inheritance (based on 8.38) You MUST use inheritance for this problem. A stack is a sequence container type that, like a queue, supports very restrictive access methods: all insertions and removals are from one end of the stack, typically referred to as the top of the stack. A stack is often referred to as a last-in first-out (LIFO) container because the last item inserted is the first removed. Implement a Stack class using Note that this means you may be able to inherit some of the methods below. Which ones? (Try not writing those and see if it works!) Constructor/_init__ - Can construct either an empty stack, or initialized with a list of items, the first item is at the bottom, the last is at the top. push() – take an item as input and push it on the top of the stack pop() – remove and return the item at the top of the stack isEmpty() – returns True if the stack is empty, False otherwise [] – return the item at a given…
Code in C Using the Project Name – StackLink which includes Stack.h, Stack.c, main.c. Implement a Stack using a Linked-list A Stack is a last-in-first-out (LIFO data Structure)// data structure LIFOtypedef char stackItem;Stack newStack();void freeStack(Stack s);void push(Stack s,stackItem item); // insert at the top - pushvoid pop(Stack s); // deleting the top element - popstackItem stackTop(Stack s); // returns the top itemint isEmpty(Stack s);void display(Stack s);1. Implement a Stack using a linked-list.2. Use the stack in making a program that will check whether a string containsbalance symbols [], {}, (). The algorithm works like this – an open symbol -- ( , { , [-- is pushed on the stack. When a closed symbol -- ], }, ) – is encountered, checkthe top of the stack to see if the matching open symbol is there, if yes, pop thestack, otherwise, mismatch. At the end of the string, the stack should be empty.
3.Write a generic class called GenericStack<T> that represents a stack structure. A stack structure follow the strategy last-in-first-out, which means that the last element added to the stack, is the first to be taken out. The GenericStack class has the following attributes and methods: --An attribute ArrayList<T> elements which represents the elements of the stack.(All of you refer collection framework for ArrayList. or you can use an array to hold the elements of Stack.)[Refer the following links to have intro on ArrayList: https://www.w3schools.com/java/java_arraylist.asp, https://www.geeksforgeeks.org/arraylist-in-java/] --A constructor that creates the ArrayList or an Array --A method push(T e) which adds the element to the ArrayList<T> or array. --A method pop() which removes the last element of the ArrayList<T> (last element added), if the list is not already empty and returns it. --A method print() which prints the elements of the stack starting from the…