ЁЯУв Too many exams? DonтАЩt know which one suits you best? Book Your Free Expert ЁЯСЙ call Now!

    Question

    You need to store a sequence of items where elements are

    always added to one end and removed from the other end. Which data structure is most suitable?
    A Stack Correct Answer Incorrect Answer
    B Queue Correct Answer Incorrect Answer
    C Linked List Correct Answer Incorrect Answer
    D Array Correct Answer Incorrect Answer
    E Hash Map Correct Answer Incorrect Answer

    Solution

    This describes the First-In, First-Out (FIFO) behavior of a Queue. Elements are enqueued (added) at the rear and dequeued (removed) from the front.

    Practice Next
    More IT Operating System Questions
    ask-question