a) O(n) where n is the length of the equation
b) O(n) where n is number of operands
c) O(1)
d) O(logn) where n is length of the equation
Answer: a
Explanation: The processes that are involved are reversing the equation (O(n)), pushing them all onto the stack(O(n)), and popping them one by one and solving them (O(n)). Hence the answer is O(n) where n is the length of the equation.
Related Posts
Which of the following statement is incorrect with respect to balancing symbols algorithm?
Which of the following does the balancing symbols algorithm include?
Which is the most appropriate data structure for applying balancing of symbols algorithm?
In balancing parentheses algorithm, the string is read from?
Which application of stack is used to ensure that the pair of parentheses is properly nested?
What is the time complexity of balancing parentheses algorithm?
What is the number of moves required to solve Tower of Hanoi problem for k disks?
Join The Discussion