📢 Too many exams? Don’t know which one suits you best? Book Your Free Expert 👉 call Now!

    Question

    A data structure in which elements can be inserted or

    deleted at/from both the ends but not in the middle is :
    A Queue Correct Answer Incorrect Answer
    B Circular queue Correct Answer Incorrect Answer
    C Dequeue Correct Answer Incorrect Answer
    D Priority queue Correct Answer Incorrect Answer
    E None Correct Answer Incorrect Answer

    Solution

    In dequeuer, we can insert or delete elements from both the ends. In queue, we will follow first in first out principle for insertion and deletion of elements. Element with least priority will be deleted in a priority queue.

    Practice Next
    More IT Operating System Questions

    Relevant for Exams:

    ask-question