M

Mr. Dubey • 100.69K Points
Coach

Q. What is the time complexity of evaluation of postfix expression algorithm?

  • (A) o (n)
  • (B) o (n log n)
  • (C) o (n2)
  • (D) o (m log n)
Share
Explanation by: Mr. Dubey
the time complexity of evaluation of infix, prefix and postfix expressions is o (n).

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Related MCQs

Q. Which one is not a product quality factor of McCall quality model?

Q. the practice of charging an interest rate to an initial sum and to any previously accumulated interest that has not been withdrawn.

Q. A proxy firewall filters at

Q. Most of the global warming is due to the perturbation of which of these cycles?

Q. Select distinct Dept_name from instructor ; How many row(s) are displayed ?

Q. CASE work benches support

Q. To improve the performance of a business process, which of the following is most relevant?

Q. Virus:

Q. On multiplication of (10.10) and (01.01), we get

Q. A full adder logic circuit will have

Question analytics