M

Mr. Dubey • 52.30K Points
Coach 

Q. What is the time complexity of an infix to postfix conversion algorithm?

(A) O(N log N)
(B) O(N)
(C) O(N2)
(D) O(M log N)
Correct : Option (B)

Share

Discusssion

Login to discuss.

Loading Comments....

Related MCQs

Q. Some of the utilities of DBMS are ............. i) Transaction ii) Backup iii) File organization iv) Process Organization

Q. The surface area of a tape is the surface area of a disk.

Q. are used to ensure that transactions access each data item in order of the transactions’ if their accesses confli

Q. The expression 'delayed load' is used in context of

Q. Which is relation calculus:

Q. (p → q) ∧ (p → r) is logically equivalent to

Q. The method by which strategies are operational zed or executed within the organization is called:

Q. ] for row in (0, 1, 2)]

Q. A data structure where elements can be added or removed at either end but not in the middle is called …

Q. The symbols that can’t be replaced by anything are called -----------------