2. Sample Papers
  3. 12th Class
  4. Computers Science

12th Class Computers Science Sample Paper Data Structure - Sample Paper-2

  • question_answer
    If insertion can take place at one end (rear) and deletion can be done from another end (front) from a list, this list is called:

    A) Queue    

    B) Stack

    C) Tree                 

    D) Linked list

    Correct Answer: A

    Solution :

    [a] If insertion can take place at one end (rear) and deletion can be done from another end (front) from a list, this list is called Queue. 


You need to login to perform this action.
You will be redirected in 3 sec spinner