Prefix Calculator An arithmetic expression is in prefix form when operators are written before their operands. Here are some examples of prefix expressions and the values they evaluate to: Expression Value 12 12 + 2 51 53 * 5 7 35 + 16 4 +3 1 80 An expression (such as 12) that begins with an integer is a prefix expression that evaluates to itself. Otherwise, an expression is a prefix expression if it begins with an operator and is followed by two prefix expressions. In this latter case, the value of the expression is recursively computed from the values of its constituent prefix sub-expressions. Write a program that allows the user to enter prefix expressions in a text field. The program reads the expression, evaluates it, and displays the value in a suitable GUI component. Assume that the user enters expressions that use only positive integers and the two operators + and *. Your program should internally convert the prefix expression into a binary tree before evaluating it.

Prefix Calculator An arithmetic expression is in prefix form when operators are written before their operands. Here are some examples of prefix expressions and the values they evaluate to: Expression Value 12 12 + 2 51 53 * 5 7 35 + 16 4 +3 1 80 An expression (such as 12) that begins with an integer is a prefix expression that evaluates to itself. Otherwise, an expression is a prefix expression if it begins with an operator and is followed by two prefix expressions. In this latter case, the value of the expression is recursively computed from the values of its constituent prefix sub-expressions. Write a program that allows the user to enter prefix expressions in a text field. The program reads the expression, evaluates it, and displays the value in a suitable GUI component. Assume that the user enters expressions that use only positive integers and the two operators + and *. Your program should internally convert the prefix expression into a binary tree before evaluating it.

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter2: Basic Elements Of C++

Section: Chapter Questions

Problem 1TF: 1. Mark the following statements as true or false. a. An identifier must start with a letter and can...

See similar textbooks

Similar questions

