Q1. An organized way of storing and retrieving data in computer is called ___________
Q2. ________ is a Sequential data structure.
Q3. Size of list in python is fixed.(T/F)
Q4. Stack is ______ type.
Q5. Elements in stacks can be added or removed from _____
Q6. A pile of books is an example of __________
Q7. Two major operations of stack are
Q8. The following statement is creating an empty _________
Q9. First element of stack can be accessed by index _______
Q10. The following statement is checking that ____________
