Page 1 - Data Structure-List
P. 1

Computer Science

                                                     Class - XII

                                    Chapter – Data Structure - List


               1.  ____________________ means organization of data.
               2.  A data structure has well defined _____________ and ______________.
               3.  A __________________ is a linear list also known as LIFO list.
               4.  A __________________ is a linear list also known as FIFO list.
               5.  A __________________ is a mutable sequence of sequence of data elements indexed by
                   their position.
               6.  ________________ means accessing/ visiting/ processing each element of any data data
                   structure.

               7.  _______________ and _______________ are the operations defined for Stack.
               8.  _______________ and _______________ are the operations defined for queue.
               9.  What is data structure?
               10. Name the two types of data structures and give one point of difference between them.
               11. Give one point of difference between an array and a list in Python.
               12. How are lists implemented in memory?
               13. What is sequential allocation of memory? Why do we say that lists are stored
                   sequentially?

               14. How is memory allocated to a list in Python?
               15. Write a function that takes a list that is sorted in ascending order and a number as
                   arguments. The function should insert the number passed as argument in a sorted list.
               16. Write a function that takes a list that is sorted in ascending order and a number as
                   arguments. The function should delete the number from the list.
               17. How is linear search different from binary search?
               18. Accept a list containing integers randomly. Accept any number and display the position
                   at which the number is found is the list.
               19. Write a function that takes a sorted list and a number as an argument. Search for the
                   number in the sorted list using binary search.
               20. Write a program to sort an integer list using insertion list.

               21. Consider the following unsorted list [Neena, Meeta, Geeta, Reeta, Seeta]. Sort the list
                   using bubble sort.
   1