Write a program to implement a stack to store the objects of “employee” class. “employee” class should contain attributes (privately defined) emp_id (string), name (string), age (int). “employee” class should also contain member functions (publicly defined); constructor, input and output functions. You are required to design two stack class, one should use static array and other one should use dynamic array implementation. Your stack classes should contain constructors, destructors (if required), push and pop operations and functions to check empty or full stack.

Write a program to implement a stack to store the objects of “employee” class. “employee” class should contain attributes (privately defined) emp_id (string), name (string), age (int). “employee” class should also contain member functions (publicly defined); constructor, input and output functions. You are required to design two stack class, one should use static array and other one should use dynamic array implementation. Your stack classes should contain constructors, destructors (if required), push and pop operations and functions to check empty or full stack.

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter17: Linked Lists

Section: Chapter Questions

Problem 10PE

See similar textbooks

Similar questions

Assume class StackType has been defined to implement a stack data structure as discussed in your textbook (you may also use the stack data structure defined in the C++ STL). Write a function that takes a string parameter and determines whether the string contains balanced parentheses. That is, for each left parenthesis (if there is any) there is exactly one matching right parenthesis later in the string and every right parenthesis is preceded by exactly one matching left parenthesis earlier in the string. e.g. abc(c(x)d(e))jh is balanced whereas abc)cd(e)(jh is not. The function algorithm must use a stack data structure to determine whether the string parameter satisfies the condition described above. Edit Format Table 12pt v Paragraph v |BIU A v ev T? WP O words ....
for c++ Instructions Two stacks of the same type are the same if they have the same number of elements and their elements at the corresponding positions are the same. Overload the relational operator == for the class stackType that returns true if two stacks of the same type are the same; it returns false otherwise. Also, write the definition of the function template to overload this operator. Write a program to test the various overloaded operators and functions of class stackType.
Problem 2: Assume that the methods push(), pop() and isEmpty() methods are defined as they should be in a Stack class. Assume further that the Stack class has a no argument constructor. Write a method that uses the constructor and the methods push(), pop() and isEmpty() for removing and returning the bottom element of a given stack. Note: make sure that you don't include unnecessary spaces in your answers! public T popBottom(Stack stack) { Stack tempStack = new Stack(); Tx = null; if (!stack.isEmpty()) { x = stack.pop(); } while (!stack.isEmpty()) { #04 ; x = stack.pop(); } while (!tempStack.isEmpty()) { #05 ; } return x; }
In c++ Also add comments explaining each line
Rewrite the interface file, the implementation file, and the application filefor the Stack class (Program 1, Program 2, and Program 3) without usingthe List class object as the data member (for example, you can use an arrayas the data member).
Computer science JAVA programming language
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…
Java - For 7 and 8 use the following definition: class node { boolean data; node link; } 7. Consider a structure using a linked list in which you added and removed from the back of the list. Using the node definition above, write the pseudocode for a member method “add” to this structure. Assume the existence of a “front” and “back” reference. 8. Assume you are working with a stack implementation of the linked list definition above (above question #7), write a member method “pop”. The method should return a value (in the “popped” node). Assume the existence of the node references called “TheStack” and “Top”. These references point to the start (or bottom) and top of the stack (or back of the list).
C++ code Stack Implementation using Variable-sized Dynamic Arrays2. Stack Implementation using Linked Lists3. The applications of Stacks1. Implement a template-based stack using a variable-sized dynamic array. When the array getsfull, double its size before insertion of new elements. When array contains data lesser than33% of its size, reduce its size to half. The required member methods are:T* arr: array containing data elements of stackint capacity: stores the capacity of stack.int getCout(): returns total elements stored in the stack.bool isEmpty(): returns true if the stack is empty else false.bool isFull(): returns true if the stack is full.bool top(): returns, but does not delete, the topmost element from the stack via theparameter passed by reference, and returns true via the return statement. If there is noelement, it returns false via the return statement.bool pop(): deletes the top most element from the stack and returns true via the returnstatement. If there is no element,…
1 Implement a Queue Data Structure specifically to store integer data using a Singly Linked List. 2 The data members should be private. 3 You need to implement the following public functions: 4 1. Constructor: 5 It initialises the data members as required. 6 7 8 2. enqueue(data) : This function should take one argument of type integer. It enqueues the element into the queue and returns nothing. 3. dequeue(): It dequeues/removes the element from the front of the queue and in turn, returns the element being dequeued or removed. In case the queue is empty, it r 4. front (): 10 11 It returns the element being kept at the front of the queue. In case the queue is empty, it returns -1. 12 5. getSize(): 13 It returns the size of the queue at any given instance of time. 14 6. 1sEmpty(): 15 It returns a boolean value indicating whether the queue is empty or not. 16 Operations Performed on the Stack: 17 Query-1 (Denoted by an integer 1): Enqueues an integer data to the queue. 18 19 Query-2…
Language: C++ Note: Write both parts separately. Part a: Complete the above Priority Queue class. Write a driver to test it. Part b: Modify the above class to handle ‘N’ different priority levels
Create a class called stack for storing integers and compare it to the STL implementation of C++. Create a program which will first invoke/call Stack functions using your own implementation and then the functions from the STL Stack instance. The data members are an integer array for storing the integers and an integer for storing the top of stack ( tos ). Include member functions for initializing tos to 0, pushing an element to the stack and for popping an element from the stack. The push() function should check for "stack overflow" and pop() should check for "stack underflow". Do the same for Queue and submit the codes and output. observe/analyze enqueue and dequeue and write your observations about wrap around.