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. In outputs depend only on the combination of current state and inputs

Q. What is ACID properties of Transactions?

Q. If a set is a frequent set and no superset of this set is a frequent set, then it is called ________.

Q. Deadlocks are possible only when one of the transactions wants to obtain a(n) ____ lock on a data item.

Q. Genetic algorithms are search algorithms based on the mechanics of natural .

Q. In a real time system the computer results ____________

Q. The correlation coefficient for two real-valued attributes is –0.85. What does this value tell you?

Q. What is the average case complexity of bubble sort?

Q. Which of the architecture is power efficient?

Q. The network layer issues request to which layer?