Q2. Write a program that reads repeatedly from the keyboard a prefix expression, converts it to a fully parenthesized infix expression, and determines the value of the expression. Your program must use a stack. Assume each entered prefix expression contains only integer numbers and the *, /, +, - operators. After reading and processing a prefix expression, your program should ask the user if he/she wants to enter another expression as shown in the example below. Example: Enter a prefix expression: + 5 * 10 2 The corresponding infix expression is: (5 + (10 * 2)) and its value is 25 Do you want to enter another expression (Y/N)? Y Enter a prefix expression: / * 3 2 - 7 4 The corresponding infix expression is: ((3 * 2)/(7 - 4) and its value is 2 Do you want to enter another expression (Y/N)? N

Q2. Write a program that reads repeatedly from the keyboard a prefix expression, converts it to a fully parenthesized infix expression, and determines the value of the expression. Your program must use a stack. Assume each entered prefix expression contains only integer numbers and the , /, +, - operators. After reading and processing a prefix expression, your program should ask the user if he/she wants to enter another expression as shown in the example below. Example: Enter a prefix expression: + 5 10 2 The corresponding infix expression is: (5 + (10 * 2)) and its value is 25 Do you want to enter another expression (Y/N)? Y Enter a prefix expression: / * 3 2 - 7 4 The corresponding infix expression is: ((3 * 2)/(7 - 4) and its value is 2 Do you want to enter another expression (Y/N)? N

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Suppose that we are asked to run the program and when our program reaches to line 23, weare also asked to take a snapshot of our program’s run-time stack. So, please draw full ARIsof the all subprograms which are placed in the stack at line 23.
Write a program that inputs a list of numbers already stored in a stack STACKand sorts them, making use of a temporary stack TEMP. The sorted list of numbersshould be made available in STACK.
Write a program that reads 10 integers anddisplays them in the reverse of the order in which they were read. If two consecutivenumbers are identical, then only display one of them. Implement yourprogram using only stack and not arrays or queues.
Consider the following segment of code:procedure Mvar x: integer;procedure A (c: integer)var a, b: integer;procedure Bvar b, c, d: integer;begin {B}….a := c – d;….end B;begin {A}….x := b + c;….B()….end A;begin {M}….A(3)….end M;Assuming the definition of M is at static nesting level 0. Draw the runtime stack that will be ineffect at the execution of “a := c – d;”. Show the static and dynamic links, and the currentpositions of the EP and SP pointers.What is the static distance to x’s environment of definition and the offset within the environmentwhen “a := c – d;” is executed?
Write a program that inputs a list of numbers already stored in a stack STACK and sorts them, making use of a temporary stack TEMP. The sorted list of numbers should be made available in STACK.
Write a Java public static general function which doesn't belong to the Stack class, isGreaterThan that determines if one stack is greater than another stack. If the summation of every other item(starting at the top) from one stack is greater than the summation of every other item(starting at the top) from another, return true, otherwise, return false. After you call this method, both stacks should stay the same as they are called before. Receives: a Stack type argument S1 and another Stack type argument S2 Postcondition: If the summation of every other item (starting at the top) from S1 is greater than the summation of every other item (starting at the top) from S2, return true, otherwise, return false. Both S1 and S2 should stay the same as they are called before. public static boolean isGreaterThan(Stack S1, Stack S2)
write a program in Python that checks if the parenthesis in the equation “([[y+t]*(j+9v)*{ww+yy})” is balanced or not. Use a class called Stack() with all relevant functions to achieve this task.
Write a stack client Parentheses that reads in a text stream from standard inputand uses a stack to determine whether its parentheses are properly balanced. For example, your program should print true for [()]{}{[()()]()} and false for [(]).
Draw a stack: We start with an empty stack and then execute the following commands: push 4 push 7 pop push 5 push 5 push 8 push 7 push 8 pop pop pop push 7 push 6 pop pop push 8
the Program in C++, 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: 1-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. 2-When you reach the end of the string, pop the top value of the stack. This is the result of the postfix expression. [Note: In Step…
What is the value of the following postfix expressions? Show the stack contents as each operand and operator is processed. Make it clear where the top of the stack is at each step? 5 1 / 3 * 3 1 – *
Write a C++ program that allows a user to enter a maximum of 50 characters in a stack object. Then have the program sort the stack contents in increasing order. For example,if the stack’s contents are initially D, E, A, and B, its final contents are A, B, D, and E.