Home / Engineering / Information Retrival Techniques / Question

M

Mr. Dubey • 51.43K 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)
Correct answer : Option (A) - o (n)

Explanation: 
 the time complexity of evaluation of infix, prefix and postfix expressions is o (n).

Share

Previous

Next

Discusssion

Login to discuss.

Related MCQs on Information Retrival Techniques

Q. MPI provides a function, ____________ that returns the number of seconds that have elapsed since some time in the past.

Q. Which command is used to save the standard output in a file, as well as display it on the terminal?

Q. Which combinational device is used in crossbar switch for selecting proper memory from multiple addresses?

Q. The combination of an IP address and a port number is known as.

Q. Which computers are used as servers for any medium sized organizations?

Q. Which things are measured by software Test effectiveness?

Q. The dynamic replication algorithm takes into account

Q. which cruteria must satisfy in order to be accepted by the user,customer.

Q. print(foo())

Q. Find the name of those cities with temperature and condition whose condition is either sunny or cloudy but temperature must be greater than 70.