Using Java: Write a program to perform the following operations on a stack. a) Create functions for push and pop operations of the stack. b) Write a function to convert an infix expression to a postfix expression. Pass a one-dimensional character array P to the function as input (infix exp) and return character array Q (postfix exp). Test your program for the following input P : ( A – (B / C ) * D + E ) * F % G c) Write a function for the evaluation of a given postfix expression. For testing pass the postfix expression Q of part b and supply the following set of values. A = 90, B = 50, C = 2, D = 3, E = 1, F = 2, G = 5

Using Java: Write a program to perform the following operations on a stack. a) Create functions for push and pop operations of the stack. b) Write a function to convert an infix expression to a postfix expression. Pass a one-dimensional character array P to the function as input (infix exp) and return character array Q (postfix exp). Test your program for the following input P : ( A – (B / C ) * D + E ) * F % G c) Write a function for the evaluation of a given postfix expression. For testing pass the postfix expression Q of part b and supply the following set of values. A = 90, B = 50, C = 2, D = 3, E = 1, F = 2, G = 5

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 C++ or Python program to read your full name in character array and reverse it using a stack . • Create a character array that can hold any name with a maximum of 50 characters • Create an array of the same size as the character array that can be used as an ADT ( Stack ) Read any user - given input ( name ) • Use stack operations to reverse the name • Your program must have the functions PUSH ( ) and POP ( ) • Show each step of output on the screen .
Data Structure & Algorithm: Write a program to perform the following operations on a stack. a) Create functions for push and pop operations of the stack.b) Write a function to convert an infix expression to a postfix expression. Pass a one-dimensional character array P to the function as input (infix exp) and return character array Q (postfix exp). Test your program for the following input P : ( A – (B / C ) * D + E ) * F % G c) Write a function for the evaluation of a given postfix expression. For testing pass the postfix expression Q of part b and supply the following set of values. A = 90, B = 50, C = 2, D = 3, E = 1, F = 2, G = 5
Convert the following expression from infix to postfix and show the contents of Stack and the output expression at each step ((A-((B+C)*D/E))/(F*G+H))
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)
Do not copy from chegg and do it in c++ Write a program to convert an infix expression to a postfix expression. Input: an infix expression Output: the corresponding postfix expression Note: You must use the stack to implement this task. And you can use any one of the above stack implementations. Test your program using the following expressions: (a + b) * c (a - b) / (c +d) (a*b+c/d)/e
Do not copy from chegg and do it in c++ Write a program to evaluate a postfix expression. Input: a postfix expression. E.g. 3 5 + Output: the result of the expression. E.g. the result for the above input is 8. Note: You must use the stack to implement this task. And please give the stack solutions for both the following implementations: Implement the array-based stack Implement the pointer-based stack Test your program using the following expressions: 3 5 + 3 5 + 6 * 3 5 6 + * 3 5 6 * 8 – 2 / + 12 20 + 16 /
Code with comments and output screenshot is must for an Upvote Create a Java function that uses a stack and no arithmetic to compare the number of 0's and 1's in a string. If # of 0's is greater, return -1. If # of 1's is greater, return 1. If equal, return 0.
write a function that takes a pointer to the top of a stack <double> and creates and returns a new stack double where the new stack contains all nodes from the original stack with data == 0 c++
Convert the code for C++ to C. theres also an error in it. Thanks! .... #include <bits/stdc++.h> using namespace std; int precedence(char op){ if(op == '+'||op == '-') return 1; if(op == '*'||op == '/') return 2; return 0; } // this function will perform arithmetic operations. int applyOp(int a, int b, char op){ switch(op){ case '+': return a + b; case '-': return a - b; case '*': return a * b; case '/': return a / b; } } int evaluate(string tokens){ int i; //we are using stack to store integer values. stack <int> values; // using this stack to store operators. stack <char> ops; for(i = 0; i < tokens.length(); i++){…
Convert the following expression from infix to postfix and show the contents of Stack and the output expression at each step.Perform this task on paper, take a clear picture of solution and paste it in answer section. ((A-((B+C)*D/E))/(F*G+H))
Given a stack of objects of type char, write the output and the stack contents atthe return of each function call. The stack is initially empty. (Assume pop() doesn’t return anything).
2. Convert the following infix expression to postfix using a stack. (a * b / c) + (b + c3 – a) – (a + b) * (b * c)