πŸ“’ Too many exams? Don’t know which one suits you best? Book Your Free Expert πŸ‘‰ call Now!


    Question

    Which data structure is ideal for priority-based

    scheduling?
    A Stack Correct Answer Incorrect Answer
    B Queue Correct Answer Incorrect Answer
    C Deque Correct Answer Incorrect Answer
    D Priority Queue Correct Answer Incorrect Answer
    E Array Correct Answer Incorrect Answer

    Solution

    Priority Queue allows access to elements based on priority rather than order.

    Practice Next
    More Data Structure Questions
    ask-question