What is the time complexity of evaluation of postfix expression algor – McqOptions

MCQOPTIONS

1.	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» B. o (n log n)

Discussion

No Comment Found

Related MCQs

Which of the following term is best defined by the statement “In a distributed system, several processes may operate at the same time on separate computers on the network.”?
to produce NGrams of the desired length.
depend on there being a clear separation between the presentation of information and the computations that create and process that information.
In cluster analysis of microarray data– A node is created between the scoring pair, and the gene expressed profiles of these two genes are averaged and the joined elements are weighted by the of elements they contain.
Two forces whose magnitudes are in ratio of 3:5 give a resultant of 35N. If the angle of inclination is 60°, calculate the magnitude of each force.
approach of a relationship between the systems.
TCP/IP model was developed the OSI model.
A search key containing more than one attribute is referred to as a search key.
What’s the role of lyaopunov fuction?
The of all the variables in direct or complemented from is a maxterm.