Which of the following takes O(n) time in worst case in array implementation of stack?

M

Mr. Dubey • 52.30K Points
Coach

Q. Which of the following takes O(n) time in worst case in array implementation of stack?

(A) pop

(B) push

(C) isempty

(D) pop, push and isempty takes constant time

Correct : Option (D)

Explanation:

 functions pop, push and isempty all are implemented in constant time in worst case.

Share

Discusssion

Login to discuss.

Be the first to start discuss.

Related MCQs

Q. A co-processor

Q. Logical extension of computation migration is

Q. Attribute standalone="no" should be included in xml declaration if a document

Q. Which of the following scenarios leads to linear running time for a random search hit in a linear-probing hash table?

Q. A full binary tree can be generated using

Q. What happens if the input is low in FSM?

Q. What are the characteristics of mutual exclusion using centralized approach?

Q. An xml component that defines the structure of a document is known as a(n):

Q. WiMAX MAC layer provides an interface between ___________

Q. Windows displays various options to shutdown. Which is suitable at the end ofday?