Question Discussion & Solution

MCQ

In a priority queue, insertion and deletion takes place at

front, rear end

only at rear end

only at front end

any position

Community Discussion

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

Similar Questions

MCQ

A data structure where elements can be added or removed at either end but not in the middle

Linked lists

Stacks

Queues

Deque

Discussion

MCQ

What are the applications of dequeue?

A-Steal job scheduling algorithm

Can be used as both stack and queue

To find the maximum of all sub arrays of size k

All of the mentioned

Discussion

MCQ

What is the space complexity of a linear queue having n elements?

O(n)

O(nlogn)

O(logn)

O(1)

Discussion

MCQ

With what data structure can a priority queue be implemented?

Array

List

Heap

All of the mentioned

Discussion

MCQ

A data structure in which elements can be inserted or deleted at/from both the ends but not in the middle is?

Queue

Circular queue

Dequeue

Priority queue

Discussion

Banking

Engineering

General

Medical

Question Discussion & Solution

Report Error

Community Discussion

Similar Questions

Report Error

Report Error

Report Error

Report Error

Report Error

More Data Structure Topics

Data Structure Basics

Abstract data types

Arrays

Lists

Stacks

Queues

Trees

Binary Trees

B Trees

Heaps

Hash based structures

Graphs

Mixed

Banking

Engineering

General

Medical

Question Discussion & Solution

report Report Error

forum Community Discussion

auto_awesome Similar Questions

report Report Error

report Report Error

report Report Error

report Report Error

report Report Error

category More Data Structure Topics

Data Structure Basics

Abstract data types

Arrays

Lists

Stacks

Queues

Trees

Binary Trees

B Trees

Heaps

Hash based structures

Graphs

Mixed

Report Error

Community Discussion

Similar Questions

Report Error

Report Error

Report Error

Report Error

Report Error

More Data Structure Topics