In Phython Language: The DNA of a living organism consists of a string of 4 different bases represented with letters A, T, G, C. The DNA has a double helix structure which means these bases are paired in the string. An A base is always paired with a T base molecule and a C base is always paired with G molecule. Write a function matchingPair that accepts a single strand of the DNA structure as a string parameter and produces the pairing strand as a result and returns it. Strings can be considered as list of characters. Therefore the subscript notation that we use for lists is acceptable for strings as well. For example to reach to the 4th character of a string variable mystring, you may use the notation mystring[3]. Write another function search that accepts a long and a short DNA strand as parameters. The function should return the index positions of the occurrences of the short strand in the long strand as a list. Test your functions by accepting a long strand of DNA to find the…
Testing empty function ---------------------- Emptying s2="irregular" gives s2="" void empty(charPtr& s) { /* Empties the cstring s so that s is modified to an empty cstring. That is the memory allocated for s is deleted and a new memory is allocated so that s will have no printable characters but it will still have a null character at the end. REMARK: Parameter passing by reference is needed here as given in the function declaration here. */ }
Term by CodeChum Admin (JAVA CODE) Construct a class called Term. It is going to represent a term in polynomial expression. It has an integer coefficient and an exponent. In this case, there is only 1 independent variable that is 'x'. There should be two operations for the Term: public Term times(Term t) - multiplies the term with another term and returns the result public String toString() - prints the coefficient followed by "x^" and appended by the exponent. But with the following additional rules: if the coefficient is 1, then it is not printed. if the exponent is 1, then it is not printed ( the caret is not printed as well) if the exponent is 0, then only the coefficient is printed. Input The first line contains the coefficient and the exponent of the first term. The second line contains the coefficient and the exponent of the second term. 1·1 4·3 Output Display the resulting product for each of the test case. 4x^4
Complete the Swap() method in C language, main.c to exchange the values of the num field of two Number struct objects, num1 and num2. Thank you so much in advance Hint: Refer to the given Number struct to see the num data member. Ex: If num1 is 19 and num2 is 178, calling Swap(num1, num2) will swap the values so that num1 becomes 178 and num2 becomes 19.
IN C LANGUAGE ASAPP!! IT provides best solutions for manual work that makes life easier .Suppose a university wants tomanage its data in the form of software. Being a programmer you have been asked to create thefollowing structures in C.1. Student:a. Nameb. RegIdc. Enrolled courses (Labs + Theory)d. Departmente. Semester2. Faculty:a. Nameb. Departmentc. Designationd. Salary:Implement the following scenario using functions: setMarks(): This function will allow faculty membersto set Student marks. getGpa(): Takes students as an argument andcalculates the student’s GPA. displayStudent(): display the given student’sinformation. displayFaculty(): display the given faculty’sinformation.
(C Language) The Fibonacci sequence begins with 0 and then 1 follows. All subsequent values are the sum of the previous two, for example: 0, 1, 1, 2, 3, 5, 8, 13. Complete the Fibonacci() function, which takes in an index, n, and returns the nth value in the sequence. Any negative index values should return -1.
C++ PROGRAMMINGTopic: Binary Search Trees Explain the c++ code below.: SEE ATTACHED PHOTO FOR THE CODE IDEAIt doesn't have to be long, as long as you explain what the important parts of the code do. (The code is already implemented and correct, only the explanation needed) node* findNewRoot(node* curr) { if(curr->left == NULL) { return curr; } return findNewRoot(curr->left); } bool remove(int num) { bool isPresent = search(num); if(isPresent){ bool rem = false; int numOfChild; node* realRoot = search_node(root,num); if(realRoot->left == NULL && realRoot->right == NULL) { numOfChild = 0; } else if((realRoot->left != NULL && realRoot->right == NULL) || (realRoot->left == NULL && realRoot->right != NULL) ) { numOfChild = 1; } else if(realRoot->left != NULL && realRoot->right != NULL) { numOfChild = 2; } if(numOfChild == 0) { bool leadRoot = false; if(realRoot == root) {…
1. Mark the following statements as true or false. a. An identifier must start with a letter and can be any sequence of characters. (1) b. In C++, there is no difference between a reserved word and a predefined identifier. (1) c. A C++ identifier cannot start with a digit. (1) d. The collating sequence of a character is its preset number in the character data set. (2) e. Only one of the operands of the modulus operator needs to be of type int. (3) f. If ; and ;, then after the statement ; the value of b is erased. (6) g. If the input is 7 and x is a variable of type int, then the statement ; assigns the value 7 to x. (6) h. In an output statement, the newline character may be a part of the string. (10) i. In C++, all variables must be initialized when they are declared. (7) j. In a mixed expression, all the operands are converted to floating-point numbers. (4) k. Suppose . After the statement ; executes, y is 5 and x is 6. (9) i. Suppose . After the statement ; executes, the value of a is still 5 because the value of the expression is not saved in another variable. (9)
C++ PROGRAMMINGTopic: HashTable - PolyHash Quadratic Explain the c++ code below.: SEE ATTACHED PHOTO FOR THE PROBLEM INSTRUCTIONS It doesn't have to be long, as long as you explain what the important parts of the code do. (The code is already implemented and correct, only the explanation needed). You can also explain line by line for an upvote, thanks. EXPLAIN THE CODE BELOW: #include <cstdlib> #include <math.h> #include <cstring> #include <iostream> using namespace std; class HashTable { string* table; int N; int count; // TODO: Polynomial Hash Code using a=7 int hash_code(string key) { int code; int hash = 0; for (int i = 0; i < key.size(); i++) { char ch = key[i]; code += ((ch - 96) * pow(7, key.size() - (i + 1))); } return code; } // TODO: This hash table uses a MAD compression function // where a = 11, b = 461, p = 919 int compress(int code) { return (((11*code)+461) % 919) % N; }…
String Pair // Problem Description // One person hands over the list of digits to Mr. String, But Mr. String understands only strings. Within strings also he understands only vowels. Mr. String needs your help to find the total number of pairs which add up to a certain digit D. // The rules to calculate digit D are as follow // Take all digits and convert them into their textual representation // Next, sum up the number of vowels i.e. {a, e, i, o, u} from all textual representation // This sum is digit D // Now, once digit D is known find out all unordered pairs of numbers in input whose sum is equal to D. Refer example section for better understanding. // Constraints // 1 <= N <= 100 // 1 <= value of each element in second line of input <= 100 // Number 100, if and when it appears in input should be converted to textual representation as hundred and not as one hundred. Hence number…
C plus plus language : We need to have a generic module which reads in file and gives the output in the format which would facilitate other programs to do comparison like the one we saw above to carry out analysis and comparison. Response Required: Write a program that reads a given text, outputs the text as is, and also prints the number of lines and the number of times each letter appears in the text. An uppercase letter and a lowercase letter are treated as being the same; that is, they are tallied together. Since there are 26 letters, we use an array of 26 components to perform the letter count. We also need a variable to store the line count. The text is stored in a file, which we will call textin.txt. The output will be stored in a file, which we will call textout.txt Input: A file containing the text to be processed. Output: A file containing the text, number of lines, and the number of times a letter appears in the text
C++ PROGRAMMINGTopic: Binary Search Trees Explain the c++ code below.: SEE ATTACHED PHOTO FOR THE PROBLEM INSTRUCTIONS It doesn't have to be long, as long as you explain what the important parts of the code do. (The code is already implemented and correct, only the explanation needed) EXPLAIN THE CODE BELOW: int childCount(node* p) { bool Cright = false; bool Cleft = false; if(p->right != NULL){ Cright = true; } if(p->left != NULL){ Cleft = true; } if(Cleft == true && Cright== true){ return 2; } if(Cright){ return 1; } if(Cleft){ return -1; } return 0; } int set(node* p, int e) { int elem = p->element; p->element = e; return elem; } node* addSibling(node* p, int e) { node* P = p->parent; if(P != NULL){ if(sibling(p) == NULL){…