A directory of Objective Type Questions covering all the Computer Science subjects. Here you can access and discuss Multiple choice questions and answers for various compitative exams and interviews.

Discussion Forum

Que. In conversion from prefix to postfix using stack data-structure, if operators and operands are pushed and popped exactly once, then the run-time complexity is
a. Ο(1)
b. Ο(n)
c. Ο(log n)
d. Ο(n2)
Answer:Ο(n)
Confused About the Answer? Ask for Details Here
Know Explanation? Add it Here

Similar Questions: