Data Structures

Abstract Data Types Algorithms Binary Heaps & Binary Search trees Graphs Hashing Linked Lists Queues Sorting & Searching Stacks Trees

C Programming MCQ Compiler Design Computer Graphics Computer Networks Computer Organization Architecture Data Mining Data Warehousing MCQ Database MCQ Digital Logic Mathematical Logic Object Oriented Programming Operating System Soft Computing Software Engineering MCQ Theory Of Computation MCQ Unix Web Technology Windows Programming MCQ

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: Updating your Comments.. Updating your Comments..

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: Updating your Comments.. Updating your Comments..

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: Updating your Comments.. Updating your Comments..

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: Updating your Comments.. Updating your Comments..

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: Updating your Comments.. Updating your Comments..

Sample Online Test

Computer System Architecture Test I/O Operations in C Operating System Unit Test 7 Unix Online Test 3 Sets & Relations Online Unit Test Trees

UGC NET Paper 1 UGC NET Computer Science UGC NET Exam GATE Exam Aptitude Viva Questions General Knowledge Computer Questions Online Test

Data Structures - Queues

Sample Online Test

Suggest an improvement

Data Structures quiz questions with answers

Data Structures exam questions answers

Data Structures MCQ questions Answers

Data Structures MCQ

Data Structure MCQ Pdf Download