Suppose that you have the following declaration:stackType<double> stack(50);double num;and the input is25 64 -3 6.25 36 -4.5 86 14 -12 9Write a C++ code that processes this input as follows: If the number is nonnegative, it pushes the square root of the number onto the stack; otherwise it pushes the square of the number onto the stack. After processing these numbers write a C++ code that outputs the elements of the stack.

Suppose that you have the following declaration:stackType<double> stack(50);double num;and the input is25 64 -3 6.25 36 -4.5 86 14 -12 9Write a C++ code that processes this input as follows: If the number is nonnegative, it pushes the square root of the number onto the stack; otherwise it pushes the square of the number onto the stack. After processing these numbers write a C++ code that outputs the elements of the stack.

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

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…
What will be the stack content after following operations: Push 5 Push 8 Pop Push 1 Push 12 Pop
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.
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.
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…
PLEASE NAME AND SEPERATE THE 3 FILES CORRECTLY: 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…
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…
Write a sequence of statements that display a subroutine’s return address. Be sure that whatever modifications you make to the stack do not prevent the subroutine from returning to itscaller
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.
Suppose that stack is an object of type stackType<double>, the value of stack.top is 8, and dec is a variable of type double.a. How many elements are in stack?b. What is the index of the top element of stack?c. Write the statement that assigns the top element of stack to dec.d. Write the statement that removes the top element of stack.
For this code just explain the void pop function, with enough explanation that how it is working. Thanks #include<iostream> using namespace std; int choice, j=0;int stack[50];int *top;bool Exit_Indicator = false; void displayStack() { cout << "\n\t~Stack Display~\nTOP ->"; for (int i = j-1; i >= 0; i--) cout << "\t|\t" << stack[i] << "\t|" << endl; cout << "\t-----------------";} void push(int i){ cout << "\n(" << i << ") has been PUSHED into the stack!"; *top = i; top++; j++;} void pop(){ if((*(top-2) != 0 && *(top-1)!= 0) || (*(top-2) == 0 && *(top-1)!= 0)) { cout << "\n(" << *(top-1) << ") has been POPPED from the stack!"; *(top-1)= 0; top--; j--; } else{ cout<<"\nTHE STACK IS EMPTY";}} int main() { int value; top = stack; do { cout <<…
Suppose the following operations were performed on an empty stack:pus h(8);pus h(?);pop();push (19);pus h(21);pop();Insert numbers in the following diagram to show what will be stored in the staticstack after the operations have executed