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 queue is a,

FIFO (First In First Out) list

LIFO (Last In First Out) list

Ordered array

Linear tree

Discussion

MCQ

With what data structure can a priority queue be implemented?

Array

List

Heap

All of the mentioned

Discussion

MCQ

In a circular queue, how do you increment the rear end of the queue?

rear++

(rear+1) % CAPACITY

(rear % CAPACITY)+1

rear

Discussion

MCQ

Which of the following properties is associated with a queue?

First In Last Out

First In First Out

Last In First Out

None of the mentioned

Discussion

MCQ

Which of the following is not an application of priority queue?

Huffman codes

Interrupt handling in operating system

Undo operation in text editors

Bayesian spam filter

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