www.ThinkITI.com

Home
MCQ
Search
Free Apps
Important
Study Groups
Contact Us
Policy

Home
MCQ
Objective Questions
Engineering
Computer Science
Computer Science Set-1
Data structures and Algorithms
27

Data structures and Algorithms MCQ with Answers

27) Which of the following is a collection of items into which items can be inserted arbitrarily and from which only the smallest item can be removed

Descending priority queue

Ascending priority queue

Fifo queue

None of these

Answer is:

Ascending priority queue

Data structures and Algorithms MCQ with Answers

For more MCQ's Click Here

Related Data structures and Algorithms MCQ with Answers

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

Serial

Random

Parallel

Binary Search

Answer is:

Binary Search

29) 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

Non-increasing order

Non-decreasing order

Strictly increasing order

Strictly decreasing order

Answer is:

Strictly decreasing order

30) Queues serve major role in

Simulation of recursion

Simulation of arbitrary linked list

Simulation of limited resource allocation

All of above

Answer is:

Simulation of limited resource allocation

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

Simple queue

Circular queue

Priority Queues

None of these

Answer is:

Circular queue

Data structures and Algorithms MCQ with Answers

For more MCQ's Click Here