# Data Structures - 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?
 A. Descending priority queue B. Ascending priority queue C. Fifo queue D. None of these Answer Report Discuss Option: B Explanation : Click on Discuss to view users comments. Name said: (2:37pm on Sunday 23rd March 2014) The data is stored arbitrarily in the priority queue. But when data is removed in the sequence of- smallest, 2nd smallest, 3rd samllest...etc then it is called ascending priority queue. If data is removed in the sequence- largest, 2nd largest, 3rd largest...etc then it is called descending priority queue. Write your comments here:
2:

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

 A. Serial B. Random C. Parallel D. Binary Search Answer Report Discuss Option: D Explanation : Binary Search  algorithm  can do this because  it firstly searchs the middle element. If required element is less than the middle one, then search the middle element in the less than part. If required element is greater than the middle one, then search in the greater part. So the answer is 'D'. Click on Discuss to view users comments. Write your comments here:
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
 A. Non-increasing order B. Non-decreasing order C. Strictly increasing order D. Strictly decreasing order Answer Report Discuss Option: D Explanation : Click on Discuss to view users comments. Write your comments here:
4:   Queues serve major role in
 A. Simulation of recursion B. Simulation of arbitrary linked list C. Simulation of limited resource allocation D. All of above Answer Report Discuss Option: C Explanation : Click on Discuss to view users comments. Write your comments here:
5:

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

 A. Simple queue B. Circular queue C. Priority Queues D. None of these Answer Report Discuss Option: B Explanation : Click on Discuss to view users comments. Write your comments here:

Syllabus covered in this section is-

• Abstract data types
• Algorithms
• Stacks, Queues
• Linked Lists
• Trees, Binary search trees
• Binary heaps

This Section covers Data Structures Questions Answers using C language .
Who can benefit -

• Any student who is pursuing B.Sc. in Information Technology can also use this Data Structures mcq section.
• Data Structures MCQs can also be used by any student who is pursuing any undergraduate or postgraduate degree in Computer Science.
• Any candidate who has to appear for DOEACC A, B or C level Exam can also use Data Structures Questions Answers to gain credits in their exams.
• Candidates appearing for Kendriya Vidyalya Sangathan Entrance Exam can also use Data Structures Multiple Choice Questions Answers for the preparation of their exams.
• Data Structures Questions Answers can also be used by MCA students for the preparation of their exams.
• You can also get Data Structures mcq pdf if you purchase an e-book from site.
• You can download Data Structures MCQ pdf from this site.
• You can get access to Data Structures Multiple Choice Questions Answers  EBook.

Various Search Terms used for this section are