Stacks

**1.**In a Stack the command to access nth element from the top of the stacks will be

**2.**Consider the usual algorithm for determining whether a sequence of parentheses is balanced. What is the maximum number of parentheses that will appear on the stack AT ANY ONE TIME when the algorithm analyzes: (()(())(()))

**3.**………… is very useful in situation when data have to stored and then retrieved in reverse order.

**4.**Stack is used for

**5.**push() and pop() functions are found in

**6.**If locality is a concern, you can use _______ to traverse the graph.

**7.**Aposterior analysis are more accurate than apriori analysis because −

**8.**Prefix notation is also known as

**9.**In conversion from prefix to postfix using stack data-structure, if operators and operands are pushed and popped exactly once, then the run-time complexity is

**10.**In C programming, when we remove an item from bottom of the stack, then −