FILO stands for

• First In Lost Out

• First In Last Out

• Fast In Last Out

• Fade In Last Out

Insert an element into the stack

• PUSH

• POP

• TRAVERSE

• PEEK

Delete an element from the stack

• PUSH

• POP

• TRAVERSE

• PEEK

Recursion means

• A Function can call other function

• A function can call itself

• Function Declaration

• Function Definition

Infix means

• An operator is placed before the operands

• An operator is placed after the operands

• An operator is placed between the operands

• None of these

Stack Applications are

• Recursion

• Infix to Postfix

• Postfix Evaluation

• All of these

TOP of the element in the Stack

• Push

• PEEK

• TRAVERSE

• POP

((a+b)*(c+d)) expression's postfix notation

• ab+cd*+

• ab+cd+*

• abcd++*

• +ab+cd*

To show all the elements from the stack is called as

• PUSH

• POP

• PEEK

• TRAVERSE

when the stack is full

• TOP>=size-1

• TOP<0

• TOP>0

• TOP==0