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

    Question

    Which of the following operations on a data structure

    refers to the removal of an element from the front of a queue?
    A Pop Correct Answer Incorrect Answer
    B Dequeue Correct Answer Incorrect Answer
    C Push Correct Answer Incorrect Answer
    D Peek Correct Answer Incorrect Answer
    E Enqueue Correct Answer Incorrect Answer

    Solution

    The operation Dequeue refers to the removal of an element from the front of a queue. A queue follows the FIFO (First In, First Out) principle, meaning the first element inserted into the queue will be the first one to be removed. Dequeue is the term used to describe this removal process. The incorrect options: Pop : This refers to the removal of an element from the top of a stack, which follows the LIFO (Last In, First Out) principle. Push : This is the operation of adding an element to the top of a stack, not removing it from a queue. Peek : This operation retrieves the front element of a data structure without removing it. Enqueue : This refers to the operation of adding an element to the rear of a queue, not removing it.

    Practice Next
    More Algorithms Questions
    ask-question