Evaluate the following statement using infix evaluation algorithm and choose the correct answer. 1+2*3-2(a) 3(b) 6(c) 5(d) 4Asked question is from Evaluation of an Infix Expression (Not Parenthesized) topic in chapter Application of Stacks of Data Structures & Algorithms IThe question was asked in an internship interview.

Evaluate the following statement using infix evaluation algorithm and

1.	Evaluate the following statement using infix evaluation algorithm and choose the correct answer. 1+2*3-2(a) 3(b) 6(c) 5(d) 4Asked question is from Evaluation of an Infix Expression (Not Parenthesized) topic in chapter Application of Stacks of Data Structures & Algorithms IThe question was asked in an internship interview.
Answer» The correct option is (C) 5 The explanation is: ACCORDING to precedence of OPERATORS, * is EVALUATED first. + and – have equal priorities. Hence, 1+6-2= 5.

Discussion

No Comment Found

Related InterviewSolutions

Which of the following statement is invalid with respect to balancing symbols?(a) [(A+B) + (C-D)](b) [{A+B}-{C-[D+E]}](c) ((A+B) + (C+D)(d) {(A+B) + [C+D]}The question is from Application of Stacks topic in chapter Application of Stacks of Data Structures & Algorithms IThis question was posed to me in an interview for job.
How many passes does the balancing symbols algorithm makes through the input?(a) one(b) two(c) three(d) fourMy doubt stems from Application of Stacks topic in chapter Application of Stacks of Data Structures & Algorithms IThe question was asked in an interview for job.
Is the given statement ((A+B) + [C-D]] valid with respect to balancing of symbols?(a) True(b) FalseThis key question is from Application of Stacks in division Application of Stacks of Data Structures & Algorithms IThe question was asked in an interview for job.
An error is reported when the stack is not empty at the end.(a) True(b) FalseI need to ask this question from Application of Stacks topic in portion Application of Stacks of Data Structures & Algorithms II have been asked this question in an internship interview.
If the corresponding end bracket/braces/parentheses is encountered, which of the following is done?(a) push it on to the stack(b) pop the stack(c) throw an error(d) treated as an exceptionThis interesting question is from Application of Stacks topic in section Application of Stacks of Data Structures & Algorithms IThe question was posed to me during an interview.
When the corresponding end bracket/braces/parentheses is not found, what happens?(a) The stack is popped(b) Ignore the parentheses(c) An error is reported(d) It is treated as an exceptionMy question is taken from Application of Stacks topic in division Application of Stacks of Data Structures & Algorithms II have been asked this question in class test.
What should be done when an opening parentheses is read in a balancing symbols algorithm?(a) push it on to the stack(b) throw an error(c) ignore the parentheses(d) pop the stackQuestion is from Application of Stacks in section Application of Stacks of Data Structures & Algorithms IThis question was addressed to me in my homework.
Which of the following statement is incorrect with respect to balancing symbols algorithm?(a) {[()]}(b) ([ )](c) {( )}(d) { [ ] }The query is from Application of Stacks topic in chapter Application of Stacks of Data Structures & Algorithms II got this question by my school teacher while I was bunking the class.
Which of the following does the balancing symbols algorithm include?(a) balancing double quotes(b) balancing single quotes(c) balancing operators and brackets(d) balancing parentheses, brackets and bracesThe doubt is from Application of Stacks in portion Application of Stacks of Data Structures & Algorithms IThis question was addressed to me in class test.
Which is the most appropriate data structure for applying balancing of symbols algorithm?(a) stack(b) queue(c) tree(d) graphI want to ask this question from Application of Stacks topic in portion Application of Stacks of Data Structures & Algorithms II had been asked this question in homework.

Discussion

No Comment Found

Related InterviewSolutions

Reply to Comment