Avatto > GATE COMPUTER SCIENCE > Practice Questions > Computer Science And Information Technology > Programming and Data Structures > Queues

Programming and Data Structures MCQ - Queues

1 Which of the following is a collection of items into which items can be inserted arbitrarity and from which only the smallest item can be removed?

2 A________search begins the search with the element that is located in the middle of the array.

Binary Search algorithm can do this because it firstly searches the middle element. If the required element is less than the middle one, then search the middle element in the less than a part. If the required element is greater than the middle one, then search in the greater part. So the answer is 'D'.

3 A priority queue is used to implement a stack S that stores characters PUSH(C)is implemented as INSERT(Q,C,K)where K is an appropriate integer key chosen by the implementation.POP is implemented as DELETEMIN(Q).For a sequence of operations,the key chosen are in

4 Queues serve major role in

5 Which of the following data structure may give overflow error, even though the current number of elements in it is less than its size?

Your Progress

0%

Start Practising!

You've answered 0 of 8 questions in this topic.

Practice Spotlight

Build momentum in Queues

Start with a short question set, review every explanation, and revisit difficult questions before moving ahead.

Day 4 / 10

Global Spotlight

Build Your First Streak

Complete one short Queues session today, then return tomorrow. Consistency matters more than a long first session.

Day 7 / 10

Question Spotlight

Question:

A priority queue is used to implement a stack S that stores characters PUSH(C)is implemented as INSERT(Q,C,K)where K is an appropriate integer key chosen by the implementation.POP is…

A. Non-increasing order
B. Non-decreasing order
C. Strictly increasing order
D. Strictly decreasing order

Correct answer: D

Click to view the complete question details

Day 4 / 10 Open this question

Community Insight

Waiting for community attempts

Most Attempted TopicQueues
Most Challenging TopicQueues
Average Accuracy0%

Featured Question

(Based on recent community answers)

Q. #16839New

A priority queue is used to implement a stack S that stores characters PUSH(C)is implemented…

Try This Question →

This Week's Challenge

Complete 8 questions and set the community benchmark!

0 / 8 Start Challenge →

Why Practice with Avatto?

High Quality MCQsExam-focused questions with accurate answers

Detailed ExplanationsStep-by-step explanations to enhance learning

Latest Exam PatternBased on updated syllabus and pattern

Performance AnalyticsTrack performance and improve weak areas

100% Free PracticePractice unlimited questions for free

Forgot your password?

I agree with the Terms.