Data Structure 1 Share with others Enter details and click on Next Name Email School Name Q1. An organized way of storing and retrieving data in computer is called ___________ Data type Data Structure Data None of the above None Q2. ________ is a Sequential data structure. List Array Both of the above None Q3. Size of list in python is fixed.(T/F) True False None Q4. Stack is ______ type. LIFO FIFO None Q5. Elements in stacks can be added or removed from _____ top rear end None Q6. A pile of books is an example of __________ Queue List Stack None of the above None Q7. Two major operations of stack are push and pop push and rem Add and pop add and rem None Q8. The following statement is creating an empty _________ L = [ ] Stack Queue Both of the above None Q9. First element of stack can be accessed by index _______ 1 -1 0 None Q10. The following statement is checking that ____________ if st == [ ] : empty list empty stack empty queue All of the above None Time's upTime is Up! Related Share with others Leave a ReplyCancel reply