Abstract Data Types on Data Structure and Algorithms related Questions and Answers


Question :   You are asked to perform a queue operation using a stack. Assume the size of the stack is some value ‘n' and there are ‘m' number of variables in this stack. The time complexity of performing deQueue operation is (Using only stack operations like push and pop)(Tightly bound).

1. O(m)
2. O(n)
3. O(m*n)
4. Data is insufficient
Answer :   1 - O(m)  

* Be the First to Post a Comment.

Submit comment :


Captcha Image
Reload

Ask Question

Captcha Image
Reload

Note : Name and Email never shown.





Subscribe


Become a part of EducationForever. Subscribe to our FREE Newsletter