Let S be a stack of size n >= 1. Starting with the empty stack, suppose we push the first n natural numbers in sequence, and then perform n pop operations. Assume that Push and Pop operation take X seconds each, and Y seconds elapse between the end of one such stack operation and the start of the next operation. For m >= 1, define the stack-life of m as the time elapsed from the end of Push(m) to the start of the pop operation that removes m from S. The average stack-life of an element of this stack is
- I think it is a spam
- It is abusive
- It is harassing me
posted this Forum Thread on : GATE
Vote up, this is encouraging or helpful0
Vote down, this is not very encouraging or helpful0
On: 26th August 2017, 13:48 PM
Please login or register to post comment.
This discussion thread has no replies.
Be the first one to post a reply and earn points and badges.