1. A company wants to evaluate employee records in order to lay off some workers on the basis of service time (the most recently hired employees are laid off first). Only the employee ids are stored in stack. Write a program using stack and implement the following functions: Main program should ask the appropriate option from the user, until user selects an option for exiting the program. i) ii) iii) iv) Enter_company (emp_id)- the accepted employee id(integer) is pushed into stack. Exit_company (- The recently joined employee will be laid off from the company Show_employee ()- display all the employees working in the company. count()- displays the number of employees working in the company.

1. A company wants to evaluate employee records in order to lay off some workers on the basis of service time (the most recently hired employees are laid off first). Only the employee ids are stored in stack. Write a program using stack and implement the following functions: Main program should ask the appropriate option from the user, until user selects an option for exiting the program. i) ii) iii) iv) Enter_company (emp_id)- the accepted employee id(integer) is pushed into stack. Exit_company (- The recently joined employee will be laid off from the company Show_employee ()- display all the employees working in the company. count()- displays the number of employees working in the company.

C++ for Engineers and Scientists

4th Edition

ISBN:9781133187844

Author:Bronson, Gary J.

Publisher:Bronson, Gary J.

Chapter7: Arrays

Section7.5: Case Studies

Problem 3E

See similar textbooks

Similar questions

The return address of a function can be displayed via a series of commands. Keep in mind that any changes you make to the stack must not impede the return of the procedure to its caller
It is possible to show the return address of a function by executing a set of instructions in sequence. Be mindful that any changes you make to the stack must not hinder the procedure's ability to restore control to the entity that called it.
A set of instructions may be used to show a function's return address. Remember that any modifications you make to the stack cannot prevent the procedure from returning to its caller.
in c++ Write an application that helps you create stack of pancakes. Pancake stack has to follow rules of stack data structure. Provide functions to add new pancake into stack, and if a customer wants to buy the pancakes remove the one present on top of the stack, print its flavor, at the end display all those who are left in the stack. The Pancakes class can have attributes flavor and topping.
in c++ visual studio: In this assignment you are going to create an application that reverses a text file and saves it. This application is a single file application so you do not need to think about additional classes; you will simply have a main.cpp file. Your application should accomplish: In main, create a stack. Then, open a text file and read its contents into a stack of characters.. The program should then pop the characters from the stack and save them in another text file. As this is a stack, (LIFO, so last item you put into the stack gets the first one to come out), the new file will be the reverse of the other. So if the text file at first said KHAS, the new file must have SAHK.
How do you create a a python program that implements the following functions get_top_card(card_stack) - returns the top card from any stack of cards (the return type is integer) and removes it from the card_stack . Used at the start of gameplay for dealing cards. This same function will also be used during each player’s turn to remove the top card from either the discard pile or from the deck. For example: get_top_card(lst) will return 53 and update the list (shown under section "Actual Program") to be lst = [3, 17, 11, 30, 33, 38, 49, 46, 25] add_card_to_discard(card, discard) - add the card (represented as just an integer) to the top of the discard pile (which is a list). This function does not return anything. For example: add_card_to_discard(77, lst) will update the list (shown under section "Actual Program") to be lst = [3, 17, 11, 30, 33, 38, 49, 46, 25, 53, 77] find_and_replace(new_card, card_to_be_replaced, hand, discard) - find the card_to_be_replaced (represented by an…
Write an application that helps you create stack of pancakes. Pancake stack has to follow rules of stack data structure. Provide functions to add new pancake into stack, and if a customer wants to buy the pancakes remove the one present on top of the stack, print its flavor, at the end display all those who are left in the stack. The Pancakes class can have attributes flavor and topping. Solve using stack data structures in C++ Programming
Create a program using java data structures That has the user enter their pay rate; the program will require the employee to enter hours for two days ( they work two days a week); and the conversion must be done. via a recursive function (all calculation and display happen in a single function). Include an additional function to prompt the user for their numbers. Do NOT USE Stack ADT, ANY ADTs, or structures that we created in class. Employee - hoursWorked : int - payRate : double -Employee(void) Default constructor - has NO parameters and must NOT return anything. Sets both attributes to 0. -AddHours(hoursToAdd : int) : void Adds the given hours to add to the hoursWorked attribute. -SetPayRate(newPayRate : double) : void Changes the payrate attribute to the given new pay rate. -GetHoursWorked(void) : int {hoursWorked} Gives back the hoursWorked attribute -+ GetPayRate(void) : double {payRate} Gives back the payRate attribute. -GetGrossPay(void) : double {grossPay} Computes and…
Stacks 1- Write a Python function that takes a user input of a word and returns True if it is a Palindrome and returns False otherwise (Your function should use a Stack data structure). A palindrome is a word that can be read the same backward as forward. Some examples of palindromic words are noon, civic, radar, level, rotor, kayak, reviver, racecar, redder, madam, and refer. 2- Write a Python function that takes a stack of integer numbers and returns the maximum value of the numbers in the stack. The stack should have the same numbers before and after calling the function. 3- Write a main function that tests the functions you wrote in 1 and 2 above and make sure that your code is well documented.
A sequence of instructions may be used to see the function's return address. Any modifications to the stack must be made with the return of the method to its caller in mind.
// 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
resizeToMatch main myCirc: Circle public Shape int y 250 int x 100 int int width int height 50 50 radius 25 Stack match: Shape int x int y 5 200 int width int height 60 60 Circle circPtr Circle public Shape int y 200 int x 5 int width int height 60 60 int radius 30 Heap The state of memory is shown just as we enter scope of the resizeToMatch function. The function's intent is to change the dimensions of the current Shape to match those of the parameter Shape. The function is a member function of the Shape class, and Circle is a subclass of Shape. The Circle subclass overrides the Shape resizeToMatch function to also update its radius attribute. Which of the following function calls is a valid way to call the resize ToMatch function. A. (*circptr).resizeToMatch (circptr) B. circPtr->resizeToMatch (circptr) C. myCirc. resizeToMatch (*circptr) D. myCirc->resize ToMatch (*circptr)