McqMate
| 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) |
| Answer» A. o (n) | |
| Explanation: the time complexity of evaluation of infix, prefix and postfix expressions is o (n). | |
View all MCQs in
Information Retrival TechniquesNo comments yet